./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:53:33,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:53:33,200 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:53:33,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:53:33,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:53:33,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:53:33,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:53:33,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:53:33,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:53:33,233 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:53:33,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:53:33,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:53:33,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:53:33,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:53:33,236 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:53:33,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:53:33,237 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:53:33,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:53:33,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:53:33,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:53:33,239 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:53:33,240 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:53:33,241 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:53:33,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:53:33,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:53:33,242 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:53:33,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:53:33,243 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:53:33,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:53:33,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:53:33,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:53:33,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:53:33,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:53:33,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:53:33,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:53:33,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:53:33,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:53:33,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:53:33,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:53:33,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:53:33,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:53:33,248 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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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 -> 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 [2023-11-29 00:53:33,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:53:33,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:53:33,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:53:33,519 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:53:33,519 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:53:33,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i [2023-11-29 00:53:36,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:53:36,706 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:53:36,706 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i [2023-11-29 00:53:36,727 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/97c4781ad/88f6774dfe7e43a48af093addbc8ff3d/FLAG4751f0c8b [2023-11-29 00:53:36,744 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/97c4781ad/88f6774dfe7e43a48af093addbc8ff3d [2023-11-29 00:53:36,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:53:36,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:53:36,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:53:36,751 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:53:36,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:53:36,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:53:36" (1/1) ... [2023-11-29 00:53:36,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e1d8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:36, skipping insertion in model container [2023-11-29 00:53:36,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:53:36" (1/1) ... [2023-11-29 00:53:36,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:53:37,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:53:37,409 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 00:53:37,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7785ec77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:37, skipping insertion in model container [2023-11-29 00:53:37,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:53:37,410 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:53:37,413 INFO L158 Benchmark]: Toolchain (without parser) took 663.02ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 114.9MB in the end (delta: -18.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 00:53:37,414 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:53:37,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.00ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 114.9MB in the end (delta: -18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 00:53:37,417 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.21ms. Allocated memory is still 100.7MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.00ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 114.9MB in the end (delta: -18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:53:39,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:53:39,251 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:53:39,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:53:39,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:53:39,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:53:39,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:53:39,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:53:39,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:53:39,289 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:53:39,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:53:39,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:53:39,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:53:39,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:53:39,292 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:53:39,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:53:39,294 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:53:39,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:53:39,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:53:39,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:53:39,295 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:53:39,296 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:53:39,296 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:53:39,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:53:39,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:53:39,298 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:53:39,298 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:53:39,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:53:39,299 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:53:39,299 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:53:39,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:53:39,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:53:39,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:53:39,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:53:39,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:53:39,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:53:39,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:53:39,302 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:53:39,302 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:53:39,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:53:39,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:53:39,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:53:39,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:53:39,303 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:53:39,303 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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/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 -> 096e364e485b0e5279ae2fe39d9edab416c1da593e20bd1edd3d0a079c23fdc3 [2023-11-29 00:53:39,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:53:39,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:53:39,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:53:39,623 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:53:39,623 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:53:39,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i [2023-11-29 00:53:42,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:53:42,799 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:53:42,800 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-2.i [2023-11-29 00:53:42,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/0926f618f/755dd53df13e48f781e85e5913f4860b/FLAG8cab779dd [2023-11-29 00:53:42,836 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/data/0926f618f/755dd53df13e48f781e85e5913f4860b [2023-11-29 00:53:42,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:53:42,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:53:42,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:53:42,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:53:42,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:53:42,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:53:42" (1/1) ... [2023-11-29 00:53:42,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dcb725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:42, skipping insertion in model container [2023-11-29 00:53:42,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:53:42" (1/1) ... [2023-11-29 00:53:42,911 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:53:43,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:53:43,456 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:53:43,468 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:53:43,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:53:43,572 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:53:43,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:53:43,685 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:53:43,691 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:53:43,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43 WrapperNode [2023-11-29 00:53:43,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:53:43,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:53:43,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:53:43,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:53:43,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,799 INFO L138 Inliner]: procedures = 180, calls = 338, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1214 [2023-11-29 00:53:43,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:53:43,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:53:43,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:53:43,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:53:43,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,937 INFO L175 MemorySlicer]: Split 308 memory accesses to 4 slices as follows [2, 267, 5, 34]. 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, 58, 1, 4]. [2023-11-29 00:53:43,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:43,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:44,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:44,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:44,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:44,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:53:44,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:53:44,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:53:44,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:53:44,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (1/1) ... [2023-11-29 00:53:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:53:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:53:44,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:53:44,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:53:44,110 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 00:53:44,111 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 00:53:44,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:53:44,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:53:44,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:53:44,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:53:44,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:53:44,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:53:44,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:53:44,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:53:44,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 00:53:44,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 00:53:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 00:53:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 00:53:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 00:53:44,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 00:53:44,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 00:53:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 00:53:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 00:53:44,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 00:53:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:53:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:53:44,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:53:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:53:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:53:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:53:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:53:44,115 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:53:44,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:53:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:53:44,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:53:44,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:53:44,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:53:44,360 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:53:44,363 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:53:44,393 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:53:44,428 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:53:44,451 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:53:44,473 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:53:49,588 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:53:49,776 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:53:49,777 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 00:53:49,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:53:49 BoogieIcfgContainer [2023-11-29 00:53:49,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:53:49,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:53:49,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:53:49,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:53:49,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:53:42" (1/3) ... [2023-11-29 00:53:49,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7708679b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:53:49, skipping insertion in model container [2023-11-29 00:53:49,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:53:43" (2/3) ... [2023-11-29 00:53:49,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7708679b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:53:49, skipping insertion in model container [2023-11-29 00:53:49,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:53:49" (3/3) ... [2023-11-29 00:53:49,786 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test3-2.i [2023-11-29 00:53:49,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:53:49,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 638 error locations. [2023-11-29 00:53:49,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:53:49,880 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;@5ce1bc5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:53:49,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 638 error locations. [2023-11-29 00:53:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 00:53:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:53:49,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:53:49,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:53:49,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:53:49,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:53:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 64901, now seen corresponding path program 1 times [2023-11-29 00:53:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:53:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120857354] [2023-11-29 00:53:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:53:49,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:53:49,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:53:49,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:53:49,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:53:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:53:50,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:53:50,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:53: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 7 [2023-11-29 00:53:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:53:50,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:53:50,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:53:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120857354] [2023-11-29 00:53:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120857354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:53:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:53:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:53:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913565471] [2023-11-29 00:53:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:53:50,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:53:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:53:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:53:50,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:53:50,240 INFO L87 Difference]: Start difference. First operand has 1160 states, 511 states have (on average 2.5342465753424657) internal successors, (1295), 1153 states have internal predecessors, (1295), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:53:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:53:52,854 INFO L93 Difference]: Finished difference Result 1321 states and 1406 transitions. [2023-11-29 00:53:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:53:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:53:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:53:52,874 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 00:53:52,875 INFO L226 Difference]: Without dead ends: 1320 [2023-11-29 00:53:52,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:53:52,879 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 1078 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:53:52,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 785 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 00:53:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-11-29 00:53:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1147. [2023-11-29 00:53:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 514 states have (on average 2.3463035019455254) internal successors, (1206), 1140 states have internal predecessors, (1206), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:53:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1224 transitions. [2023-11-29 00:53:52,999 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1224 transitions. Word has length 2 [2023-11-29 00:53:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:53:53,000 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1224 transitions. [2023-11-29 00:53:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:53:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1224 transitions. [2023-11-29 00:53:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:53:53,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:53:53,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:53:53,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:53:53,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:53:53,202 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:53:53,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:53:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 64902, now seen corresponding path program 1 times [2023-11-29 00:53:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:53:53,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776972624] [2023-11-29 00:53:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:53:53,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:53:53,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:53:53,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:53:53,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:53:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:53:53,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:53:53,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:53:53,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:53:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:53:53,352 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:53:53,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:53:53,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776972624] [2023-11-29 00:53:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776972624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:53:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:53:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:53:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832749661] [2023-11-29 00:53:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:53:53,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:53:53,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:53:53,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:53:53,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:53:53,356 INFO L87 Difference]: Start difference. First operand 1147 states and 1224 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:53:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:53:57,450 INFO L93 Difference]: Finished difference Result 1705 states and 1834 transitions. [2023-11-29 00:53:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:53:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 00:53:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:53:57,460 INFO L225 Difference]: With dead ends: 1705 [2023-11-29 00:53:57,460 INFO L226 Difference]: Without dead ends: 1705 [2023-11-29 00:53:57,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:53:57,462 INFO L413 NwaCegarLoop]: 864 mSDtfsCounter, 599 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:53:57,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1454 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:53:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2023-11-29 00:53:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1316. [2023-11-29 00:53:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 684 states have (on average 2.3201754385964914) internal successors, (1587), 1309 states have internal predecessors, (1587), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:53:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1605 transitions. [2023-11-29 00:53:57,507 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1605 transitions. Word has length 2 [2023-11-29 00:53:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:53:57,507 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1605 transitions. [2023-11-29 00:53:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:53:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1605 transitions. [2023-11-29 00:53:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:53:57,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:53:57,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:53:57,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:53:57,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:53:57,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:53:57,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:53:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -191359793, now seen corresponding path program 1 times [2023-11-29 00:53:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:53:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510936496] [2023-11-29 00:53:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:53:57,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:53:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:53:57,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:53:57,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:53:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:53:57,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:53:57,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:53:57,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:53:57,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:53:57,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:53:57,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:53:57,966 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:53:57,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:53:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:53:57,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:53:57,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:53:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510936496] [2023-11-29 00:53:57,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510936496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:53:57,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:53:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:53:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826199857] [2023-11-29 00:53:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:53:57,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:53:57,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:53:57,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:53:57,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:53:57,996 INFO L87 Difference]: Start difference. First operand 1316 states and 1605 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:01,730 INFO L93 Difference]: Finished difference Result 1483 states and 1783 transitions. [2023-11-29 00:54:01,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:01,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 00:54:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:01,738 INFO L225 Difference]: With dead ends: 1483 [2023-11-29 00:54:01,738 INFO L226 Difference]: Without dead ends: 1483 [2023-11-29 00:54:01,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:01,739 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 2404 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:01,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 403 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 00:54:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2023-11-29 00:54:01,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1136. [2023-11-29 00:54:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 514 states have (on average 2.32295719844358) internal successors, (1194), 1129 states have internal predecessors, (1194), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1212 transitions. [2023-11-29 00:54:01,764 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1212 transitions. Word has length 6 [2023-11-29 00:54:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:01,765 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1212 transitions. [2023-11-29 00:54:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1212 transitions. [2023-11-29 00:54:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:54:01,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:01,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:01,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:54:01,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:01,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:01,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186277, now seen corresponding path program 1 times [2023-11-29 00:54:01,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:01,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210798664] [2023-11-29 00:54:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:01,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:01,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:01,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:54:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:02,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:54:02,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:02,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:54:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:02,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:02,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210798664] [2023-11-29 00:54:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210798664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:02,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:02,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:54:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179152465] [2023-11-29 00:54:02,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:02,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:02,150 INFO L87 Difference]: Start difference. First operand 1136 states and 1212 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:04,660 INFO L93 Difference]: Finished difference Result 1430 states and 1536 transitions. [2023-11-29 00:54:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:54:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:04,669 INFO L225 Difference]: With dead ends: 1430 [2023-11-29 00:54:04,669 INFO L226 Difference]: Without dead ends: 1430 [2023-11-29 00:54:04,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:04,671 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 895 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:04,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 1265 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 00:54:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2023-11-29 00:54:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1087. [2023-11-29 00:54:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 514 states have (on average 2.227626459143969) internal successors, (1145), 1080 states have internal predecessors, (1145), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1163 transitions. [2023-11-29 00:54:04,700 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1163 transitions. Word has length 7 [2023-11-29 00:54:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:04,700 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1163 transitions. [2023-11-29 00:54:04,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1163 transitions. [2023-11-29 00:54:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:54:04,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:04,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:04,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:54:04,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:04,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:04,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1637186276, now seen corresponding path program 1 times [2023-11-29 00:54:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334058369] [2023-11-29 00:54:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:04,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:04,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:04,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:04,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:54:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:05,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:54:05,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:05,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:54:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:05,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:05,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334058369] [2023-11-29 00:54:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334058369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:54:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402852476] [2023-11-29 00:54:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:05,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:05,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:05,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:05,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:05,059 INFO L87 Difference]: Start difference. First operand 1087 states and 1163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:08,513 INFO L93 Difference]: Finished difference Result 1500 states and 1609 transitions. [2023-11-29 00:54:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:08,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 00:54:08,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:08,521 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 00:54:08,521 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 00:54:08,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:08,522 INFO L413 NwaCegarLoop]: 1138 mSDtfsCounter, 613 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:08,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1590 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 00:54:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 00:54:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1100. [2023-11-29 00:54:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 537 states have (on average 2.2197392923649906) internal successors, (1192), 1093 states have internal predecessors, (1192), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1210 transitions. [2023-11-29 00:54:08,550 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1210 transitions. Word has length 7 [2023-11-29 00:54:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 1100 states and 1210 transitions. [2023-11-29 00:54:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1210 transitions. [2023-11-29 00:54:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 00:54:08,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:08,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:08,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:54:08,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:08,755 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:08,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:08,755 INFO L85 PathProgramCache]: Analyzing trace with hash -505370728, now seen corresponding path program 1 times [2023-11-29 00:54:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776514012] [2023-11-29 00:54:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:08,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:08,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:08,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:54:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:08,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:54:08,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:08,971 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:08,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776514012] [2023-11-29 00:54:08,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776514012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:08,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:08,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:08,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019702397] [2023-11-29 00:54:08,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:08,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:08,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:08,973 INFO L87 Difference]: Start difference. First operand 1100 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:11,342 INFO L93 Difference]: Finished difference Result 1689 states and 1843 transitions. [2023-11-29 00:54:11,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:54:11,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 00:54:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:11,350 INFO L225 Difference]: With dead ends: 1689 [2023-11-29 00:54:11,350 INFO L226 Difference]: Without dead ends: 1689 [2023-11-29 00:54:11,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:11,351 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 689 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:11,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 2996 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:54:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2023-11-29 00:54:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1304. [2023-11-29 00:54:11,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 741 states have (on average 2.174089068825911) internal successors, (1611), 1297 states have internal predecessors, (1611), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1629 transitions. [2023-11-29 00:54:11,385 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1629 transitions. Word has length 10 [2023-11-29 00:54:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:11,386 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 1629 transitions. [2023-11-29 00:54:11,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1629 transitions. [2023-11-29 00:54:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 00:54:11,387 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:11,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:11,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:54:11,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:11,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:11,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -915022471, now seen corresponding path program 1 times [2023-11-29 00:54:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90775451] [2023-11-29 00:54:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:11,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:11,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:54:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:11,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:54:11,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:11,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:11,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:11,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90775451] [2023-11-29 00:54:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90775451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518833637] [2023-11-29 00:54:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:11,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:11,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:11,716 INFO L87 Difference]: Start difference. First operand 1304 states and 1629 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:12,600 INFO L93 Difference]: Finished difference Result 1250 states and 1549 transitions. [2023-11-29 00:54:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 00:54:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:12,607 INFO L225 Difference]: With dead ends: 1250 [2023-11-29 00:54:12,607 INFO L226 Difference]: Without dead ends: 1250 [2023-11-29 00:54:12,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:12,608 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 70 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:12,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1897 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:54:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-11-29 00:54:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2023-11-29 00:54:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 711 states have (on average 2.1533052039381153) internal successors, (1531), 1243 states have internal predecessors, (1531), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1549 transitions. [2023-11-29 00:54:12,629 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1549 transitions. Word has length 12 [2023-11-29 00:54:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:12,629 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1549 transitions. [2023-11-29 00:54:12,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1549 transitions. [2023-11-29 00:54:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 00:54:12,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:12,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:12,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:54:12,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:12,831 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:12,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1131726450, now seen corresponding path program 1 times [2023-11-29 00:54:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375462464] [2023-11-29 00:54:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:12,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:12,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:12,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:12,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:54:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:12,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:54:12,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:12,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:12,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375462464] [2023-11-29 00:54:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375462464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678834648] [2023-11-29 00:54:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:12,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:12,974 INFO L87 Difference]: Start difference. First operand 1250 states and 1549 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:14,140 INFO L93 Difference]: Finished difference Result 1236 states and 1507 transitions. [2023-11-29 00:54:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 00:54:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:14,147 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 00:54:14,147 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 00:54:14,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:14,147 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 58 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:14,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2802 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:54:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 00:54:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1234. [2023-11-29 00:54:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 709 states have (on average 2.0973201692524683) internal successors, (1487), 1227 states have internal predecessors, (1487), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1505 transitions. [2023-11-29 00:54:14,174 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1505 transitions. Word has length 14 [2023-11-29 00:54:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:14,174 INFO L495 AbstractCegarLoop]: Abstraction has 1234 states and 1505 transitions. [2023-11-29 00:54:14,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1505 transitions. [2023-11-29 00:54:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:54:14,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:14,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:14,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:54:14,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:14,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr636ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:14,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1857646529, now seen corresponding path program 1 times [2023-11-29 00:54:14,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:14,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585116588] [2023-11-29 00:54:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:14,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 00:54:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:14,378 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:14,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:54:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:14,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:54:14,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:14,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:54:14,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:54:14,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:54:14,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 00:54:14,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:54:14,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 00:54:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:14,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:14,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:14,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585116588] [2023-11-29 00:54:14,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585116588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:14,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:14,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:14,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544416924] [2023-11-29 00:54:14,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:14,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:14,625 INFO L87 Difference]: Start difference. First operand 1234 states and 1505 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:16,935 INFO L93 Difference]: Finished difference Result 2201 states and 2578 transitions. [2023-11-29 00:54:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:54:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:16,947 INFO L225 Difference]: With dead ends: 2201 [2023-11-29 00:54:16,947 INFO L226 Difference]: Without dead ends: 2201 [2023-11-29 00:54:16,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:16,948 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 1007 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:16,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3214 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 00:54:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2023-11-29 00:54:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1233. [2023-11-29 00:54:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 708 states have (on average 2.097457627118644) internal successors, (1485), 1226 states have internal predecessors, (1485), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1503 transitions. [2023-11-29 00:54:16,980 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1503 transitions. Word has length 15 [2023-11-29 00:54:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:16,980 INFO L495 AbstractCegarLoop]: Abstraction has 1233 states and 1503 transitions. [2023-11-29 00:54:16,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1503 transitions. [2023-11-29 00:54:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:54:16,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:16,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:16,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 00:54:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:17,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:17,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -72847630, now seen corresponding path program 1 times [2023-11-29 00:54:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524862176] [2023-11-29 00:54:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:17,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:17,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:17,185 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:17,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:54:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:17,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:54:17,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:17,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:17,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:17,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524862176] [2023-11-29 00:54:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524862176] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:17,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815541848] [2023-11-29 00:54:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:54:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:54:17,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:17,362 INFO L87 Difference]: Start difference. First operand 1233 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:18,272 INFO L93 Difference]: Finished difference Result 1179 states and 1423 transitions. [2023-11-29 00:54:18,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:54:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 00:54:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:18,279 INFO L225 Difference]: With dead ends: 1179 [2023-11-29 00:54:18,279 INFO L226 Difference]: Without dead ends: 1179 [2023-11-29 00:54:18,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:54:18,280 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 70 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:18,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1781 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:54:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2023-11-29 00:54:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2023-11-29 00:54:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 678 states have (on average 2.0722713864306783) internal successors, (1405), 1172 states have internal predecessors, (1405), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1423 transitions. [2023-11-29 00:54:18,298 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1423 transitions. Word has length 15 [2023-11-29 00:54:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:18,299 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1423 transitions. [2023-11-29 00:54:18,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1423 transitions. [2023-11-29 00:54:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:54:18,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:18,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:18,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 00:54:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:18,504 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:18,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1287098164, now seen corresponding path program 1 times [2023-11-29 00:54:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49238765] [2023-11-29 00:54:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:18,510 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:18,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:54:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:18,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:54:18,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:18,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:18,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:18,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49238765] [2023-11-29 00:54:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49238765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607243525] [2023-11-29 00:54:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:18,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:18,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:18,699 INFO L87 Difference]: Start difference. First operand 1179 states and 1423 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:19,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:19,805 INFO L93 Difference]: Finished difference Result 1165 states and 1381 transitions. [2023-11-29 00:54:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:19,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 00:54:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:19,812 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 00:54:19,812 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 00:54:19,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:19,812 INFO L413 NwaCegarLoop]: 884 mSDtfsCounter, 58 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:19,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2628 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 00:54:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 00:54:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1163. [2023-11-29 00:54:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 676 states have (on average 2.0133136094674557) internal successors, (1361), 1156 states have internal predecessors, (1361), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1379 transitions. [2023-11-29 00:54:19,836 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1379 transitions. Word has length 17 [2023-11-29 00:54:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:19,837 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1379 transitions. [2023-11-29 00:54:19,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1379 transitions. [2023-11-29 00:54:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:54:19,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:19,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:19,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-29 00:54:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:20,039 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:20,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 25746362, now seen corresponding path program 1 times [2023-11-29 00:54:20,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957120111] [2023-11-29 00:54:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:20,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:20,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:20,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:20,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:54:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:20,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:54:20,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:20,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:54:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:20,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:20,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957120111] [2023-11-29 00:54:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957120111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:20,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:20,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431237311] [2023-11-29 00:54:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:20,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:20,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:20,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:20,281 INFO L87 Difference]: Start difference. First operand 1163 states and 1379 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:23,184 INFO L93 Difference]: Finished difference Result 1511 states and 1841 transitions. [2023-11-29 00:54:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:54:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:23,191 INFO L225 Difference]: With dead ends: 1511 [2023-11-29 00:54:23,191 INFO L226 Difference]: Without dead ends: 1511 [2023-11-29 00:54:23,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:23,192 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 760 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:23,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1267 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 00:54:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2023-11-29 00:54:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1159. [2023-11-29 00:54:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 676 states have (on average 2.0014792899408285) internal successors, (1353), 1152 states have internal predecessors, (1353), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1371 transitions. [2023-11-29 00:54:23,208 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1371 transitions. Word has length 31 [2023-11-29 00:54:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:23,208 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1371 transitions. [2023-11-29 00:54:23,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1371 transitions. [2023-11-29 00:54:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:54:23,209 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:23,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:23,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 00:54:23,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:23,410 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:23,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 25746363, now seen corresponding path program 1 times [2023-11-29 00:54:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904225510] [2023-11-29 00:54:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:23,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:23,412 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:23,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:54:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:23,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:54:23,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:23,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:54:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:23,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:23,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:23,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904225510] [2023-11-29 00:54:23,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904225510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:23,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096998352] [2023-11-29 00:54:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:23,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:23,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:23,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:23,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:23,804 INFO L87 Difference]: Start difference. First operand 1159 states and 1371 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:27,929 INFO L93 Difference]: Finished difference Result 1613 states and 1922 transitions. [2023-11-29 00:54:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:27,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 00:54:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:27,938 INFO L225 Difference]: With dead ends: 1613 [2023-11-29 00:54:27,938 INFO L226 Difference]: Without dead ends: 1613 [2023-11-29 00:54:27,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:27,939 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 480 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:27,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2159 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 00:54:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2023-11-29 00:54:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1155. [2023-11-29 00:54:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 676 states have (on average 1.9896449704142012) internal successors, (1345), 1148 states have internal predecessors, (1345), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1363 transitions. [2023-11-29 00:54:27,955 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1363 transitions. Word has length 31 [2023-11-29 00:54:27,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:27,955 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1363 transitions. [2023-11-29 00:54:27,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1363 transitions. [2023-11-29 00:54:27,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 00:54:27,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:27,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:27,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 00:54:28,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:28,158 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:28,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1619588407, now seen corresponding path program 1 times [2023-11-29 00:54:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:28,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231585702] [2023-11-29 00:54:28,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:28,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:28,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:28,160 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:28,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:54:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:28,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:54:28,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:28,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:28,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:28,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231585702] [2023-11-29 00:54:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231585702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202692927] [2023-11-29 00:54:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:28,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:28,406 INFO L87 Difference]: Start difference. First operand 1155 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:29,483 INFO L93 Difference]: Finished difference Result 1143 states and 1343 transitions. [2023-11-29 00:54:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 00:54:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:29,489 INFO L225 Difference]: With dead ends: 1143 [2023-11-29 00:54:29,489 INFO L226 Difference]: Without dead ends: 1143 [2023-11-29 00:54:29,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:29,490 INFO L413 NwaCegarLoop]: 878 mSDtfsCounter, 23 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:29,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2614 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:54:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-29 00:54:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2023-11-29 00:54:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 664 states have (on average 1.9954819277108433) internal successors, (1325), 1136 states have internal predecessors, (1325), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1343 transitions. [2023-11-29 00:54:29,505 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1343 transitions. Word has length 50 [2023-11-29 00:54:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:29,506 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1343 transitions. [2023-11-29 00:54:29,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1343 transitions. [2023-11-29 00:54:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 00:54:29,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:29,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:29,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 00:54:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:29,708 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -597599178, now seen corresponding path program 1 times [2023-11-29 00:54:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459106078] [2023-11-29 00:54:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:29,710 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:29,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:54:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:30,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:54:30,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:30,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:54:30,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:54:30,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:54:30,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 00:54:30,624 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:54:30,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:54:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:30,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:30,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459106078] [2023-11-29 00:54:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459106078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:54:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522395043] [2023-11-29 00:54:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:30,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:30,642 INFO L87 Difference]: Start difference. First operand 1143 states and 1343 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:33,899 INFO L93 Difference]: Finished difference Result 1457 states and 1775 transitions. [2023-11-29 00:54:33,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:33,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 00:54:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:33,906 INFO L225 Difference]: With dead ends: 1457 [2023-11-29 00:54:33,907 INFO L226 Difference]: Without dead ends: 1457 [2023-11-29 00:54:33,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:33,907 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 968 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:33,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 704 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:54:33,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-11-29 00:54:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1082. [2023-11-29 00:54:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1248 transitions. [2023-11-29 00:54:33,925 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1248 transitions. Word has length 54 [2023-11-29 00:54:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:33,925 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1248 transitions. [2023-11-29 00:54:33,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1248 transitions. [2023-11-29 00:54:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:54:33,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:33,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:33,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 00:54:34,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:34,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:34,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:34,128 INFO L85 PathProgramCache]: Analyzing trace with hash 940938836, now seen corresponding path program 1 times [2023-11-29 00:54:34,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:34,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649950047] [2023-11-29 00:54:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:34,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:34,129 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:34,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:54:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:34,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:54:34,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:34,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:54:34,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:54:34,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 00:54:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:34,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:34,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649950047] [2023-11-29 00:54:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649950047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899391941] [2023-11-29 00:54:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:34,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:54:34,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:54:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:34,473 INFO L87 Difference]: Start difference. First operand 1082 states and 1248 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:37,705 INFO L93 Difference]: Finished difference Result 1081 states and 1247 transitions. [2023-11-29 00:54:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:54:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 00:54:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:37,711 INFO L225 Difference]: With dead ends: 1081 [2023-11-29 00:54:37,712 INFO L226 Difference]: Without dead ends: 1081 [2023-11-29 00:54:37,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:54:37,712 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 3 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:37,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2221 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:54:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-11-29 00:54:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2023-11-29 00:54:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 641 states have (on average 1.9173166926677068) internal successors, (1229), 1074 states have internal predecessors, (1229), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1247 transitions. [2023-11-29 00:54:37,726 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1247 transitions. Word has length 58 [2023-11-29 00:54:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:37,726 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1247 transitions. [2023-11-29 00:54:37,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1247 transitions. [2023-11-29 00:54:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:54:37,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:37,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:37,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 00:54:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:37,928 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:37,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 940938837, now seen corresponding path program 1 times [2023-11-29 00:54:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033658487] [2023-11-29 00:54:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:37,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:37,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 00:54:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:38,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:54:38,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:38,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:54:38,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:54:38,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:54:38,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 00:54:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:38,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:38,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033658487] [2023-11-29 00:54:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033658487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:38,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:38,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082765743] [2023-11-29 00:54:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:38,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:54:38,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:38,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:54:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:38,319 INFO L87 Difference]: Start difference. First operand 1081 states and 1247 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:42,356 INFO L93 Difference]: Finished difference Result 1080 states and 1246 transitions. [2023-11-29 00:54:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:54:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 00:54:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:42,362 INFO L225 Difference]: With dead ends: 1080 [2023-11-29 00:54:42,362 INFO L226 Difference]: Without dead ends: 1080 [2023-11-29 00:54:42,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:54:42,363 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:42,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2272 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:54:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2023-11-29 00:54:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1080. [2023-11-29 00:54:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 640 states have (on average 1.91875) internal successors, (1228), 1073 states have internal predecessors, (1228), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 00:54:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1246 transitions. [2023-11-29 00:54:42,376 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1246 transitions. Word has length 58 [2023-11-29 00:54:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:42,376 INFO L495 AbstractCegarLoop]: Abstraction has 1080 states and 1246 transitions. [2023-11-29 00:54:42,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:54:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1246 transitions. [2023-11-29 00:54:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:54:42,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:42,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:42,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 00:54:42,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:42,578 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:42,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:42,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1104579896, now seen corresponding path program 1 times [2023-11-29 00:54:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917017155] [2023-11-29 00:54:42,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:42,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:42,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:42,580 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:42,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 00:54:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:42,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:54:42,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:42,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:54:42,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917017155] [2023-11-29 00:54:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917017155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:54:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:54:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:54:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713966625] [2023-11-29 00:54:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:54:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:54:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:54:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:54:42,908 INFO L87 Difference]: Start difference. First operand 1080 states and 1246 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:54:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:43,948 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2023-11-29 00:54:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:54:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-29 00:54:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:43,957 INFO L225 Difference]: With dead ends: 1082 [2023-11-29 00:54:43,957 INFO L226 Difference]: Without dead ends: 1082 [2023-11-29 00:54:43,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:54:43,958 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:43,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2553 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 00:54:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2023-11-29 00:54:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1082. [2023-11-29 00:54:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 641 states have (on average 1.9188767550702028) internal successors, (1230), 1075 states have internal predecessors, (1230), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:54:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1249 transitions. [2023-11-29 00:54:43,988 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1249 transitions. Word has length 64 [2023-11-29 00:54:43,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:43,988 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1249 transitions. [2023-11-29 00:54:43,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 00:54:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1249 transitions. [2023-11-29 00:54:43,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:54:43,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:43,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:43,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-29 00:54:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:44,189 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:44,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1704596296, now seen corresponding path program 1 times [2023-11-29 00:54:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028573309] [2023-11-29 00:54:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:54:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:44,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:44,191 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:44,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 00:54:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:54:44,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:54:44,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:44,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:44,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:44,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028573309] [2023-11-29 00:54:44,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028573309] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:44,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:44,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:54:44,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247841091] [2023-11-29 00:54:44,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:44,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:54:44,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:54:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:54:44,569 INFO L87 Difference]: Start difference. First operand 1082 states and 1249 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:46,011 INFO L93 Difference]: Finished difference Result 1091 states and 1263 transitions. [2023-11-29 00:54:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:54:46,012 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 00:54:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:46,017 INFO L225 Difference]: With dead ends: 1091 [2023-11-29 00:54:46,017 INFO L226 Difference]: Without dead ends: 1091 [2023-11-29 00:54:46,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:54:46,018 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 6 mSDsluCounter, 2548 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:46,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3399 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 00:54:46,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2023-11-29 00:54:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1090. [2023-11-29 00:54:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 648 states have (on average 1.9182098765432098) internal successors, (1243), 1082 states have internal predecessors, (1243), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:54:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1262 transitions. [2023-11-29 00:54:46,041 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1262 transitions. Word has length 65 [2023-11-29 00:54:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:46,041 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1262 transitions. [2023-11-29 00:54:46,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1262 transitions. [2023-11-29 00:54:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:54:46,042 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:46,042 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:46,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:54:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:46,243 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:46,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -644902600, now seen corresponding path program 2 times [2023-11-29 00:54:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:46,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039010848] [2023-11-29 00:54:46,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:54:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:46,246 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:46,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 00:54:46,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:54:46,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:54:46,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:54:46,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:46,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:46,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:46,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039010848] [2023-11-29 00:54:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039010848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:46,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:46,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 00:54:46,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157105394] [2023-11-29 00:54:46,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:46,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:54:46,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:46,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:54:46,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:54:46,948 INFO L87 Difference]: Start difference. First operand 1090 states and 1262 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:49,611 INFO L93 Difference]: Finished difference Result 1105 states and 1284 transitions. [2023-11-29 00:54:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:54:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 00:54:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:49,617 INFO L225 Difference]: With dead ends: 1105 [2023-11-29 00:54:49,617 INFO L226 Difference]: Without dead ends: 1103 [2023-11-29 00:54:49,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:54:49,618 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 12 mSDsluCounter, 5099 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5950 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:49,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5950 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:54:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-11-29 00:54:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1099. [2023-11-29 00:54:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 657 states have (on average 1.9101978691019788) internal successors, (1255), 1091 states have internal predecessors, (1255), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:54:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1274 transitions. [2023-11-29 00:54:49,638 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1274 transitions. Word has length 68 [2023-11-29 00:54:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:49,638 INFO L495 AbstractCegarLoop]: Abstraction has 1099 states and 1274 transitions. [2023-11-29 00:54:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1274 transitions. [2023-11-29 00:54:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:54:49,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:49,639 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:49,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 00:54:49,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:49,839 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:49,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 162879288, now seen corresponding path program 3 times [2023-11-29 00:54:49,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:49,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633128980] [2023-11-29 00:54:49,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:54:49,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:49,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:49,841 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:49,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 00:54:50,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:54:50,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:54:50,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:54:50,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:50,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:51,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:51,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633128980] [2023-11-29 00:54:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633128980] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:51,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:51,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 00:54:51,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202310318] [2023-11-29 00:54:51,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:51,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:54:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:54:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:54:51,305 INFO L87 Difference]: Start difference. First operand 1099 states and 1274 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:54:57,314 INFO L93 Difference]: Finished difference Result 1129 states and 1324 transitions. [2023-11-29 00:54:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:54:57,315 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 00:54:57,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:54:57,318 INFO L225 Difference]: With dead ends: 1129 [2023-11-29 00:54:57,319 INFO L226 Difference]: Without dead ends: 1126 [2023-11-29 00:54:57,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 00:54:57,320 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 24 mSDsluCounter, 9337 mSDsCounter, 0 mSdLazyCounter, 1912 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10187 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:54:57,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10187 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1912 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 00:54:57,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2023-11-29 00:54:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1117. [2023-11-29 00:54:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 675 states have (on average 1.8933333333333333) internal successors, (1278), 1109 states have internal predecessors, (1278), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:54:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1297 transitions. [2023-11-29 00:54:57,338 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1297 transitions. Word has length 74 [2023-11-29 00:54:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:54:57,338 INFO L495 AbstractCegarLoop]: Abstraction has 1117 states and 1297 transitions. [2023-11-29 00:54:57,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:54:57,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1297 transitions. [2023-11-29 00:54:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:54:57,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:54:57,339 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:54:57,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 00:54:57,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:57,540 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:54:57,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:54:57,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1402692408, now seen corresponding path program 4 times [2023-11-29 00:54:57,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:54:57,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390468754] [2023-11-29 00:54:57,541 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:54:57,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:54:57,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:54:57,542 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:54:57,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 00:54:57,919 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:54:57,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:54:57,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:54:57,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:54:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:58,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:54:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:54:59,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:54:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390468754] [2023-11-29 00:54:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390468754] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:54:59,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:54:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:54:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167403695] [2023-11-29 00:54:59,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:54:59,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:54:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:54:59,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:54:59,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:54:59,840 INFO L87 Difference]: Start difference. First operand 1117 states and 1297 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:55:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:55:16,078 INFO L93 Difference]: Finished difference Result 1174 states and 1386 transitions. [2023-11-29 00:55:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:55:16,079 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 00:55:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:55:16,083 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 00:55:16,083 INFO L226 Difference]: Without dead ends: 1172 [2023-11-29 00:55:16,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 00:55:16,088 INFO L413 NwaCegarLoop]: 851 mSDtfsCounter, 47 mSDsluCounter, 23794 mSDsCounter, 0 mSdLazyCounter, 5452 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24645 SdHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:55:16,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24645 Invalid, 5496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 5452 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-29 00:55:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-29 00:55:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1151. [2023-11-29 00:55:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 709 states have (on average 1.8674188998589563) internal successors, (1324), 1143 states have internal predecessors, (1324), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:55:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1343 transitions. [2023-11-29 00:55:16,108 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1343 transitions. Word has length 86 [2023-11-29 00:55:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:55:16,108 INFO L495 AbstractCegarLoop]: Abstraction has 1151 states and 1343 transitions. [2023-11-29 00:55:16,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:55:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1343 transitions. [2023-11-29 00:55:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:55:16,109 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:55:16,109 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:55:16,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:55:16,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:55:16,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:55:16,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:55:16,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1887156536, now seen corresponding path program 5 times [2023-11-29 00:55:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:55:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780326432] [2023-11-29 00:55:16,311 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:55:16,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:55:16,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:55:16,312 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:55:16,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:55:17,603 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:55:17,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:55:17,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 00:55:17,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:55:17,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:55:17,757 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:55:17,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:55:17,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:55:17,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:55:18,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:55:18,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:55:19,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:55:19,106 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:55:19,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:55:19,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2022 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.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)))) is different from false [2023-11-29 00:55:19,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:55:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780326432] [2023-11-29 00:55:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780326432] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:55:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121217852] [2023-11-29 00:55:19,507 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:55:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:55:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:55:19,509 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:55:19,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 00:56:23,163 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:56:23,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:56:23,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 00:56:23,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:23,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:56:23,642 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:56:23,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:56:23,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:56:23,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:56:24,677 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:56:24,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:56:24,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:56:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:56:24,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:25,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2485) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:56:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2121217852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:25,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:56:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:56:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720094287] [2023-11-29 00:56:25,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:56:25,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:56:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:56:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:56:25,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:56:25,157 INFO L87 Difference]: Start difference. First operand 1151 states and 1343 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:56:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:56:33,487 INFO L93 Difference]: Finished difference Result 1504 states and 1812 transitions. [2023-11-29 00:56:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:56:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 00:56:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:56:33,490 INFO L225 Difference]: With dead ends: 1504 [2023-11-29 00:56:33,491 INFO L226 Difference]: Without dead ends: 1502 [2023-11-29 00:56:33,491 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 00:56:33,491 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 652 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 4059 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 4066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:56:33,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 3751 Invalid, 4066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4059 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 00:56:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2023-11-29 00:56:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1150. [2023-11-29 00:56:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 709 states have (on average 1.8603667136812412) internal successors, (1319), 1142 states have internal predecessors, (1319), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:56:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1338 transitions. [2023-11-29 00:56:33,506 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1338 transitions. Word has length 108 [2023-11-29 00:56:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:56:33,506 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1338 transitions. [2023-11-29 00:56:33,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:56:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1338 transitions. [2023-11-29 00:56:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:56:33,507 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:56:33,507 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:56:33,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 00:56:33,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-29 00:56:33,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:56:33,908 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:56:33,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:56:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1887156537, now seen corresponding path program 1 times [2023-11-29 00:56:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:56:33,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455869588] [2023-11-29 00:56:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:33,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:56:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:56:33,910 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:56:33,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:56:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:56:34,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 00:56:34,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:56:34,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:56:34,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:56:34,705 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:56:34,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:56:34,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:56:34,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:56:34,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:56:34,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:56:35,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:56:35,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:56:35,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:56:35,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:56:35,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:56:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:56:35,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:56:36,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (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$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3037) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 00:56:36,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:56:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455869588] [2023-11-29 00:56:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455869588] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:56:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1386078959] [2023-11-29 00:56:36,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:56:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:56:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:56:36,869 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:56:36,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 00:58:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:26,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 00:58:26,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:26,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:26,635 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:58:26,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:58:26,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:58:26,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:58:26,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:58:26,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:58:26,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:58:27,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:27,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:58:27,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:58:27,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:58:27,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:58:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:58:27,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:29,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3590) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3591) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 00:58:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1386078959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:29,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:58:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658629218] [2023-11-29 00:58:29,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:29,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:58:29,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:58:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:58:29,035 INFO L87 Difference]: Start difference. First operand 1150 states and 1338 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:58:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:58:38,881 INFO L93 Difference]: Finished difference Result 1501 states and 1807 transitions. [2023-11-29 00:58:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:58:38,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 00:58:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:58:38,885 INFO L225 Difference]: With dead ends: 1501 [2023-11-29 00:58:38,885 INFO L226 Difference]: Without dead ends: 1501 [2023-11-29 00:58:38,885 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 00:58:38,886 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 654 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 4923 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 2978 SdHoareTripleChecker+Invalid, 4933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:58:38,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 2978 Invalid, 4933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4923 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 00:58:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2023-11-29 00:58:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1149. [2023-11-29 00:58:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 709 states have (on average 1.8589562764456982) internal successors, (1318), 1141 states have internal predecessors, (1318), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:58:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1337 transitions. [2023-11-29 00:58:38,904 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1337 transitions. Word has length 108 [2023-11-29 00:58:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:58:38,904 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1337 transitions. [2023-11-29 00:58:38,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:58:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1337 transitions. [2023-11-29 00:58:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:58:38,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:58:38,906 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:58:38,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 00:58:39,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:58:39,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:39,307 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:58:39,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:58:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1082904316, now seen corresponding path program 1 times [2023-11-29 00:58:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:58:39,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146733039] [2023-11-29 00:58:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:39,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:58:39,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:58:39,309 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:58:39,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:58:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:40,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 00:58:40,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:40,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:40,184 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:58:40,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:58:40,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:58:40,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:58:41,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:41,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:58:41,196 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:58:41,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:58:41,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:58:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:58:41,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:45,353 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4014 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:58:45,752 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4060 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4014 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4060))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4014)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:58:45,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:58:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146733039] [2023-11-29 00:58:45,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146733039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [116657014] [2023-11-29 00:58:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:58:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:58:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:58:45,756 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:58:45,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 00:58:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:58:50,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 00:58:50,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:58:50,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:58:50,382 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:58:50,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:58:50,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:58:50,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:58:51,519 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:51,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:58:51,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:58:51,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:58:51,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:58:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:58:51,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:58:51,713 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4484) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 00:58:51,724 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 00:58:52,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~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)))))) is different from false [2023-11-29 00:58:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [116657014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:58:52,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:58:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:58:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493969884] [2023-11-29 00:58:52,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:58:52,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:58:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:58:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:58:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 00:58:52,124 INFO L87 Difference]: Start difference. First operand 1149 states and 1337 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:02,440 INFO L93 Difference]: Finished difference Result 1500 states and 1806 transitions. [2023-11-29 00:59:02,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:59:02,440 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 00:59:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:02,443 INFO L225 Difference]: With dead ends: 1500 [2023-11-29 00:59:02,443 INFO L226 Difference]: Without dead ends: 1500 [2023-11-29 00:59:02,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 00:59:02,444 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 647 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 4174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 4180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:02,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 3754 Invalid, 4180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4174 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 00:59:02,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2023-11-29 00:59:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1148. [2023-11-29 00:59:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 709 states have (on average 1.8575458392101551) internal successors, (1317), 1140 states have internal predecessors, (1317), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:59:02,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1336 transitions. [2023-11-29 00:59:02,458 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1336 transitions. Word has length 110 [2023-11-29 00:59:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:02,458 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1336 transitions. [2023-11-29 00:59:02,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:02,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1336 transitions. [2023-11-29 00:59:02,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:59:02,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:02,459 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:02,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:59:02,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 00:59:02,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:02,860 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:59:02,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1082904317, now seen corresponding path program 1 times [2023-11-29 00:59:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595045503] [2023-11-29 00:59:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:02,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:59:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:02,862 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:59:02,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:59:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:03,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 00:59:03,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:03,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:03,795 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:59:03,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:59:03,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:59:03,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 00:59:03,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:59:03,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 00:59:03,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:59:04,762 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:04,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:59:04,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:59:04,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:04,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 00:59:04,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:59:04,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 00:59:04,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 00:59:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:04,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:05,113 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_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4998) |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$#1.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 00:59:05,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4999) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 00:59:06,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5091) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5090) |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_5090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4999 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4998 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5090))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~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_4998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:59:06,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:59:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595045503] [2023-11-29 00:59:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595045503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773375704] [2023-11-29 00:59:06,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:59:06,511 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:59:06,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 00:59:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:10,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 00:59:10,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:10,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:10,684 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:59:10,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 00:59:10,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:59:10,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:59:10,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 00:59:10,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 00:59:10,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:59:11,696 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:11,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:59:11,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:59:11,892 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:11,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:59:11,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:59:11,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:59:11,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 00:59:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:11,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:11,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:59:12,028 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 00:59:13,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5560 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5651 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5652))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5651) .cse0 v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5560) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5559 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5651 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5651) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5652) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5559) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 00:59:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [773375704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:13,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:59:13,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:59:13,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749437812] [2023-11-29 00:59:13,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:13,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:59:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:13,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:59:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 00:59:13,353 INFO L87 Difference]: Start difference. First operand 1148 states and 1336 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:23,969 INFO L93 Difference]: Finished difference Result 1499 states and 1805 transitions. [2023-11-29 00:59:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:59:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 00:59:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:23,972 INFO L225 Difference]: With dead ends: 1499 [2023-11-29 00:59:23,972 INFO L226 Difference]: Without dead ends: 1499 [2023-11-29 00:59:23,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 00:59:23,973 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 656 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 4279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 4290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:23,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 2678 Invalid, 4290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4279 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 00:59:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2023-11-29 00:59:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1147. [2023-11-29 00:59:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 709 states have (on average 1.8561354019746121) internal successors, (1316), 1139 states have internal predecessors, (1316), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:59:23,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1335 transitions. [2023-11-29 00:59:23,988 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1335 transitions. Word has length 110 [2023-11-29 00:59:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:23,989 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1335 transitions. [2023-11-29 00:59:23,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1335 transitions. [2023-11-29 00:59:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:59:23,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:23,990 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:24,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:59:24,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 00:59:24,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:24,391 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 00:59:24,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:59:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1290629595, now seen corresponding path program 1 times [2023-11-29 00:59:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:59:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799382190] [2023-11-29 00:59:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:24,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:59:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:59:24,393 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:59:24,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:59:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:25,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 00:59:25,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:25,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:25,493 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:59:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:59:25,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:59:25,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:59:26,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:26,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:59:26,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:26,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:59:26,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:59:26,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 00:59:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 00:59:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:27,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:27,120 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6091) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:59:27,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6091) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:59:27,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:59:27,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6090))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:27,531 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6090)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6091)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:27,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:59:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799382190] [2023-11-29 00:59:27,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799382190] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:27,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481514467] [2023-11-29 00:59:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:59:27,536 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:59:27,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:59:27,537 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:59:27,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 00:59:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:59:44,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 00:59:44,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:59:44,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:59:45,062 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:59:45,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 00:59:45,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 00:59:45,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:59:46,345 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:46,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:59:46,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:46,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:59:46,654 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:59:46,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:59:46,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:59:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:59:46,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:59:50,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:59:50,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6576))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6577)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:59:51,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6623))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6576)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6577)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:59:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1481514467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:59:51,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:59:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:59:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067103020] [2023-11-29 00:59:51,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:59:51,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:59:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:59:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:59:51,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=335, Unknown=12, NotChecked=360, Total=812 [2023-11-29 00:59:51,380 INFO L87 Difference]: Start difference. First operand 1147 states and 1335 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:59:59,712 INFO L93 Difference]: Finished difference Result 1498 states and 1804 transitions. [2023-11-29 00:59:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:59:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 00:59:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:59:59,716 INFO L225 Difference]: With dead ends: 1498 [2023-11-29 00:59:59,716 INFO L226 Difference]: Without dead ends: 1498 [2023-11-29 00:59:59,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=115, Invalid=367, Unknown=12, NotChecked=376, Total=870 [2023-11-29 00:59:59,717 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 643 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 3131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 2878 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:59:59,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 2878 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3131 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 00:59:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2023-11-29 00:59:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1146. [2023-11-29 00:59:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 709 states have (on average 1.8547249647390691) internal successors, (1315), 1138 states have internal predecessors, (1315), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 00:59:59,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1334 transitions. [2023-11-29 00:59:59,736 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1334 transitions. Word has length 112 [2023-11-29 00:59:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:59:59,737 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1334 transitions. [2023-11-29 00:59:59,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:59:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1334 transitions. [2023-11-29 00:59:59,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:59:59,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:59:59,738 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:59:59,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 00:59:59,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00:00,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:00:00,138 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 01:00:00,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1290629596, now seen corresponding path program 1 times [2023-11-29 01:00:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:00:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518245640] [2023-11-29 01:00:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:00,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:00:00,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:00:00,140 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:00:00,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:01,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 01:00:01,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:01,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:00:01,247 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:00:01,265 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:00:01,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:00:01,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:00:01,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:00:01,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:00:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:00:02,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:02,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:02,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:02,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:02,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:02,485 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:00:02,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:00:02,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:00:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:00:02,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:00:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:00:02,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:02,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7109) |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:00:02,781 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:00:02,963 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7107) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7106))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7107) .cse2 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:00:03,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7107) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7106))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7107) .cse3 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:00:05,362 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7200))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7201) .cse1 v_ArrVal_7107) (select (select (store .cse2 .cse1 v_ArrVal_7106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7109))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7108 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7106 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7107 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7200 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7201 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7200))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7106))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7201) .cse4 v_ArrVal_7107) .cse5 v_ArrVal_7109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7108) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:00:05,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:00:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518245640] [2023-11-29 01:00:05,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518245640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:00:05,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072795933] [2023-11-29 01:00:05,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:00:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:00:05,381 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:00:05,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:00:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:21,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 01:00:21,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:21,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:00:22,275 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:00:22,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:00:22,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:00:22,395 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:00:22,406 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:00:22,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:00:22,708 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:00:23,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:00:23,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:00:23,845 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:00:24,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:00:24,146 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:00:24,153 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:00:24,336 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:00:24,337 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:00:24,351 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:00:24,379 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:00:24,392 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:00:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:00:24,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:00:24,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:00:24,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:00:24,598 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7685))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7684) .cse0 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7684) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 01:00:24,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7685))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7684) .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7684) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7686) |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:00:27,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7778))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7685))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7779) .cse0 v_ArrVal_7684) .cse1 v_ArrVal_7686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7687) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7779 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7778))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7779) .cse6 v_ArrVal_7684) (select (select (store .cse7 .cse6 v_ArrVal_7685) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7686))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 01:00:27,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1072795933] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:00:27,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:00:27,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:00:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545654860] [2023-11-29 01:00:27,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:00:27,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:00:27,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:00:27,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:00:27,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 01:00:27,328 INFO L87 Difference]: Start difference. First operand 1146 states and 1334 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:00:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:00:56,810 INFO L93 Difference]: Finished difference Result 1497 states and 1803 transitions. [2023-11-29 01:00:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:00:56,811 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:00:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:00:56,813 INFO L225 Difference]: With dead ends: 1497 [2023-11-29 01:00:56,813 INFO L226 Difference]: Without dead ends: 1497 [2023-11-29 01:00:56,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 01:00:56,814 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 647 mSDsluCounter, 3938 mSDsCounter, 0 mSdLazyCounter, 8171 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 4501 SdHoareTripleChecker+Invalid, 8179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 8171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:00:56,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 4501 Invalid, 8179 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 8171 Invalid, 0 Unknown, 0 Unchecked, 28.9s Time] [2023-11-29 01:00:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2023-11-29 01:00:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1145. [2023-11-29 01:00:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 709 states have (on average 1.853314527503526) internal successors, (1314), 1137 states have internal predecessors, (1314), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 01:00:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1333 transitions. [2023-11-29 01:00:56,831 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1333 transitions. Word has length 112 [2023-11-29 01:00:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:00:56,831 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1333 transitions. [2023-11-29 01:00:56,832 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:00:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1333 transitions. [2023-11-29 01:00:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:00:56,832 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:00:56,832 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:00:56,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 01:00:57,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:00:57,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:00:57,233 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 01:00:57,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:00:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash -948845740, now seen corresponding path program 1 times [2023-11-29 01:00:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:00:57,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1152585771] [2023-11-29 01:00:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:00:57,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:00:57,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:00:57,235 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:00:57,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:00:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:00:58,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 01:00:58,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:00:58,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:00:58,607 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:00:58,607 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:00:58,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:00:58,822 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:01:00,307 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:00,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:01:00,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:00,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:01:00,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:00,654 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:01:00,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:00,821 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:01:00,843 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:01:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:01:00,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:01,040 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8234) |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:01:01,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:01:01,083 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8233))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:01:01,232 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8232))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:01:01,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:01:01,855 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8280))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8232)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8233)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8234)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:01:01,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:01:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1152585771] [2023-11-29 01:01:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1152585771] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [306832731] [2023-11-29 01:01:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:01:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:01:01,863 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:01:01,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:01:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:22,599 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:01:22,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:22,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:01:23,251 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:01:23,252 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:01:23,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:01:23,659 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:01:25,022 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:25,022 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:01:25,325 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:25,325 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:01:25,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:25,531 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:01:25,734 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:01:25,735 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:01:25,767 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:01:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:01:25,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:25,823 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8736) |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:01:25,843 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:01:25,866 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8735))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:01:25,889 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:01:25,915 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:01:25,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8734))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:01:26,548 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8782))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8734)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8735)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8736)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:01:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [306832731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:26,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:01:26,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:01:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786524463] [2023-11-29 01:01:26,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:01:26,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:01:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:01:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:01:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=374, Unknown=14, NotChecked=676, Total=1190 [2023-11-29 01:01:26,558 INFO L87 Difference]: Start difference. First operand 1145 states and 1333 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:01:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:01:44,117 INFO L93 Difference]: Finished difference Result 1496 states and 1802 transitions. [2023-11-29 01:01:44,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:01:44,118 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:01:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:01:44,121 INFO L225 Difference]: With dead ends: 1496 [2023-11-29 01:01:44,121 INFO L226 Difference]: Without dead ends: 1496 [2023-11-29 01:01:44,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=136, Invalid=408, Unknown=14, NotChecked=702, Total=1260 [2023-11-29 01:01:44,123 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 637 mSDsluCounter, 3746 mSDsCounter, 0 mSdLazyCounter, 4698 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 4308 SdHoareTripleChecker+Invalid, 4705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:01:44,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 4308 Invalid, 4705 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 4698 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2023-11-29 01:01:44,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2023-11-29 01:01:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1144. [2023-11-29 01:01:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 709 states have (on average 1.851904090267983) internal successors, (1313), 1136 states have internal predecessors, (1313), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 01:01:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1332 transitions. [2023-11-29 01:01:44,142 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1332 transitions. Word has length 114 [2023-11-29 01:01:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:01:44,142 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1332 transitions. [2023-11-29 01:01:44,142 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:01:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1332 transitions. [2023-11-29 01:01:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:01:44,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:01:44,144 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:01:44,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01:44,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:01:44,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:01:44,544 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 01:01:44,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:01:44,545 INFO L85 PathProgramCache]: Analyzing trace with hash -948845739, now seen corresponding path program 1 times [2023-11-29 01:01:44,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:01:44,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215509281] [2023-11-29 01:01:44,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:44,546 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:01:44,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:01:44,547 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01:44,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:01:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:01:45,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 01:01:45,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:01:45,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:01:45,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:01:45,956 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:01:45,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:01:46,002 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:01:46,017 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:01:46,209 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:01:46,217 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:01:47,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:01:47,490 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:01:47,695 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:47,696 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:01:47,706 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:01:47,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:47,879 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:01:47,888 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:01:48,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:01:48,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:01:48,074 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:01:48,112 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:01:48,125 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:01:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:01:48,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:01:48,449 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:01:48,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 01:01:48,557 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9283))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9282) .cse0 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9282) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9284) |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:01:48,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9282) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9283))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9282) .cse3 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:01:49,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9280))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9281) .cse1 v_ArrVal_9282) (select (select (store .cse2 .cse1 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9280))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9283))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9281) .cse4 v_ArrVal_9282) .cse5 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:01:50,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9280))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9283))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9281) .cse1 v_ArrVal_9282) .cse2 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9280))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9281) .cse7 v_ArrVal_9282) (select (select (store .cse8 .cse7 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 01:01:53,905 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9376))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9280))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9283))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9377) .cse0 v_ArrVal_9281) .cse1 v_ArrVal_9282) .cse2 v_ArrVal_9284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9285) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9376 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9377 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9376))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9280))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9377) .cse8 v_ArrVal_9281) .cse9 v_ArrVal_9282) (select (select (store .cse10 .cse9 v_ArrVal_9283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9284))))) |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:01:53,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:01:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215509281] [2023-11-29 01:01:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215509281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:01:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1368522637] [2023-11-29 01:01:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:01:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:01:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:01:53,935 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:01:53,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 01:02:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:02:17,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:02:17,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:02:17,324 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:02:18,027 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:02:18,061 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:02:18,061 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:02:18,199 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:02:18,220 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:02:18,557 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:02:18,565 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:02:19,922 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:19,923 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:02:19,939 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:02:20,313 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:20,313 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:02:20,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:02:20,546 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:20,546 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:02:20,563 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:02:20,821 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:02:20,821 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:02:20,831 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:02:20,863 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:02:20,878 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:02:20,887 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:02:20,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:02:20,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 01:02:21,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9879) |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:02:21,114 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9878))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9877) .cse0 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9877) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 01:02:21,347 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9877) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9878))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9877) .cse3 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:02:21,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9875))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9878))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9876) .cse0 v_ArrVal_9877) .cse1 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9875))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9876) .cse6 v_ArrVal_9877) (select (select (store .cse7 .cse6 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9879))) |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:02:24,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9875))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9876) .cse2 v_ArrVal_9877) (select (select (store .cse3 .cse2 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9879))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9875))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9878))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9876) .cse5 v_ArrVal_9877) .cse6 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:02:30,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9971))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9875))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9972) .cse1 v_ArrVal_9876) .cse2 v_ArrVal_9877) (select (select (store .cse3 .cse2 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9879))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9972 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9971))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9875))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9878))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9972) .cse6 v_ArrVal_9876) .cse7 v_ArrVal_9877) .cse8 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:02:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1368522637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:02:30,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:02:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:02:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092826704] [2023-11-29 01:02:30,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:02:30,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:02:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:02:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:02:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:02:30,322 INFO L87 Difference]: Start difference. First operand 1144 states and 1332 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:03:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:03:41,081 INFO L93 Difference]: Finished difference Result 1495 states and 1801 transitions. [2023-11-29 01:03:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:03:41,082 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:03:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:03:41,085 INFO L225 Difference]: With dead ends: 1495 [2023-11-29 01:03:41,085 INFO L226 Difference]: Without dead ends: 1495 [2023-11-29 01:03:41,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 01:03:41,086 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 1227 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 5934 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 5951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:03:41,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 3334 Invalid, 5951 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 5934 Invalid, 0 Unknown, 0 Unchecked, 68.9s Time] [2023-11-29 01:03:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2023-11-29 01:03:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1143. [2023-11-29 01:03:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 709 states have (on average 1.85049365303244) internal successors, (1312), 1135 states have internal predecessors, (1312), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 01:03:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1331 transitions. [2023-11-29 01:03:41,099 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1331 transitions. Word has length 114 [2023-11-29 01:03:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:03:41,099 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1331 transitions. [2023-11-29 01:03:41,099 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:03:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1331 transitions. [2023-11-29 01:03:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 01:03:41,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:03:41,100 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:03:41,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:03:41,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 01:03:41,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:03:41,501 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 01:03:41,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:03:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1305978949, now seen corresponding path program 1 times [2023-11-29 01:03:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:03:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454136618] [2023-11-29 01:03:41,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:41,502 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:03:41,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:03:41,503 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:03:41,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:03:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:03:42,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 01:03:42,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:03:42,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:03:44,248 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:03:44,249 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:03:44,432 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:03:45,052 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:03:50,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:03:50,058 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:03:50,741 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:03:50,742 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:03:51,294 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:03:51,294 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:03:51,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:03:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:03:52,403 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:03:52,403 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:03:52,476 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:03:52,740 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 01:03:52,741 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:03:53,062 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:03:53,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:03:53,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10445 (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)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10445) |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:03:53,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10445 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:03:53,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:03:53,870 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:03:53,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:03:53,997 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:03:54,067 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:03:54,141 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (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 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:03:55,647 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (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 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10492))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:03:55,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:03:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454136618] [2023-11-29 01:03:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454136618] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:03:55,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [354008252] [2023-11-29 01:03:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:03:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:03:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:03:55,666 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:03:55,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 01:04:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:04:06,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 01:04:06,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:04:06,080 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:04:08,531 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:04:08,531 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:04:08,974 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:04:09,997 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:04:16,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:16,436 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:04:17,439 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:17,439 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:04:18,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:18,180 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:04:18,919 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:18,920 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:04:19,656 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:04:19,657 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:04:20,106 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-29 01:04:20,106 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 32 treesize of output 44 [2023-11-29 01:04:20,130 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:04:20,355 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:04:20,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:04:24,897 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10966) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))))))) is different from false [2023-11-29 01:04:24,997 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ 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:04:25,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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 (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)))) is different from false [2023-11-29 01:04:25,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:04:25,253 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 01:04:25,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:04:25,438 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 01:04:25,537 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ 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_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 01:04:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [354008252] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:04:27,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:04:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 01:04:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589821293] [2023-11-29 01:04:27,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:04:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:04:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:04:27,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:04:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=590, Unknown=18, NotChecked=1122, Total=1892 [2023-11-29 01:04:27,576 INFO L87 Difference]: Start difference. First operand 1143 states and 1331 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) [2023-11-29 01:05:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:05:22,661 INFO L93 Difference]: Finished difference Result 1494 states and 1800 transitions. [2023-11-29 01:05:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:05:22,662 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 116 [2023-11-29 01:05:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:05:22,666 INFO L225 Difference]: With dead ends: 1494 [2023-11-29 01:05:22,666 INFO L226 Difference]: Without dead ends: 1494 [2023-11-29 01:05:22,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=172, Invalid=634, Unknown=18, NotChecked=1156, Total=1980 [2023-11-29 01:05:22,668 INFO L413 NwaCegarLoop]: 561 mSDtfsCounter, 1201 mSDsluCounter, 3442 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 4496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:05:22,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 4003 Invalid, 4496 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 4481 Invalid, 0 Unknown, 0 Unchecked, 54.6s Time] [2023-11-29 01:05:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2023-11-29 01:05:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1142. [2023-11-29 01:05:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 709 states have (on average 1.849083215796897) internal successors, (1311), 1134 states have internal predecessors, (1311), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 01:05:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1330 transitions. [2023-11-29 01:05:22,687 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1330 transitions. Word has length 116 [2023-11-29 01:05:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:05:22,688 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1330 transitions. [2023-11-29 01:05:22,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-11-29 01:05:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1330 transitions. [2023-11-29 01:05:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 01:05:22,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:05:22,689 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:05:22,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2023-11-29 01:05:22,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 01:05:23,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:23,090 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 635 more)] === [2023-11-29 01:05:23,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:05:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1305978948, now seen corresponding path program 1 times [2023-11-29 01:05:23,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:05:23,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518560722] [2023-11-29 01:05:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:05:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:05:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:05:23,092 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:05:23,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 01:05:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:05:24,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-29 01:05:24,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:05:24,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:05:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:05:25,968 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:05:25,968 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:05:26,196 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:05:26,241 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:05:27,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 01:05:27,126 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:05:34,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:34,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 01:05:35,012 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:05:35,909 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:35,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 01:05:35,937 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:05:36,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:36,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 01:05:36,716 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:05:37,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:37,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 01:05:37,384 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:05:38,058 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:05:38,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 01:05:38,084 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:05:38,230 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 44 treesize of output 20 [2023-11-29 01:05:38,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:05:38,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:05:38,311 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:05:38,511 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 01:05:38,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 01:05:38,721 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:05:38,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:05:39,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:05:40,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-29 01:05:41,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11533))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11534) .cse0 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse2 .cse0 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11534) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:05:41,684 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11533))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11534) .cse1 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse1 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11534) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-29 01:06:16,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11529))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11532))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11530) .cse2 v_ArrVal_11531) .cse3 v_ArrVal_11534) (select (select (store .cse4 .cse3 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11535))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11529))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11532))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11533))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11530) .cse7 v_ArrVal_11531) .cse8 v_ArrVal_11534) .cse9 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse10 .cse9 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 01:06:22,719 WARN L293 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 01:06:24,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11628))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11529))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11532))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11629) .cse1 v_ArrVal_11530) .cse2 v_ArrVal_11531) .cse3 v_ArrVal_11534) (select (select (store .cse4 .cse3 v_ArrVal_11533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11535))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11530 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11535 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11529 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11628))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11529))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11532))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11533))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11629) .cse8 v_ArrVal_11530) .cse9 v_ArrVal_11531) .cse10 v_ArrVal_11534) .cse11 v_ArrVal_11535) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse12 .cse11 v_ArrVal_11536) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:06:24,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518560722] [2023-11-29 01:06:24,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518560722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:06:24,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1579794385] [2023-11-29 01:06:24,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:24,821 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:06:24,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:06:24,822 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:06:24,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76c2e2e9-2b96-4e6c-b527-7229e57ee933/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 01:06:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:37,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 01:06:37,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:43,365 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:06:43,365 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:06:43,549 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:06:44,771 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:06:44,866 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:06:47,894 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 29 treesize of output 17 [2023-11-29 01:06:47,943 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:07:03,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:03,729 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 61 treesize of output 54 [2023-11-29 01:07:03,821 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:07:06,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:06,819 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 61 treesize of output 54 [2023-11-29 01:07:06,913 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:07:08,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:08,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2023-11-29 01:07:08,895 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:07:10,789 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:10,789 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 61 treesize of output 54 [2023-11-29 01:07:10,883 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:07:12,769 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:07:12,769 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 61 treesize of output 54 [2023-11-29 01:07:12,818 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:07:13,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:07:13,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 01:07:13,187 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 36 treesize of output 20 [2023-11-29 01:07:13,235 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:07:13,677 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 01:07:13,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 01:07:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:07:13,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:15,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2023-11-29 01:07:15,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-29 01:07:16,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12149) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12150))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12149) .cse2 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse2 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:07:16,720 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12150))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12149) .cse1 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse3 .cse1 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12149) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-29 01:07:17,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12148))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12147) .cse1 v_ArrVal_12149) (select (select (store .cse2 .cse1 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12151))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12148))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12150))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12147) .cse4 v_ArrVal_12149) .cse5 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse6 .cse5 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:07:17,391 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12148))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12150))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12147) .cse1 v_ArrVal_12149) .cse2 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse4 .cse2 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12148))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12147) .cse7 v_ArrVal_12149) (select (select (store .cse8 .cse7 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12151))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))))))) is different from false [2023-11-29 01:07:17,767 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12145))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12148))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12146) .cse1 v_ArrVal_12147) .cse2 v_ArrVal_12149) (select (select (store .cse3 .cse2 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12151))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12145))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12148))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12150))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12146) .cse6 v_ArrVal_12147) .cse7 v_ArrVal_12149) .cse8 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse9 .cse8 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:07:18,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12145))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12148))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_12150))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12146) .cse1 v_ArrVal_12147) .cse2 v_ArrVal_12149) .cse3 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse5 .cse3 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12145))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_12148))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12146) .cse9 v_ArrVal_12147) .cse10 v_ArrVal_12149) (select (select (store .cse11 .cse10 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12151))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse8 (bvadd (_ bv4 32) .cse8)))))))) is different from false [2023-11-29 01:07:23,741 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 356 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 01:07:24,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12245))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12145))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_12148))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12244) .cse1 v_ArrVal_12146) .cse2 v_ArrVal_12147) .cse3 v_ArrVal_12149) (select (select (store .cse4 .cse3 v_ArrVal_12150) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_12151))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((v_ArrVal_12244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12148 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12151 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_12152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12150 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11537 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12245))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_12145))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_12148))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_12150))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12244) .cse8 v_ArrVal_12146) .cse9 v_ArrVal_12147) .cse10 v_ArrVal_12149) .cse11 v_ArrVal_12151) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11537) (select (select (store .cse12 .cse11 v_ArrVal_12152) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 01:07:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1579794385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:25,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:07:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-11-29 01:07:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248068114] [2023-11-29 01:07:25,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:07:25,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 01:07:25,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:07:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 01:07:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=525, Unknown=32, NotChecked=930, Total=1640 [2023-11-29 01:07:25,043 INFO L87 Difference]: Start difference. First operand 1142 states and 1330 transitions. Second operand has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 21 states have internal predecessors, (136), 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)