./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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 64bit --witnessprinter.graph.data.programhash 171516ccf7ce56a0fe5d7e6e8d7c3265875afe4246c9b2f5548b0fe9f9b93621 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:51:19,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:51:19,095 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 04:51:19,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:51:19,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:51:19,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:51:19,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:51:19,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:51:19,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:51:19,125 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:51:19,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:51:19,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:51:19,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:51:19,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:51:19,128 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:51:19,128 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:51:19,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:51:19,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:51:19,130 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:51:19,130 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:51:19,131 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:51:19,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:51:19,132 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:51:19,132 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:51:19,132 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:51:19,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:51:19,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:51:19,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:51:19,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:51:19,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:51:19,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:51:19,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:51:19,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:51:19,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:51:19,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:51:19,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:51:19,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:51:19,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:51:19,136 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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 171516ccf7ce56a0fe5d7e6e8d7c3265875afe4246c9b2f5548b0fe9f9b93621 [2023-11-29 04:51:19,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:51:19,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:51:19,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:51:19,397 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:51:19,398 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:51:19,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-29 04:51:22,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:51:22,427 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:51:22,428 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-29 04:51:22,449 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/89d4bf931/025b459fe5f84d8686996b5ad6dde87d/FLAG3d58a9150 [2023-11-29 04:51:22,464 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/89d4bf931/025b459fe5f84d8686996b5ad6dde87d [2023-11-29 04:51:22,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:51:22,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:51:22,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:51:22,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:51:22,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:51:22,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:51:22" (1/1) ... [2023-11-29 04:51:22,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413127f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:22, skipping insertion in model container [2023-11-29 04:51:22,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:51:22" (1/1) ... [2023-11-29 04:51:22,532 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:51:23,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:51:23,351 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 04:51:23,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1af1e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:23, skipping insertion in model container [2023-11-29 04:51:23,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:51:23,352 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:51:23,354 INFO L158 Benchmark]: Toolchain (without parser) took 885.36ms. Allocated memory is still 140.5MB. Free memory was 104.4MB in the beginning and 80.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:51:23,355 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:51:23,356 INFO L158 Benchmark]: CACSL2BoogieTranslator took 883.01ms. Allocated memory is still 140.5MB. Free memory was 103.8MB in the beginning and 80.3MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:51:23,358 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.22ms. Allocated memory is still 140.5MB. Free memory was 104.7MB in the beginning and 104.6MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 883.01ms. Allocated memory is still 140.5MB. Free memory was 103.8MB in the beginning and 80.3MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1876]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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 64bit --witnessprinter.graph.data.programhash 171516ccf7ce56a0fe5d7e6e8d7c3265875afe4246c9b2f5548b0fe9f9b93621 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:51:25,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:51:25,128 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-29 04:51:25,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:51:25,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:51:25,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:51:25,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:51:25,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:51:25,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:51:25,175 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:51:25,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:51:25,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:51:25,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:51:25,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:51:25,178 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:51:25,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:51:25,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:51:25,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:51:25,181 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:51:25,181 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:51:25,182 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:51:25,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:51:25,183 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:51:25,183 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:51:25,184 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:51:25,184 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:51:25,185 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:51:25,185 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:51:25,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:51:25,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:51:25,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:51:25,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:51:25,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:51:25,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:51:25,188 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:51:25,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:51:25,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:51:25,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:51:25,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:51:25,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:51:25,189 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:51:25,189 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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 171516ccf7ce56a0fe5d7e6e8d7c3265875afe4246c9b2f5548b0fe9f9b93621 [2023-11-29 04:51:25,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:51:25,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:51:25,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:51:25,494 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:51:25,495 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:51:25,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-29 04:51:28,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:51:28,635 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:51:28,636 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2023-11-29 04:51:28,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/8257ff28f/6ae4ca0c5e9248ab92a68be62611e554/FLAG090bdd333 [2023-11-29 04:51:28,874 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/data/8257ff28f/6ae4ca0c5e9248ab92a68be62611e554 [2023-11-29 04:51:28,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:51:28,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:51:28,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:51:28,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:51:28,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:51:28,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:51:28" (1/1) ... [2023-11-29 04:51:28,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5777bcfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:28, skipping insertion in model container [2023-11-29 04:51:28,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:51:28" (1/1) ... [2023-11-29 04:51:28,965 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:51:29,734 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:51:29,755 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:51:29,774 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:51:29,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:51:29,877 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:51:29,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:51:30,172 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:51:30,179 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:51:30,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30 WrapperNode [2023-11-29 04:51:30,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:51:30,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:51:30,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:51:30,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:51:30,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,228 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,274 INFO L138 Inliner]: procedures = 550, calls = 133, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 427 [2023-11-29 04:51:30,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:51:30,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:51:30,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:51:30,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:51:30,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,320 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-29 04:51:30,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,355 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:51:30,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:51:30,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:51:30,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:51:30,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (1/1) ... [2023-11-29 04:51:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:51:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:51:30,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:51:30,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:51:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:51:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-29 04:51:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-29 04:51:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:51:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-29 04:51:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:51:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:51:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-29 04:51:30,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-29 04:51:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-29 04:51:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-29 04:51:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-29 04:51:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-29 04:51:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:51:30,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:51:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:51:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 04:51:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-29 04:51:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-29 04:51:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-29 04:51:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-29 04:51:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-29 04:51:30,802 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:51:30,804 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:51:33,153 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:51:33,223 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:51:33,223 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 04:51:33,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:51:33 BoogieIcfgContainer [2023-11-29 04:51:33,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:51:33,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:51:33,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:51:33,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:51:33,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:51:28" (1/3) ... [2023-11-29 04:51:33,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1502d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:51:33, skipping insertion in model container [2023-11-29 04:51:33,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:51:30" (2/3) ... [2023-11-29 04:51:33,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1502d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:51:33, skipping insertion in model container [2023-11-29 04:51:33,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:51:33" (3/3) ... [2023-11-29 04:51:33,232 INFO L112 eAbstractionObserver]: Analyzing ICFG sync-2.i [2023-11-29 04:51:33,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:51:33,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 129 error locations. [2023-11-29 04:51:33,302 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:51:33,309 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;@4f07e6eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:51:33,309 INFO L358 AbstractCegarLoop]: Starting to check reachability of 129 error locations. [2023-11-29 04:51:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 141 states have (on average 2.1914893617021276) internal successors, (309), 270 states have internal predecessors, (309), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:33,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:51:33,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:33,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:51:33,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:33,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 18792, now seen corresponding path program 1 times [2023-11-29 04:51:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814180370] [2023-11-29 04:51:33,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:33,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:33,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:33,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:33,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:51:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:33,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:51:33,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:33,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:51:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:33,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:33,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814180370] [2023-11-29 04:51:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814180370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:51:33,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758738423] [2023-11-29 04:51:33,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:33,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:51:33,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:51:33,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:33,618 INFO L87 Difference]: Start difference. First operand has 280 states, 141 states have (on average 2.1914893617021276) internal successors, (309), 270 states have internal predecessors, (309), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:34,723 INFO L93 Difference]: Finished difference Result 397 states and 447 transitions. [2023-11-29 04:51:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:51:34,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 04:51:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:34,735 INFO L225 Difference]: With dead ends: 397 [2023-11-29 04:51:34,735 INFO L226 Difference]: Without dead ends: 396 [2023-11-29 04:51:34,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:34,739 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 245 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:34,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 281 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:51:34,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-11-29 04:51:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 276. [2023-11-29 04:51:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 141 states have (on average 2.0921985815602837) internal successors, (295), 266 states have internal predecessors, (295), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 309 transitions. [2023-11-29 04:51:34,824 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 309 transitions. Word has length 2 [2023-11-29 04:51:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:34,824 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 309 transitions. [2023-11-29 04:51:34,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 309 transitions. [2023-11-29 04:51:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:51:34,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:34,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:51:34,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:51:35,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:35,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:35,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 18793, now seen corresponding path program 1 times [2023-11-29 04:51:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202005363] [2023-11-29 04:51:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:35,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:35,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:35,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:35,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:51:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:35,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:51:35,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:35,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:51:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:35,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:35,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:35,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202005363] [2023-11-29 04:51:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202005363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:51:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079267899] [2023-11-29 04:51:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:35,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:51:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:51:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:35,215 INFO L87 Difference]: Start difference. First operand 276 states and 309 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:36,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:36,417 INFO L93 Difference]: Finished difference Result 275 states and 308 transitions. [2023-11-29 04:51:36,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:51:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 04:51:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:36,421 INFO L225 Difference]: With dead ends: 275 [2023-11-29 04:51:36,421 INFO L226 Difference]: Without dead ends: 275 [2023-11-29 04:51:36,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:36,423 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 9 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:36,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 437 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:51:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-29 04:51:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2023-11-29 04:51:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 141 states have (on average 2.0851063829787235) internal successors, (294), 265 states have internal predecessors, (294), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 308 transitions. [2023-11-29 04:51:36,439 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 308 transitions. Word has length 2 [2023-11-29 04:51:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:36,439 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 308 transitions. [2023-11-29 04:51:36,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 308 transitions. [2023-11-29 04:51:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 04:51:36,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:36,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 04:51:36,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:51:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:36,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:36,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash 18568027, now seen corresponding path program 1 times [2023-11-29 04:51:36,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:36,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844316023] [2023-11-29 04:51:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:36,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:36,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:36,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:36,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:51:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:36,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:51:36,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:36,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:51:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:36,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:36,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844316023] [2023-11-29 04:51:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844316023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:51:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723453460] [2023-11-29 04:51:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:36,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:51:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:51:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:51:36,846 INFO L87 Difference]: Start difference. First operand 275 states and 308 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:38,519 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2023-11-29 04:51:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:51:38,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-29 04:51:38,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:38,522 INFO L225 Difference]: With dead ends: 277 [2023-11-29 04:51:38,522 INFO L226 Difference]: Without dead ends: 277 [2023-11-29 04:51:38,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:51:38,524 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 9 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:38,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 607 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 04:51:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-11-29 04:51:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2023-11-29 04:51:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 143 states have (on average 2.06993006993007) internal successors, (296), 267 states have internal predecessors, (296), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 310 transitions. [2023-11-29 04:51:38,537 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 310 transitions. Word has length 4 [2023-11-29 04:51:38,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:38,537 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 310 transitions. [2023-11-29 04:51:38,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 310 transitions. [2023-11-29 04:51:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:51:38,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:38,538 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-29 04:51:38,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:51:38,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:38,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:38,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:38,739 INFO L85 PathProgramCache]: Analyzing trace with hash 664504068, now seen corresponding path program 1 times [2023-11-29 04:51:38,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:38,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103815017] [2023-11-29 04:51:38,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:38,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:38,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:38,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:38,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:51:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:38,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:51:38,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:38,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:51:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:38,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:39,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103815017] [2023-11-29 04:51:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103815017] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:51:39,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:39,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-29 04:51:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448706803] [2023-11-29 04:51:39,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:39,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:51:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:51:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:51:39,526 INFO L87 Difference]: Start difference. First operand 277 states and 310 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:46,170 INFO L93 Difference]: Finished difference Result 279 states and 312 transitions. [2023-11-29 04:51:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:51:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 6 [2023-11-29 04:51:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:46,175 INFO L225 Difference]: With dead ends: 279 [2023-11-29 04:51:46,175 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 04:51:46,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:51:46,176 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 19 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:46,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 948 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-29 04:51:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 04:51:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2023-11-29 04:51:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 146 states have (on average 2.041095890410959) internal successors, (298), 269 states have internal predecessors, (298), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:46,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2023-11-29 04:51:46,185 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 6 [2023-11-29 04:51:46,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:46,185 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2023-11-29 04:51:46,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:46,186 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2023-11-29 04:51:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:51:46,186 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:46,186 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-29 04:51:46,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:51:46,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:46,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:46,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1037811900, now seen corresponding path program 1 times [2023-11-29 04:51:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42526951] [2023-11-29 04:51:46,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:46,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:46,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:46,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:51:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:46,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:51:46,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:46,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:46,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42526951] [2023-11-29 04:51:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42526951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:51:46,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 04:51:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304276494] [2023-11-29 04:51:46,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:51:46,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:51:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:51:46,649 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:47,762 INFO L93 Difference]: Finished difference Result 289 states and 322 transitions. [2023-11-29 04:51:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:51:47,764 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:51:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:47,766 INFO L225 Difference]: With dead ends: 289 [2023-11-29 04:51:47,766 INFO L226 Difference]: Without dead ends: 289 [2023-11-29 04:51:47,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:51:47,768 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 6 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:47,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1337 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:51:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-29 04:51:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2023-11-29 04:51:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 156 states have (on average 1.9743589743589745) internal successors, (308), 279 states have internal predecessors, (308), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-29 04:51:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 322 transitions. [2023-11-29 04:51:47,776 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 322 transitions. Word has length 11 [2023-11-29 04:51:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:47,776 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 322 transitions. [2023-11-29 04:51:47,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 322 transitions. [2023-11-29 04:51:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:51:47,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:47,777 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:51:47,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:51:47,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:47,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:47,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1044606031, now seen corresponding path program 2 times [2023-11-29 04:51:47,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937332406] [2023-11-29 04:51:47,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:51:47,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:47,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:47,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:51:48,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:51:48,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:51:48,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:51:48,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:48,216 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 04:51:48,216 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 21 treesize of output 20 [2023-11-29 04:51:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 04:51:48,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:48,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937332406] [2023-11-29 04:51:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937332406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:51:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456487162] [2023-11-29 04:51:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:48,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:51:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:51:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:48,384 INFO L87 Difference]: Start difference. First operand 289 states and 322 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:49,276 INFO L93 Difference]: Finished difference Result 427 states and 476 transitions. [2023-11-29 04:51:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:51:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 21 [2023-11-29 04:51:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:49,280 INFO L225 Difference]: With dead ends: 427 [2023-11-29 04:51:49,280 INFO L226 Difference]: Without dead ends: 427 [2023-11-29 04:51:49,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:49,281 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 269 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:49,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 323 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:51:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-29 04:51:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 345. [2023-11-29 04:51:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 207 states have (on average 2.0144927536231885) internal successors, (417), 329 states have internal predecessors, (417), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:51:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 439 transitions. [2023-11-29 04:51:49,291 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 439 transitions. Word has length 21 [2023-11-29 04:51:49,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:49,291 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 439 transitions. [2023-11-29 04:51:49,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2023-11-29 04:51:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:51:49,292 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:49,292 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:51:49,298 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:51:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:49,493 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:49,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1044606032, now seen corresponding path program 1 times [2023-11-29 04:51:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541327537] [2023-11-29 04:51:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:49,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:49,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:51:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:49,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:51:49,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:49,780 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:51:50,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541327537] [2023-11-29 04:51:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541327537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:51:50,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:50,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 04:51:50,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214172995] [2023-11-29 04:51:50,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:50,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:51:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:50,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:51:50,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:51:50,022 INFO L87 Difference]: Start difference. First operand 345 states and 439 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:52,016 INFO L93 Difference]: Finished difference Result 349 states and 443 transitions. [2023-11-29 04:51:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:51:52,018 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 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 21 [2023-11-29 04:51:52,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:52,020 INFO L225 Difference]: With dead ends: 349 [2023-11-29 04:51:52,020 INFO L226 Difference]: Without dead ends: 349 [2023-11-29 04:51:52,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:51:52,026 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 2 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3194 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:52,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3194 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:51:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-11-29 04:51:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2023-11-29 04:51:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 211 states have (on average 1.995260663507109) internal successors, (421), 333 states have internal predecessors, (421), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:51:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 443 transitions. [2023-11-29 04:51:52,035 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 443 transitions. Word has length 21 [2023-11-29 04:51:52,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:52,035 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 443 transitions. [2023-11-29 04:51:52,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 443 transitions. [2023-11-29 04:51:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:51:52,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:52,036 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-29 04:51:52,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:51:52,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:52,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:52,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash 757682558, now seen corresponding path program 2 times [2023-11-29 04:51:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687847485] [2023-11-29 04:51:52,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:51:52,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:52,239 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:52,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:51:52,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:51:52,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:51:52,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:51:52,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:52,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:51:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:51:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:51:52,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:52,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687847485] [2023-11-29 04:51:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687847485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:51:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372240021] [2023-11-29 04:51:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:52,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:51:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:52,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:51:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:52,637 INFO L87 Difference]: Start difference. First operand 349 states and 443 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:53,743 INFO L93 Difference]: Finished difference Result 352 states and 445 transitions. [2023-11-29 04:51:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:51:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 25 [2023-11-29 04:51:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:53,746 INFO L225 Difference]: With dead ends: 352 [2023-11-29 04:51:53,746 INFO L226 Difference]: Without dead ends: 352 [2023-11-29 04:51:53,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:53,747 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:53,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 443 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:51:53,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-11-29 04:51:53,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2023-11-29 04:51:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 214 states have (on average 1.9766355140186915) internal successors, (423), 335 states have internal predecessors, (423), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:51:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 445 transitions. [2023-11-29 04:51:53,756 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 445 transitions. Word has length 25 [2023-11-29 04:51:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:53,756 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 445 transitions. [2023-11-29 04:51:53,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:51:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 445 transitions. [2023-11-29 04:51:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:51:53,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:53,757 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:53,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:51:53,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:53,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:53,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1723084513, now seen corresponding path program 1 times [2023-11-29 04:51:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102237467] [2023-11-29 04:51:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:53,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:53,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:51:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:54,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:51:54,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:54,325 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:51:54,325 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 04:51:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:51:54,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:54,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102237467] [2023-11-29 04:51:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102237467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:51:54,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093486651] [2023-11-29 04:51:54,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:54,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:51:54,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:54,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:51:54,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:54,353 INFO L87 Difference]: Start difference. First operand 352 states and 445 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:51:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:56,344 INFO L93 Difference]: Finished difference Result 423 states and 477 transitions. [2023-11-29 04:51:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:51:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 32 [2023-11-29 04:51:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:56,348 INFO L225 Difference]: With dead ends: 423 [2023-11-29 04:51:56,348 INFO L226 Difference]: Without dead ends: 423 [2023-11-29 04:51:56,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:51:56,349 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 230 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:56,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 324 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:51:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-11-29 04:51:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 347. [2023-11-29 04:51:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 214 states have (on average 1.9532710280373833) internal successors, (418), 330 states have internal predecessors, (418), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:51:56,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 440 transitions. [2023-11-29 04:51:56,357 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 440 transitions. Word has length 32 [2023-11-29 04:51:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:56,357 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 440 transitions. [2023-11-29 04:51:56,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:51:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 440 transitions. [2023-11-29 04:51:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:51:56,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:56,358 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:56,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:51:56,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:56,558 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:56,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1723084514, now seen corresponding path program 1 times [2023-11-29 04:51:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:56,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137327003] [2023-11-29 04:51:56,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:56,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:56,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:56,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:51:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:56,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:51:56,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:56,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:51:56,997 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 16 treesize of output 10 [2023-11-29 04:51:57,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:51:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:51:57,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:51:57,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:57,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137327003] [2023-11-29 04:51:57,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137327003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:51:57,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:51:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:51:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798693472] [2023-11-29 04:51:57,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:51:57,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:51:57,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:57,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:51:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:51:57,055 INFO L87 Difference]: Start difference. First operand 347 states and 440 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:51:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:58,973 INFO L93 Difference]: Finished difference Result 383 states and 478 transitions. [2023-11-29 04:51:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:51:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 32 [2023-11-29 04:51:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:58,976 INFO L225 Difference]: With dead ends: 383 [2023-11-29 04:51:58,976 INFO L226 Difference]: Without dead ends: 383 [2023-11-29 04:51:58,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:51:58,977 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 338 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:58,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 882 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 04:51:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-11-29 04:51:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 361. [2023-11-29 04:51:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 229 states have (on average 1.943231441048035) internal successors, (445), 344 states have internal predecessors, (445), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:51:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 467 transitions. [2023-11-29 04:51:58,985 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 467 transitions. Word has length 32 [2023-11-29 04:51:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:58,985 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 467 transitions. [2023-11-29 04:51:58,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:51:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 467 transitions. [2023-11-29 04:51:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 04:51:58,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:58,987 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:58,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:51:59,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:59,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:51:59,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:59,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1972698463, now seen corresponding path program 1 times [2023-11-29 04:51:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:59,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674930306] [2023-11-29 04:51:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:59,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:59,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:59,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:59,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:51:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:59,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:51:59,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:59,665 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:51:59,665 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 04:51:59,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:51:59,955 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 04:51:59,955 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 29 treesize of output 31 [2023-11-29 04:51:59,976 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:51:59,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:52:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:00,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:00,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:00,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674930306] [2023-11-29 04:52:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674930306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:52:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201041835] [2023-11-29 04:52:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:00,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:52:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:00,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:52:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:00,121 INFO L87 Difference]: Start difference. First operand 361 states and 467 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:03,425 INFO L93 Difference]: Finished difference Result 399 states and 495 transitions. [2023-11-29 04:52:03,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 34 [2023-11-29 04:52:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:03,429 INFO L225 Difference]: With dead ends: 399 [2023-11-29 04:52:03,430 INFO L226 Difference]: Without dead ends: 399 [2023-11-29 04:52:03,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:52:03,430 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 401 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:03,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 905 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 04:52:03,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-11-29 04:52:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 371. [2023-11-29 04:52:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 239 states have (on average 1.9330543933054394) internal successors, (462), 354 states have internal predecessors, (462), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 484 transitions. [2023-11-29 04:52:03,442 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 484 transitions. Word has length 34 [2023-11-29 04:52:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:03,442 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 484 transitions. [2023-11-29 04:52:03,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 484 transitions. [2023-11-29 04:52:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:52:03,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:03,443 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:03,453 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:52:03,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:03,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:03,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1682193095, now seen corresponding path program 1 times [2023-11-29 04:52:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:03,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577156191] [2023-11-29 04:52:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:03,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:03,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:03,646 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:03,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:52:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:04,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:52:04,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:04,087 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 11 treesize of output 7 [2023-11-29 04:52:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:52:04,095 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 1 [2023-11-29 04:52:04,117 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:52:04,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 04:52:04,140 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:04,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:04,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:04,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577156191] [2023-11-29 04:52:04,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577156191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:04,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:04,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:52:04,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714691903] [2023-11-29 04:52:04,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:04,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:52:04,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:52:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:52:04,141 INFO L87 Difference]: Start difference. First operand 371 states and 484 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:05,083 INFO L93 Difference]: Finished difference Result 444 states and 521 transitions. [2023-11-29 04:52:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:52:05,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 36 [2023-11-29 04:52:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:05,087 INFO L225 Difference]: With dead ends: 444 [2023-11-29 04:52:05,087 INFO L226 Difference]: Without dead ends: 444 [2023-11-29 04:52:05,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:52:05,088 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 223 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:05,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 322 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:52:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-11-29 04:52:05,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 383. [2023-11-29 04:52:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 252 states have (on average 1.9087301587301588) internal successors, (481), 366 states have internal predecessors, (481), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 503 transitions. [2023-11-29 04:52:05,098 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 503 transitions. Word has length 36 [2023-11-29 04:52:05,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:05,098 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 503 transitions. [2023-11-29 04:52:05,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 503 transitions. [2023-11-29 04:52:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:52:05,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:05,100 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:05,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:52:05,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:05,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:05,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:05,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1682193094, now seen corresponding path program 1 times [2023-11-29 04:52:05,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655348382] [2023-11-29 04:52:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:05,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:05,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:05,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:52:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:05,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:52:05,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:05,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:52:05,831 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 11 treesize of output 10 [2023-11-29 04:52:05,855 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 16 treesize of output 10 [2023-11-29 04:52:05,876 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 11 treesize of output 7 [2023-11-29 04:52:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:52:06,082 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 19 treesize of output 14 [2023-11-29 04:52:06,110 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:52:06,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:52:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:06,231 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:06,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:06,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655348382] [2023-11-29 04:52:06,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655348382] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:06,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:06,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:52:06,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152019037] [2023-11-29 04:52:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:06,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:52:06,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:06,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:52:06,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:06,233 INFO L87 Difference]: Start difference. First operand 383 states and 503 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:15,706 INFO L93 Difference]: Finished difference Result 456 states and 530 transitions. [2023-11-29 04:52:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 36 [2023-11-29 04:52:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:15,709 INFO L225 Difference]: With dead ends: 456 [2023-11-29 04:52:15,709 INFO L226 Difference]: Without dead ends: 456 [2023-11-29 04:52:15,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:52:15,710 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 587 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:15,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 800 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 04:52:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-11-29 04:52:15,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 383. [2023-11-29 04:52:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 252 states have (on average 1.8968253968253967) internal successors, (478), 366 states have internal predecessors, (478), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 500 transitions. [2023-11-29 04:52:15,721 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 500 transitions. Word has length 36 [2023-11-29 04:52:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:15,721 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 500 transitions. [2023-11-29 04:52:15,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 500 transitions. [2023-11-29 04:52:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:52:15,722 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:15,723 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:15,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:52:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:15,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:15,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1679413268, now seen corresponding path program 1 times [2023-11-29 04:52:15,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084884378] [2023-11-29 04:52:15,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:15,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:15,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:52:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:16,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:52:16,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:16,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:52:16,456 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 21 treesize of output 1 [2023-11-29 04:52:16,554 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:52:16,555 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 04:52:16,617 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:52:16,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 14 [2023-11-29 04:52:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:16,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:16,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:16,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084884378] [2023-11-29 04:52:16,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084884378] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:16,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:16,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:52:16,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011235465] [2023-11-29 04:52:16,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:16,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:52:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:16,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:52:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:16,644 INFO L87 Difference]: Start difference. First operand 383 states and 500 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:20,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:20,686 INFO L93 Difference]: Finished difference Result 380 states and 495 transitions. [2023-11-29 04:52:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:52:20,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 38 [2023-11-29 04:52:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:20,689 INFO L225 Difference]: With dead ends: 380 [2023-11-29 04:52:20,689 INFO L226 Difference]: Without dead ends: 380 [2023-11-29 04:52:20,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:52:20,690 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 252 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:20,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 857 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 04:52:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-11-29 04:52:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 358. [2023-11-29 04:52:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.8956521739130434) internal successors, (436), 341 states have internal predecessors, (436), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 458 transitions. [2023-11-29 04:52:20,698 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 458 transitions. Word has length 38 [2023-11-29 04:52:20,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:20,698 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 458 transitions. [2023-11-29 04:52:20,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 458 transitions. [2023-11-29 04:52:20,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:52:20,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:20,699 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:20,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:52:20,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:20,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:20,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:20,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1679413267, now seen corresponding path program 1 times [2023-11-29 04:52:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213403759] [2023-11-29 04:52:20,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:20,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:20,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:20,902 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:20,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:52:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:21,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 04:52:21,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:52:21,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:52:21,421 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 25 treesize of output 1 [2023-11-29 04:52:21,435 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 16 treesize of output 12 [2023-11-29 04:52:21,501 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 23 treesize of output 18 [2023-11-29 04:52:21,505 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 21 treesize of output 16 [2023-11-29 04:52:21,555 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 9 [2023-11-29 04:52:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:21,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:21,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:21,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213403759] [2023-11-29 04:52:21,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213403759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:21,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:21,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:52:21,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067257965] [2023-11-29 04:52:21,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:21,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:52:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:21,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:52:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:52:21,582 INFO L87 Difference]: Start difference. First operand 358 states and 458 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:25,756 INFO L93 Difference]: Finished difference Result 357 states and 456 transitions. [2023-11-29 04:52:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:52:25,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 38 [2023-11-29 04:52:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:25,759 INFO L225 Difference]: With dead ends: 357 [2023-11-29 04:52:25,759 INFO L226 Difference]: Without dead ends: 357 [2023-11-29 04:52:25,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:52:25,760 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 250 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:25,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 865 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 04:52:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-29 04:52:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2023-11-29 04:52:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 230 states have (on average 1.8869565217391304) internal successors, (434), 340 states have internal predecessors, (434), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 456 transitions. [2023-11-29 04:52:25,767 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 456 transitions. Word has length 38 [2023-11-29 04:52:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:25,768 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 456 transitions. [2023-11-29 04:52:25,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:25,768 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 456 transitions. [2023-11-29 04:52:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:52:25,768 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:25,768 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:25,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 04:52:25,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:25,977 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:25,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 687092883, now seen corresponding path program 1 times [2023-11-29 04:52:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569006217] [2023-11-29 04:52:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:25,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:25,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:25,979 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:25,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:52:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:26,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:52:26,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:26,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:52:26,601 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:52:26,601 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 19 treesize of output 27 [2023-11-29 04:52:26,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:52:26,755 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 38 treesize of output 31 [2023-11-29 04:52:26,915 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:52:26,915 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 56 treesize of output 55 [2023-11-29 04:52:26,958 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 42 treesize of output 15 [2023-11-29 04:52:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:27,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:27,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:27,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569006217] [2023-11-29 04:52:27,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569006217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:52:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184251613] [2023-11-29 04:52:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:27,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:52:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:52:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:52:27,046 INFO L87 Difference]: Start difference. First operand 357 states and 456 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:33,696 INFO L93 Difference]: Finished difference Result 436 states and 496 transitions. [2023-11-29 04:52:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:52:33,698 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 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 41 [2023-11-29 04:52:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:33,700 INFO L225 Difference]: With dead ends: 436 [2023-11-29 04:52:33,700 INFO L226 Difference]: Without dead ends: 436 [2023-11-29 04:52:33,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:52:33,701 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 563 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:33,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 1100 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-11-29 04:52:33,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-11-29 04:52:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 366. [2023-11-29 04:52:33,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 239 states have (on average 1.8786610878661087) internal successors, (449), 349 states have internal predecessors, (449), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 471 transitions. [2023-11-29 04:52:33,712 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 471 transitions. Word has length 41 [2023-11-29 04:52:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:33,712 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 471 transitions. [2023-11-29 04:52:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 471 transitions. [2023-11-29 04:52:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:52:33,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:33,713 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:33,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 04:52:33,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:33,914 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:33,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 687092884, now seen corresponding path program 1 times [2023-11-29 04:52:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:33,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943594479] [2023-11-29 04:52:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:33,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:33,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:33,916 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:33,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:52:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:34,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:52:34,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:34,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:52:34,551 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:52:34,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:52:34,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:52:34,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:52:34,646 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 16 treesize of output 12 [2023-11-29 04:52:34,777 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 36 treesize of output 29 [2023-11-29 04:52:34,784 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 21 treesize of output 16 [2023-11-29 04:52:34,990 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:52:34,990 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 80 treesize of output 75 [2023-11-29 04:52:35,011 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 39 treesize of output 16 [2023-11-29 04:52:35,126 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 40 treesize of output 13 [2023-11-29 04:52:35,134 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 12 treesize of output 3 [2023-11-29 04:52:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:52:35,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:52:35,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943594479] [2023-11-29 04:52:35,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943594479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:52:35,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:52:35,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:52:35,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510921500] [2023-11-29 04:52:35,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:52:35,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:52:35,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:35,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:52:35,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:52:35,178 INFO L87 Difference]: Start difference. First operand 366 states and 471 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:40,022 INFO L93 Difference]: Finished difference Result 434 states and 491 transitions. [2023-11-29 04:52:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:52:40,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 41 [2023-11-29 04:52:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:40,025 INFO L225 Difference]: With dead ends: 434 [2023-11-29 04:52:40,025 INFO L226 Difference]: Without dead ends: 434 [2023-11-29 04:52:40,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:52:40,026 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 575 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:40,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 682 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 04:52:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-29 04:52:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 366. [2023-11-29 04:52:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 239 states have (on average 1.8619246861924685) internal successors, (445), 349 states have internal predecessors, (445), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:52:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 467 transitions. [2023-11-29 04:52:40,033 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 467 transitions. Word has length 41 [2023-11-29 04:52:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:40,033 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 467 transitions. [2023-11-29 04:52:40,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 467 transitions. [2023-11-29 04:52:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:52:40,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:40,034 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:40,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:52:40,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:40,235 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:52:40,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -616654217, now seen corresponding path program 1 times [2023-11-29 04:52:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:40,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214589864] [2023-11-29 04:52:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:40,237 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:40,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:52:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:40,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:52:40,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:40,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:52:40,947 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:52:40,947 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 19 treesize of output 27 [2023-11-29 04:52:41,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:52:41,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2023-11-29 04:52:41,260 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:52:41,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-29 04:52:41,400 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:52:41,400 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 56 treesize of output 55 [2023-11-29 04:52:41,444 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 42 treesize of output 15 [2023-11-29 04:52:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 04:52:41,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:41,650 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1338) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:52:41,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1338) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:52:41,712 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1337 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1337))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1338)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:52:41,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1337 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1337))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1338)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:52:41,776 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1337 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1336 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1336))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1337)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1338)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:52:41,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:41,811 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-11-29 04:52:41,819 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 2847 treesize of output 2244 [2023-11-29 04:52:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 262 treesize of output 206 [2023-11-29 04:52:41,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 123 treesize of output 81 [2023-11-29 04:52:41,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164 treesize of output 136 [2023-11-29 04:52:50,122 WARN L293 SmtUtils]: Spent 6.77s on a formula simplification that was a NOOP. DAG size: 485 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 04:52:50,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:52:50,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 194 treesize of output 1076 [2023-11-29 04:55:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-11-29 04:55:37,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:37,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214589864] [2023-11-29 04:55:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214589864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:37,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:55:37,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-29 04:55:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013023872] [2023-11-29 04:55:37,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:37,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:55:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:37,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:55:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2023-11-29 04:55:37,655 INFO L87 Difference]: Start difference. First operand 366 states and 467 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:55:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:43,619 INFO L93 Difference]: Finished difference Result 432 states and 489 transitions. [2023-11-29 04:55:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:55:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 44 [2023-11-29 04:55:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:43,623 INFO L225 Difference]: With dead ends: 432 [2023-11-29 04:55:43,623 INFO L226 Difference]: Without dead ends: 432 [2023-11-29 04:55:43,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=181, Unknown=5, NotChecked=160, Total=420 [2023-11-29 04:55:43,624 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 794 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2043 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:43,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 936 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 795 Invalid, 0 Unknown, 2043 Unchecked, 5.5s Time] [2023-11-29 04:55:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-11-29 04:55:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 365. [2023-11-29 04:55:43,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 239 states have (on average 1.8535564853556485) internal successors, (443), 348 states have internal predecessors, (443), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:55:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 465 transitions. [2023-11-29 04:55:43,633 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 465 transitions. Word has length 44 [2023-11-29 04:55:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:43,633 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 465 transitions. [2023-11-29 04:55:43,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:55:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 465 transitions. [2023-11-29 04:55:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:55:43,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:43,634 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:43,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:55:43,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:43,835 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:55:43,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash -616654216, now seen corresponding path program 1 times [2023-11-29 04:55:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959361127] [2023-11-29 04:55:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:43,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:43,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:43,837 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:43,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:55:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:45,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 04:55:45,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:45,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:55:45,177 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:55:45,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:55:45,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:55:45,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:55:45,249 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 16 treesize of output 12 [2023-11-29 04:55:45,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 04:55:45,379 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 21 treesize of output 16 [2023-11-29 04:55:45,540 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:55:45,540 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 80 treesize of output 75 [2023-11-29 04:55:45,558 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 39 treesize of output 16 [2023-11-29 04:55:45,815 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:55:45,815 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 80 treesize of output 75 [2023-11-29 04:55:45,827 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 39 treesize of output 16 [2023-11-29 04:55:45,977 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 40 treesize of output 13 [2023-11-29 04:55:45,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2023-11-29 04:55:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:55:46,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:55:46,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1469 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1469) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:55:46,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1469 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1469) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd .cse3 (_ bv1 64) .cse2))))))) is different from false [2023-11-29 04:55:47,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1469 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1468))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1467) .cse1 v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1469) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-29 04:55:47,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1469 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1468))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1467) .cse1 v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1469) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1467) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1468) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-11-29 04:55:47,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1469 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1466 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1465 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1466))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1468))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1465) .cse1 v_ArrVal_1467) .cse2 v_ArrVal_1470) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1469) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1466 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1465 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1468 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1467 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1470 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1466))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1465) .cse7 v_ArrVal_1467) (select (select (store .cse8 .cse7 v_ArrVal_1468) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1470))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse6) (bvadd .cse0 (_ bv1 64) .cse6)))))) is different from false [2023-11-29 04:55:47,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:47,631 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-11-29 04:55:47,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:47,661 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-29 04:55:47,672 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 771 treesize of output 636 [2023-11-29 04:55:47,681 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 1321 treesize of output 1222 [2023-11-29 04:55:47,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 222 treesize of output 194 [2023-11-29 04:55:47,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 194 treesize of output 166 [2023-11-29 04:55:47,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 166 treesize of output 138 [2023-11-29 04:55:47,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 82 treesize of output 68 [2023-11-29 04:55:47,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 68 treesize of output 54 [2023-11-29 04:55:48,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:48,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-29 04:55:48,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:55:48,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-29 04:55:48,139 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:55:48,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 617 treesize of output 392 [2023-11-29 04:55:48,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:55:48,158 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:55:48,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 14 [2023-11-29 04:55:48,615 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:55:48,615 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 15 treesize of output 14 [2023-11-29 04:55:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-11-29 04:55:48,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:55:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959361127] [2023-11-29 04:55:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959361127] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:55:48,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:55:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 04:55:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452727934] [2023-11-29 04:55:48,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:55:48,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 04:55:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:55:48,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 04:55:48,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=200, Unknown=5, NotChecked=160, Total=420 [2023-11-29 04:55:48,621 INFO L87 Difference]: Start difference. First operand 365 states and 465 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:56:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:56:09,067 INFO L93 Difference]: Finished difference Result 440 states and 496 transitions. [2023-11-29 04:56:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:56:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 44 [2023-11-29 04:56:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:56:09,071 INFO L225 Difference]: With dead ends: 440 [2023-11-29 04:56:09,071 INFO L226 Difference]: Without dead ends: 440 [2023-11-29 04:56:09,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=124, Invalid=397, Unknown=5, NotChecked=230, Total=756 [2023-11-29 04:56:09,072 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 566 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2053 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:56:09,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1789 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2552 Invalid, 0 Unknown, 2053 Unchecked, 18.9s Time] [2023-11-29 04:56:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-11-29 04:56:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 371. [2023-11-29 04:56:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 245 states have (on average 1.836734693877551) internal successors, (450), 354 states have internal predecessors, (450), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:56:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 472 transitions. [2023-11-29 04:56:09,078 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 472 transitions. Word has length 44 [2023-11-29 04:56:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:56:09,078 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 472 transitions. [2023-11-29 04:56:09,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:56:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 472 transitions. [2023-11-29 04:56:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 04:56:09,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:56:09,079 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:56:09,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:56:09,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:09,279 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:56:09,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:56:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1157252588, now seen corresponding path program 2 times [2023-11-29 04:56:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:56:09,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847313255] [2023-11-29 04:56:09,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:56:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:56:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:56:09,281 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:56:09,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 04:56:10,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:56:10,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:56:10,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 04:56:10,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:10,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:56:10,290 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:56:10,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:56:10,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:56:10,354 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 16 treesize of output 12 [2023-11-29 04:56:10,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:56:10,491 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 36 treesize of output 29 [2023-11-29 04:56:10,514 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 21 treesize of output 16 [2023-11-29 04:56:10,702 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:56:10,702 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 80 treesize of output 75 [2023-11-29 04:56:10,728 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 39 treesize of output 16 [2023-11-29 04:56:11,006 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:56:11,006 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 80 treesize of output 75 [2023-11-29 04:56:11,017 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 39 treesize of output 16 [2023-11-29 04:56:11,303 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:56:11,304 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 80 treesize of output 75 [2023-11-29 04:56:11,312 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 39 treesize of output 16 [2023-11-29 04:56:11,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 40 treesize of output 13 [2023-11-29 04:56:11,468 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 12 treesize of output 3 [2023-11-29 04:56:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 04:56:11,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:12,514 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:56:12,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:56:12,992 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1608) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1607) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1607))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1608) .cse3 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 04:56:13,300 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1607))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1608) .cse2 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1608) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1607) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-29 04:56:14,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1605))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1606) .cse2 v_ArrVal_1608) (select (select (store .cse3 .cse2 v_ArrVal_1607) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1609))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1605))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1607))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1606) .cse5 v_ArrVal_1608) .cse6 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 04:56:19,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1605))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1606) .cse3 v_ArrVal_1608) (select (select (store .cse4 .cse3 v_ArrVal_1607) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1609))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1605))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1607))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1606) .cse6 v_ArrVal_1608) .cse7 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-29 04:56:22,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1604 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1603 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1604))) (let ((.cse0 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse0 v_ArrVal_1605))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1607))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1603) .cse0 v_ArrVal_1606) .cse1 v_ArrVal_1608) .cse2 v_ArrVal_1609) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1610) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1604 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1603 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1609 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1606 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1605 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1608 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1607 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1604))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1605))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1603) .cse9 v_ArrVal_1606) .cse10 v_ArrVal_1608) (select (select (store .cse11 .cse10 v_ArrVal_1607) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1609))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd .cse8 (_ bv1 64) .cse4)))))) is different from false [2023-11-29 04:56:23,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:23,078 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-29 04:56:23,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:23,122 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-29 04:56:23,180 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 252587 treesize of output 208262 [2023-11-29 04:56:23,417 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 34480 treesize of output 33994 [2023-11-29 04:56:23,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 841 treesize of output 701 [2023-11-29 04:56:23,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 701 treesize of output 645 [2023-11-29 04:56:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 645 treesize of output 505 [2023-11-29 04:56:23,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 505 treesize of output 463 [2023-11-29 04:56:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 463 treesize of output 449 [2023-11-29 04:56:23,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 449 treesize of output 407 [2023-11-29 04:56:23,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 227 treesize of output 185 [2023-11-29 04:56:23,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 185 treesize of output 178 [2023-11-29 04:56:29,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:29,986 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2023-11-29 04:56:30,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:56:30,055 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2023-11-29 04:56:30,107 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 115015 treesize of output 97852 [2023-11-29 04:56:30,595 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 473096 treesize of output 458399 [2023-11-29 04:56:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12447 treesize of output 11271 [2023-11-29 04:56:31,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11271 treesize of output 10879 [2023-11-29 04:56:31,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10879 treesize of output 10305 [2023-11-29 04:56:31,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10305 treesize of output 9192 [2023-11-29 04:56:31,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9192 treesize of output 7232 [2023-11-29 04:56:31,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7232 treesize of output 6476 [2023-11-29 04:56:31,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6476 treesize of output 6084 [2023-11-29 04:56:34,298 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:56:34,299 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 15 treesize of output 14 [2023-11-29 04:56:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 9 not checked. [2023-11-29 04:56:34,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:56:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847313255] [2023-11-29 04:56:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847313255] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:56:34,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:56:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2023-11-29 04:56:34,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323025190] [2023-11-29 04:56:34,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:56:34,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 04:56:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:56:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 04:56:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=329, Unknown=7, NotChecked=294, Total=702 [2023-11-29 04:56:34,306 INFO L87 Difference]: Start difference. First operand 371 states and 472 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:56:59,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:57:01,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:57:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:12,384 INFO L93 Difference]: Finished difference Result 447 states and 503 transitions. [2023-11-29 04:57:12,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:57:12,387 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 47 [2023-11-29 04:57:12,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:12,389 INFO L225 Difference]: With dead ends: 447 [2023-11-29 04:57:12,389 INFO L226 Difference]: Without dead ends: 447 [2023-11-29 04:57:12,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=164, Invalid=669, Unknown=7, NotChecked=420, Total=1260 [2023-11-29 04:57:12,390 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 646 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 5598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2930 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:12,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 2066 Invalid, 5598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2643 Invalid, 0 Unknown, 2930 Unchecked, 34.5s Time] [2023-11-29 04:57:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-11-29 04:57:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 377. [2023-11-29 04:57:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 251 states have (on average 1.8207171314741035) internal successors, (457), 360 states have internal predecessors, (457), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 04:57:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 479 transitions. [2023-11-29 04:57:12,397 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 479 transitions. Word has length 47 [2023-11-29 04:57:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:12,397 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 479 transitions. [2023-11-29 04:57:12,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:57:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 479 transitions. [2023-11-29 04:57:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 04:57:12,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:12,397 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:12,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 04:57:12,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:12,598 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 126 more)] === [2023-11-29 04:57:12,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 4007160, now seen corresponding path program 3 times [2023-11-29 04:57:12,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:57:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821719096] [2023-11-29 04:57:12,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:57:12,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:12,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:57:12,600 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:57:12,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e30d2e1b-3264-4d97-bf8e-898ffb71c92f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 04:57:13,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 04:57:13,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:57:13,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 04:57:13,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 04:57:13,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:57:13,730 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:57:13,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:57:13,862 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 16 treesize of output 12 [2023-11-29 04:57:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 04:57:14,120 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 36 treesize of output 29 [2023-11-29 04:57:14,131 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 21 treesize of output 16 [2023-11-29 04:57:14,517 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:57:14,517 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 80 treesize of output 75 [2023-11-29 04:57:14,538 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 39 treesize of output 16 [2023-11-29 04:57:15,087 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:57:15,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:57:15,121 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 39 treesize of output 16 [2023-11-29 04:57:15,710 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:57:15,710 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 80 treesize of output 75 [2023-11-29 04:57:15,729 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 39 treesize of output 16 [2023-11-29 04:57:16,385 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:57:16,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:57:16,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 04:57:16,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-29 04:57:16,758 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 12 treesize of output 3 [2023-11-29 04:57:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:57:16,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:57:17,987 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd .cse2 (_ bv1 64) .cse1)))))) is different from false [2023-11-29 04:57:18,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd (_ bv1 64) .cse3 .cse2))))))) is different from false [2023-11-29 04:57:18,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1756))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1755) .cse3 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 04:57:19,521 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1756))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1755) .cse1 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1755) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse5 .cse3) (bvadd .cse5 .cse3 (_ bv1 64)))))))) is different from false [2023-11-29 04:57:20,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1753))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1754) .cse2 v_ArrVal_1755) (select (select (store .cse3 .cse2 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1757))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1753))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1756))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem162#1.base| v_ArrVal_1754) .cse5 v_ArrVal_1755) .cse6 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 04:57:21,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1753))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1756))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1754) .cse1 v_ArrVal_1755) .cse2 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1753))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1754) .cse8 v_ArrVal_1755) (select (select (store .cse9 .cse8 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1757))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd (_ bv1 64) .cse7 .cse4))))))) is different from false [2023-11-29 04:57:22,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1751))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1753))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1752) .cse2 v_ArrVal_1754) .cse3 v_ArrVal_1755) (select (select (store .cse4 .cse3 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1757))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1751))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1753))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1756))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem160#1.base| v_ArrVal_1752) .cse7 v_ArrVal_1754) .cse8 v_ArrVal_1755) .cse9 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-29 04:57:24,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1751))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1753))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1752) .cse3 v_ArrVal_1754) .cse4 v_ArrVal_1755) (select (select (store .cse5 .cse4 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1757))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1751))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1753))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1756))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1752) .cse8 v_ArrVal_1754) .cse9 v_ArrVal_1755) .cse10 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-29 04:57:25,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1750 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1749 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1750))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1751))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1753))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1749) .cse2 v_ArrVal_1752) .cse3 v_ArrVal_1754) .cse4 v_ArrVal_1755) (select (select (store .cse5 .cse4 v_ArrVal_1756) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1757))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1751 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1753 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1750 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1749 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1750))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1751))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1753))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1756))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1749) .cse9 v_ArrVal_1752) .cse10 v_ArrVal_1754) .cse11 v_ArrVal_1755) .cse12 v_ArrVal_1757) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1758) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) is different from false [2023-11-29 04:57:26,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:57:26,211 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 899 treesize of output 900 [2023-11-29 04:57:26,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:57:26,250 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 497 [2023-11-29 04:57:26,770 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 3087433095 treesize of output 2538777948 [2023-11-29 04:58:09,830 WARN L293 SmtUtils]: Spent 43.03s on a formula simplification. DAG size of input: 10960 DAG size of output: 288 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:10,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 479416798 treesize of output 475817941 [2023-11-29 04:58:20,233 WARN L293 SmtUtils]: Spent 9.83s on a formula simplification. DAG size of input: 17044 DAG size of output: 255 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:58:20,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33369 treesize of output 29113 [2023-11-29 04:58:20,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29113 treesize of output 27321 [2023-11-29 04:58:20,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27321 treesize of output 26425 [2023-11-29 04:58:20,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26425 treesize of output 24206 [2023-11-29 04:58:21,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24206 treesize of output 20363 [2023-11-29 04:58:21,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20363 treesize of output 16331 [2023-11-29 04:58:21,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16331 treesize of output 15883 [2023-11-29 04:58:21,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15883 treesize of output 15435 [2023-11-29 04:58:21,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15435 treesize of output 14539 [2023-11-29 04:58:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14539 treesize of output 14315