./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/uname-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_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/uname-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/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 64052bfdc5bf6f2a2ba50127e6f4ecf4f822ad11dffb4513d5356b1e12bd4cd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:27:18,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:27:19,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 04:27:19,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:27:19,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:27:19,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:27:19,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:27:19,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:27:19,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:27:19,083 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:27:19,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:27:19,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:27:19,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:27:19,086 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:27:19,087 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:27:19,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:27:19,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:27:19,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:27:19,090 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:27:19,090 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:27:19,091 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:27:19,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:27:19,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:27:19,093 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:27:19,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:27:19,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:27:19,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:27:19,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:27:19,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:27:19,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:19,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:27:19,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:27:19,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:27:19,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:27:19,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:27:19,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:27:19,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:27:19,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:27:19,099 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_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/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 -> 64052bfdc5bf6f2a2ba50127e6f4ecf4f822ad11dffb4513d5356b1e12bd4cd0 [2023-11-29 04:27:19,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:27:19,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:27:19,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:27:19,401 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:27:19,404 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:27:19,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/uname-2.i [2023-11-29 04:27:22,240 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:27:22,609 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:27:22,609 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/sv-benchmarks/c/busybox-1.22.0/uname-2.i [2023-11-29 04:27:22,637 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/32f980034/9208f7572c1e4db0b5b5aa41c6fe716c/FLAGa5f3a5a00 [2023-11-29 04:27:22,651 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/32f980034/9208f7572c1e4db0b5b5aa41c6fe716c [2023-11-29 04:27:22,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:27:22,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:27:22,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:22,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:27:22,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:27:22,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:22" (1/1) ... [2023-11-29 04:27:22,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d195c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:22, skipping insertion in model container [2023-11-29 04:27:22,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:22" (1/1) ... [2023-11-29 04:27:22,746 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:27:24,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:24,061 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:27:24,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d5d7ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:24, skipping insertion in model container [2023-11-29 04:27:24,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:24,062 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:27:24,064 INFO L158 Benchmark]: Toolchain (without parser) took 1408.27ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 80.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-29 04:27:24,065 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:27:24,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1405.79ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 80.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-29 04:27:24,067 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1405.79ms. Allocated memory is still 159.4MB. Free memory was 120.2MB in the beginning and 80.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2228]: 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_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/uname-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/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 64052bfdc5bf6f2a2ba50127e6f4ecf4f822ad11dffb4513d5356b1e12bd4cd0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:27:25,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:27:25,993 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-29 04:27:25,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:27:26,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:27:26,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:27:26,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:27:26,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:27:26,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:27:26,029 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:27:26,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:27:26,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:27:26,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:27:26,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:27:26,032 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:27:26,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:27:26,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:27:26,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:27:26,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:27:26,034 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:27:26,035 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:27:26,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:27:26,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:27:26,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:27:26,036 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:27:26,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:27:26,037 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:27:26,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:27:26,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:27:26,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:27:26,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:27:26,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:26,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:27:26,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:27:26,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:27:26,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:27:26,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:27:26,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:27:26,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:27:26,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:27:26,041 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:27:26,041 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_7d468e49-8008-494b-b141-9f401640aba3/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_7d468e49-8008-494b-b141-9f401640aba3/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 -> 64052bfdc5bf6f2a2ba50127e6f4ecf4f822ad11dffb4513d5356b1e12bd4cd0 [2023-11-29 04:27:26,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:27:26,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:27:26,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:27:26,366 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:27:26,366 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:27:26,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/uname-2.i [2023-11-29 04:27:29,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:27:29,722 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:27:29,722 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/sv-benchmarks/c/busybox-1.22.0/uname-2.i [2023-11-29 04:27:29,751 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/bc4c5ca5a/4aff8d63a8a24695a7194391ff2d8054/FLAGa269b8c31 [2023-11-29 04:27:29,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/data/bc4c5ca5a/4aff8d63a8a24695a7194391ff2d8054 [2023-11-29 04:27:29,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:27:29,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:27:29,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:29,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:27:29,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:27:29,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:29" (1/1) ... [2023-11-29 04:27:29,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fe7c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:29, skipping insertion in model container [2023-11-29 04:27:29,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:27:29" (1/1) ... [2023-11-29 04:27:29,870 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:27:31,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:31,159 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:27:31,178 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:27:31,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:31,317 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:27:31,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:27:31,661 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:27:31,661 WARN L675 CHandler]: The function strerror is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:27:31,661 WARN L675 CHandler]: The function putchar is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:27:31,662 WARN L675 CHandler]: The function strtoul is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:27:31,668 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:27:31,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31 WrapperNode [2023-11-29 04:27:31,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:27:31,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:31,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:27:31,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:27:31,675 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:27:31" (1/1) ... [2023-11-29 04:27:31,735 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:27:31" (1/1) ... [2023-11-29 04:27:31,840 INFO L138 Inliner]: procedures = 585, calls = 556, calls flagged for inlining = 24, calls inlined = 22, statements flattened = 1636 [2023-11-29 04:27:31,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:27:31,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:27:31,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:27:31,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:27:31,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,882 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-29 04:27:31,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:31,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:32,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:27:32,015 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:27:32,015 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:27:32,015 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:27:32,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (1/1) ... [2023-11-29 04:27:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:27:32,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:27:32,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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:27:32,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/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:27:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure putchar [2023-11-29 04:27:32,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:27:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-29 04:27:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-29 04:27:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-29 04:27:32,082 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2023-11-29 04:27:32,083 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2023-11-29 04:27:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:27:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-29 04:27:32,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:27:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 04:27:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-11-29 04:27:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-29 04:27:32,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-29 04:27:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-29 04:27:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:27:32,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:27:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-29 04:27:32,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-29 04:27:32,086 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-29 04:27:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2023-11-29 04:27:32,086 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2023-11-29 04:27:32,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-29 04:27:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-29 04:27:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-29 04:27:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-29 04:27:32,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-29 04:27:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-29 04:27:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:27:32,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:27:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:27:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 04:27:32,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2023-11-29 04:27:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-29 04:27:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-29 04:27:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 04:27:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2023-11-29 04:27:32,089 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-11-29 04:27:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2023-11-29 04:27:32,091 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2023-11-29 04:27:32,580 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:27:32,583 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:27:32,787 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:27:44,569 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:27:44,811 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:27:44,811 INFO L309 CfgBuilder]: Removed 33 assume(true) statements. [2023-11-29 04:27:44,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:44 BoogieIcfgContainer [2023-11-29 04:27:44,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:27:44,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:27:44,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:27:44,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:27:44,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:27:29" (1/3) ... [2023-11-29 04:27:44,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6dbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:44, skipping insertion in model container [2023-11-29 04:27:44,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:27:31" (2/3) ... [2023-11-29 04:27:44,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6dbac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:27:44, skipping insertion in model container [2023-11-29 04:27:44,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:27:44" (3/3) ... [2023-11-29 04:27:44,824 INFO L112 eAbstractionObserver]: Analyzing ICFG uname-2.i [2023-11-29 04:27:44,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:27:44,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 442 error locations. [2023-11-29 04:27:44,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:27:44,946 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;@9fed187, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:27:44,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 442 error locations. [2023-11-29 04:27:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 960 states, 489 states have (on average 2.263803680981595) internal successors, (1107), 930 states have internal predecessors, (1107), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:27:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:27:44,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:44,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:27:44,965 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 439 more)] === [2023-11-29 04:27:44,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:44,972 INFO L85 PathProgramCache]: Analyzing trace with hash 66003, now seen corresponding path program 1 times [2023-11-29 04:27:44,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413398286] [2023-11-29 04:27:44,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:44,991 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:27:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:44,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:45,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:45,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:27:45,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:45,567 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:27:45,589 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:27:45,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:45,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:45,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413398286] [2023-11-29 04:27:45,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413398286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:45,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:45,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:27:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70474578] [2023-11-29 04:27:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:45,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:27:45,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:27:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:27:45,638 INFO L87 Difference]: Start difference. First operand has 960 states, 489 states have (on average 2.263803680981595) internal successors, (1107), 930 states have internal predecessors, (1107), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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:27:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:49,940 INFO L93 Difference]: Finished difference Result 1106 states and 1288 transitions. [2023-11-29 04:27:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:27:49,943 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:27:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:49,960 INFO L225 Difference]: With dead ends: 1106 [2023-11-29 04:27:49,961 INFO L226 Difference]: Without dead ends: 1105 [2023-11-29 04:27:49,962 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:27:49,965 INFO L413 NwaCegarLoop]: 858 mSDtfsCounter, 367 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:49,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1379 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 04:27:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2023-11-29 04:27:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 950. [2023-11-29 04:27:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 485 states have (on average 2.179381443298969) internal successors, (1057), 924 states have internal predecessors, (1057), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:27:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1101 transitions. [2023-11-29 04:27:50,044 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1101 transitions. Word has length 2 [2023-11-29 04:27:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:50,044 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1101 transitions. [2023-11-29 04:27:50,045 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:27:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1101 transitions. [2023-11-29 04:27:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:27:50,045 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:50,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:27:50,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:50,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:50,252 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 439 more)] === [2023-11-29 04:27:50,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 66004, now seen corresponding path program 1 times [2023-11-29 04:27:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406393175] [2023-11-29 04:27:50,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:50,255 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:27:50,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:50,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:50,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:50,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:27:50,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:50,654 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:27:50,689 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:27:50,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:50,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:50,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406393175] [2023-11-29 04:27:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406393175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:50,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:50,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:27:50,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830472791] [2023-11-29 04:27:50,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:50,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:27:50,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:50,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:27:50,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:27:50,696 INFO L87 Difference]: Start difference. First operand 950 states and 1101 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:27:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:56,430 INFO L93 Difference]: Finished difference Result 949 states and 1100 transitions. [2023-11-29 04:27:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:27:56,432 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:27:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:56,438 INFO L225 Difference]: With dead ends: 949 [2023-11-29 04:27:56,438 INFO L226 Difference]: Without dead ends: 949 [2023-11-29 04:27:56,439 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:27:56,440 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 9 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1621 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-29 04:27:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-11-29 04:27:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 949. [2023-11-29 04:27:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 485 states have (on average 2.177319587628866) internal successors, (1056), 923 states have internal predecessors, (1056), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:27:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1100 transitions. [2023-11-29 04:27:56,484 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1100 transitions. Word has length 2 [2023-11-29 04:27:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:56,485 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1100 transitions. [2023-11-29 04:27:56,485 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:27:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1100 transitions. [2023-11-29 04:27:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 04:27:56,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:56,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 04:27:56,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:56,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:27:56,686 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 439 more)] === [2023-11-29 04:27:56,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:56,687 INFO L85 PathProgramCache]: Analyzing trace with hash 65038451, now seen corresponding path program 1 times [2023-11-29 04:27:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:56,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739629147] [2023-11-29 04:27:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:56,689 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:27:56,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:56,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:56,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:27:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:57,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:27:57,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:57,108 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:27:57,208 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:27:57,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:27:57,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:57,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739629147] [2023-11-29 04:27:57,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739629147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:27:57,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:27:57,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:27:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669957115] [2023-11-29 04:27:57,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:27:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:27:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:57,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:27:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:27:57,212 INFO L87 Difference]: Start difference. First operand 949 states and 1100 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:28:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:04,615 INFO L93 Difference]: Finished difference Result 951 states and 1102 transitions. [2023-11-29 04:28:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:28:04,615 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:28:04,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:04,621 INFO L225 Difference]: With dead ends: 951 [2023-11-29 04:28:04,622 INFO L226 Difference]: Without dead ends: 951 [2023-11-29 04:28:04,622 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:28:04,623 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 9 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:04,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2254 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 04:28:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-11-29 04:28:04,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2023-11-29 04:28:04,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 487 states have (on average 2.1724845995893225) internal successors, (1058), 925 states have internal predecessors, (1058), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:28:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1102 transitions. [2023-11-29 04:28:04,652 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1102 transitions. Word has length 4 [2023-11-29 04:28:04,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:04,653 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1102 transitions. [2023-11-29 04:28:04,653 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:28:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1102 transitions. [2023-11-29 04:28:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:28:04,654 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:04,654 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-29 04:28:04,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:04,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:04,860 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 439 more)] === [2023-11-29 04:28:04,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1920956149, now seen corresponding path program 1 times [2023-11-29 04:28:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767344661] [2023-11-29 04:28:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:04,862 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:28:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:04,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:04,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:05,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:28:05,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:05,277 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:28:05,459 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:28:05,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:06,129 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:28:06,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:06,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767344661] [2023-11-29 04:28:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767344661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:06,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-29 04:28:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747823625] [2023-11-29 04:28:06,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:28:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:06,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:28:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:28:06,131 INFO L87 Difference]: Start difference. First operand 951 states and 1102 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:28:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:33,390 INFO L93 Difference]: Finished difference Result 953 states and 1104 transitions. [2023-11-29 04:28:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:28:33,391 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:28:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:33,396 INFO L225 Difference]: With dead ends: 953 [2023-11-29 04:28:33,396 INFO L226 Difference]: Without dead ends: 953 [2023-11-29 04:28:33,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:28:33,397 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 19 mSDsluCounter, 1902 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2888 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 27.0s Time] [2023-11-29 04:28:33,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2023-11-29 04:28:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2023-11-29 04:28:33,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 490 states have (on average 2.163265306122449) internal successors, (1060), 927 states have internal predecessors, (1060), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:28:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1104 transitions. [2023-11-29 04:28:33,418 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1104 transitions. Word has length 6 [2023-11-29 04:28:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:33,419 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1104 transitions. [2023-11-29 04:28:33,419 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:28:33,419 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1104 transitions. [2023-11-29 04:28:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:28:33,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:33,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-29 04:28:33,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:33,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:33,621 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 439 more)] === [2023-11-29 04:28:33,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:33,622 INFO L85 PathProgramCache]: Analyzing trace with hash -594146775, now seen corresponding path program 1 times [2023-11-29 04:28:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413974601] [2023-11-29 04:28:33,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:33,623 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:28:33,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:33,624 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:33,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:33,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:28:33,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:34,086 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:28:34,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:34,272 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:28:34,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:34,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413974601] [2023-11-29 04:28:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413974601] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:34,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:34,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 04:28:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457872601] [2023-11-29 04:28:34,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:34,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:28:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:34,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:28:34,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:28:34,274 INFO L87 Difference]: Start difference. First operand 953 states and 1104 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:28:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:38,839 INFO L93 Difference]: Finished difference Result 963 states and 1114 transitions. [2023-11-29 04:28:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:28:38,840 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:28:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:38,846 INFO L225 Difference]: With dead ends: 963 [2023-11-29 04:28:38,846 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 04:28:38,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:28:38,847 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 5 mSDsluCounter, 4940 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5930 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:38,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5930 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 04:28:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 04:28:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2023-11-29 04:28:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 500 states have (on average 2.14) internal successors, (1070), 937 states have internal predecessors, (1070), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:28:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1114 transitions. [2023-11-29 04:28:38,874 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1114 transitions. Word has length 11 [2023-11-29 04:28:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:38,875 INFO L495 AbstractCegarLoop]: Abstraction has 963 states and 1114 transitions. [2023-11-29 04:28:38,875 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:28:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1114 transitions. [2023-11-29 04:28:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:28:38,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:38,876 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:28:38,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:39,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:39,077 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 439 more)] === [2023-11-29 04:28:39,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:39,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1427841999, now seen corresponding path program 2 times [2023-11-29 04:28:39,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:39,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129953449] [2023-11-29 04:28:39,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:28:39,078 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:28:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:39,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:39,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:40,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:28:40,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:28:40,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:28:40,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:40,348 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:28:40,348 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:28:40,806 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:28:40,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:28:40,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129953449] [2023-11-29 04:28:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129953449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:28:40,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:28:40,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:28:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534125657] [2023-11-29 04:28:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:28:40,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:28:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:40,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:28:40,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:28:40,808 INFO L87 Difference]: Start difference. First operand 963 states and 1114 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:28:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:49,793 INFO L93 Difference]: Finished difference Result 1317 states and 1528 transitions. [2023-11-29 04:28:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:28:49,793 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:28:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:49,802 INFO L225 Difference]: With dead ends: 1317 [2023-11-29 04:28:49,802 INFO L226 Difference]: Without dead ends: 1317 [2023-11-29 04:28:49,802 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:28:49,803 INFO L413 NwaCegarLoop]: 888 mSDtfsCounter, 586 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:49,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1411 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-11-29 04:28:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2023-11-29 04:28:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1143. [2023-11-29 04:28:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 670 states have (on average 2.156716417910448) internal successors, (1445), 1106 states have internal predecessors, (1445), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:28:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1504 transitions. [2023-11-29 04:28:49,838 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1504 transitions. Word has length 21 [2023-11-29 04:28:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:49,838 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 1504 transitions. [2023-11-29 04:28:49,839 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:28:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1504 transitions. [2023-11-29 04:28:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:28:49,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:49,840 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 04:28:49,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:50,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:50,040 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 439 more)] === [2023-11-29 04:28:50,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1427841998, now seen corresponding path program 1 times [2023-11-29 04:28:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:50,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136796319] [2023-11-29 04:28:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:50,042 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:28:50,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:50,043 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:50,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:50,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:28:50,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:50,797 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:28:50,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:51,364 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:28:51,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136796319] [2023-11-29 04:28:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136796319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:28:51,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:28:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 04:28:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532327204] [2023-11-29 04:28:51,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:28:51,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 04:28:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:28:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 04:28:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:28:51,367 INFO L87 Difference]: Start difference. First operand 1143 states and 1504 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:28:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:58,698 INFO L93 Difference]: Finished difference Result 1147 states and 1508 transitions. [2023-11-29 04:28:58,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:28:58,699 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:28:58,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:58,706 INFO L225 Difference]: With dead ends: 1147 [2023-11-29 04:28:58,707 INFO L226 Difference]: Without dead ends: 1147 [2023-11-29 04:28:58,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 04:28:58,708 INFO L413 NwaCegarLoop]: 989 mSDtfsCounter, 3 mSDsluCounter, 8883 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9872 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:58,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9872 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-29 04:28:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2023-11-29 04:28:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2023-11-29 04:28:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 674 states have (on average 2.149851632047478) internal successors, (1449), 1110 states have internal predecessors, (1449), 32 states have call successors, (32), 12 states have call predecessors, (32), 9 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:28:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1508 transitions. [2023-11-29 04:28:58,734 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1508 transitions. Word has length 21 [2023-11-29 04:28:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:58,735 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 1508 transitions. [2023-11-29 04:28:58,735 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:28:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1508 transitions. [2023-11-29 04:28:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:28:58,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:58,736 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-29 04:28:58,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:28:58,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:28:58,936 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 439 more)] === [2023-11-29 04:28:58,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash 493496066, now seen corresponding path program 2 times [2023-11-29 04:28:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409711663] [2023-11-29 04:28:58,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:28:58,938 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:28:58,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:58,939 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:28:58,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:00,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:29:00,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:29:00,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:29:00,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:00,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:00,216 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:29:00,690 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:29:00,690 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:00,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:00,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409711663] [2023-11-29 04:29:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409711663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:29:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079171266] [2023-11-29 04:29:00,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:00,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:29:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:00,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:29:00,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:29:00,692 INFO L87 Difference]: Start difference. First operand 1147 states and 1508 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:29:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:06,599 INFO L93 Difference]: Finished difference Result 1150 states and 1510 transitions. [2023-11-29 04:29:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:29:06,600 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:29:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:06,606 INFO L225 Difference]: With dead ends: 1150 [2023-11-29 04:29:06,606 INFO L226 Difference]: Without dead ends: 1150 [2023-11-29 04:29:06,607 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:29:06,607 INFO L413 NwaCegarLoop]: 988 mSDtfsCounter, 6 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:06,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1627 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 04:29:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-11-29 04:29:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2023-11-29 04:29:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 677 states have (on average 2.1432791728212703) internal successors, (1451), 1112 states have internal predecessors, (1451), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:29:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1510 transitions. [2023-11-29 04:29:06,647 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1510 transitions. Word has length 25 [2023-11-29 04:29:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:06,648 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 1510 transitions. [2023-11-29 04:29:06,648 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:29:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1510 transitions. [2023-11-29 04:29:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:29:06,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:06,649 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:29:06,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:29:06,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:06,850 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 439 more)] === [2023-11-29 04:29:06,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -287800028, now seen corresponding path program 1 times [2023-11-29 04:29:06,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:06,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401452002] [2023-11-29 04:29:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:06,851 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:29:06,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:06,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:06,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:08,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:29:08,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:08,461 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:29:08,461 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:29:08,501 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:29:08,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:08,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401452002] [2023-11-29 04:29:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401452002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:29:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351776750] [2023-11-29 04:29:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:08,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:29:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:29:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:29:08,504 INFO L87 Difference]: Start difference. First operand 1150 states and 1510 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:29:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:16,967 INFO L93 Difference]: Finished difference Result 1223 states and 1511 transitions. [2023-11-29 04:29:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:29:16,968 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:29:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:16,974 INFO L225 Difference]: With dead ends: 1223 [2023-11-29 04:29:16,974 INFO L226 Difference]: Without dead ends: 1223 [2023-11-29 04:29:16,974 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:29:16,975 INFO L413 NwaCegarLoop]: 854 mSDtfsCounter, 352 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:16,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1380 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 04:29:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2023-11-29 04:29:16,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1145. [2023-11-29 04:29:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 677 states have (on average 2.13589364844904) internal successors, (1446), 1107 states have internal predecessors, (1446), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:29:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1505 transitions. [2023-11-29 04:29:17,003 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1505 transitions. Word has length 32 [2023-11-29 04:29:17,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:17,004 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1505 transitions. [2023-11-29 04:29:17,004 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:29:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1505 transitions. [2023-11-29 04:29:17,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:29:17,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:17,005 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:29:17,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:17,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:17,206 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 439 more)] === [2023-11-29 04:29:17,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash -287800027, now seen corresponding path program 1 times [2023-11-29 04:29:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37177272] [2023-11-29 04:29:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:17,207 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:29:17,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:17,208 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:17,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:18,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:29:18,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:18,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:18,937 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:29:18,959 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:29:19,028 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:29:19,028 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:19,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37177272] [2023-11-29 04:29:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37177272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:19,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:29:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995628137] [2023-11-29 04:29:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:19,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:29:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:29:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:29:19,030 INFO L87 Difference]: Start difference. First operand 1145 states and 1505 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:29:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:26,078 INFO L93 Difference]: Finished difference Result 1146 states and 1507 transitions. [2023-11-29 04:29:26,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:29:26,079 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:29:26,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:26,086 INFO L225 Difference]: With dead ends: 1146 [2023-11-29 04:29:26,086 INFO L226 Difference]: Without dead ends: 1146 [2023-11-29 04:29:26,086 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:29:26,087 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 819 mSDsluCounter, 2620 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:26,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 3592 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-29 04:29:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2023-11-29 04:29:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2023-11-29 04:29:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 677 states have (on average 2.1344165435745936) internal successors, (1445), 1106 states have internal predecessors, (1445), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:29:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1504 transitions. [2023-11-29 04:29:26,122 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1504 transitions. Word has length 32 [2023-11-29 04:29:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:26,122 INFO L495 AbstractCegarLoop]: Abstraction has 1144 states and 1504 transitions. [2023-11-29 04:29:26,122 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:29:26,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1504 transitions. [2023-11-29 04:29:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 04:29:26,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:26,124 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:29:26,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:26,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:26,328 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 439 more)] === [2023-11-29 04:29:26,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1696318149, now seen corresponding path program 1 times [2023-11-29 04:29:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312673380] [2023-11-29 04:29:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:26,330 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:29:26,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:26,331 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:26,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:28,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:29:28,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:28,164 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:29:28,165 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:29:28,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:28,636 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 04:29:28,637 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:29:28,697 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:29:28,697 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:29:28,920 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:29:28,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:28,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312673380] [2023-11-29 04:29:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312673380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:29:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501189689] [2023-11-29 04:29:28,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:28,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:29:28,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:28,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:29:28,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:29:28,922 INFO L87 Difference]: Start difference. First operand 1144 states and 1504 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:29:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:49,250 INFO L93 Difference]: Finished difference Result 1162 states and 1524 transitions. [2023-11-29 04:29:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:29:49,251 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:29:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:49,256 INFO L225 Difference]: With dead ends: 1162 [2023-11-29 04:29:49,256 INFO L226 Difference]: Without dead ends: 1162 [2023-11-29 04:29:49,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:29:49,256 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 867 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:49,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 4363 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2023-11-29 04:29:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-11-29 04:29:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1153. [2023-11-29 04:29:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 686 states have (on average 2.129737609329446) internal successors, (1461), 1115 states have internal predecessors, (1461), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:29:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1520 transitions. [2023-11-29 04:29:49,281 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1520 transitions. Word has length 34 [2023-11-29 04:29:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:49,282 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1520 transitions. [2023-11-29 04:29:49,282 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:29:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1520 transitions. [2023-11-29 04:29:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:29:49,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:49,283 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:29:49,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:29:49,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:49,488 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 439 more)] === [2023-11-29 04:29:49,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1927423657, now seen corresponding path program 1 times [2023-11-29 04:29:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:49,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644577764] [2023-11-29 04:29:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:49,490 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:29:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:49,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:49,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:51,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:29:51,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:51,216 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:29:51,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:51,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 1 [2023-11-29 04:29:51,290 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:29:51,291 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:29:51,334 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:29:51,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:51,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:51,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644577764] [2023-11-29 04:29:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644577764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:51,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:29:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741067154] [2023-11-29 04:29:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:51,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:29:51,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:51,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:29:51,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:29:51,336 INFO L87 Difference]: Start difference. First operand 1153 states and 1520 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:29:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:29:55,544 INFO L93 Difference]: Finished difference Result 1230 states and 1524 transitions. [2023-11-29 04:29:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:29:55,544 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:29:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:29:55,550 INFO L225 Difference]: With dead ends: 1230 [2023-11-29 04:29:55,550 INFO L226 Difference]: Without dead ends: 1230 [2023-11-29 04:29:55,550 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:29:55,551 INFO L413 NwaCegarLoop]: 856 mSDtfsCounter, 352 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:29:55,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1377 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 04:29:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2023-11-29 04:29:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1152. [2023-11-29 04:29:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 686 states have (on average 2.126822157434402) internal successors, (1459), 1114 states have internal predecessors, (1459), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:29:55,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1518 transitions. [2023-11-29 04:29:55,576 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1518 transitions. Word has length 36 [2023-11-29 04:29:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:29:55,576 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1518 transitions. [2023-11-29 04:29:55,577 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:29:55,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1518 transitions. [2023-11-29 04:29:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 04:29:55,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:29:55,578 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:29:55,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:55,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:29:55,795 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 439 more)] === [2023-11-29 04:29:55,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:29:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1927423658, now seen corresponding path program 1 times [2023-11-29 04:29:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:29:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398072778] [2023-11-29 04:29:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:29:55,797 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:29:55,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:29:55,798 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:55,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:29:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:29:57,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:29:57,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:29:57,646 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:29:57,679 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:29:57,691 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:29:57,704 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:29:58,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:29:58,073 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:29:58,123 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:29:58,123 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:29:58,318 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:29:58,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:29:58,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:29:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398072778] [2023-11-29 04:29:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398072778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:29:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:29:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:29:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078621504] [2023-11-29 04:29:58,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:29:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:29:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:29:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:29:58,320 INFO L87 Difference]: Start difference. First operand 1152 states and 1518 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:30:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:30:25,941 INFO L93 Difference]: Finished difference Result 1235 states and 1524 transitions. [2023-11-29 04:30:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:30:25,942 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:30:25,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:30:25,946 INFO L225 Difference]: With dead ends: 1235 [2023-11-29 04:30:25,946 INFO L226 Difference]: Without dead ends: 1235 [2023-11-29 04:30:25,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:30:25,947 INFO L413 NwaCegarLoop]: 771 mSDtfsCounter, 1390 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 2360 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:30:25,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 3532 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2360 Invalid, 0 Unknown, 0 Unchecked, 27.3s Time] [2023-11-29 04:30:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-29 04:30:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1152. [2023-11-29 04:30:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 686 states have (on average 2.1253644314868803) internal successors, (1458), 1114 states have internal predecessors, (1458), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:30:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1517 transitions. [2023-11-29 04:30:25,969 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1517 transitions. Word has length 36 [2023-11-29 04:30:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:30:25,969 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 1517 transitions. [2023-11-29 04:30:25,970 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:30:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1517 transitions. [2023-11-29 04:30:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:30:25,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:30:25,970 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:30:25,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:26,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:30:26,171 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 439 more)] === [2023-11-29 04:30:26,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:30:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1124818547, now seen corresponding path program 1 times [2023-11-29 04:30:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:30:26,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275852668] [2023-11-29 04:30:26,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:30:26,173 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:30:26,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:30:26,173 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:26,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:30:27,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:30:27,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:30:27,890 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:30:27,958 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:30:28,137 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 04:30:28,138 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:30:28,230 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:30:28,230 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:30:28,268 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:30:28,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:30:28,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:30:28,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275852668] [2023-11-29 04:30:28,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275852668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:30:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:30:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:30:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795020941] [2023-11-29 04:30:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:30:28,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:30:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:30:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:30:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:30:28,269 INFO L87 Difference]: Start difference. First operand 1152 states and 1517 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:30:43,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:30:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:30:47,860 INFO L93 Difference]: Finished difference Result 1149 states and 1513 transitions. [2023-11-29 04:30:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:30:47,861 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:30:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:30:47,866 INFO L225 Difference]: With dead ends: 1149 [2023-11-29 04:30:47,866 INFO L226 Difference]: Without dead ends: 1149 [2023-11-29 04:30:47,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:30:47,866 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 810 mSDsluCounter, 2920 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:30:47,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 3886 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2347 Invalid, 1 Unknown, 0 Unchecked, 19.5s Time] [2023-11-29 04:30:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-11-29 04:30:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2023-11-29 04:30:47,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 686 states have (on average 2.119533527696793) internal successors, (1454), 1111 states have internal predecessors, (1454), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:30:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1513 transitions. [2023-11-29 04:30:47,882 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1513 transitions. Word has length 38 [2023-11-29 04:30:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:30:47,883 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1513 transitions. [2023-11-29 04:30:47,883 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:30:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1513 transitions. [2023-11-29 04:30:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:30:47,884 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:30:47,884 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:30:47,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:48,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:30:48,085 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 439 more)] === [2023-11-29 04:30:48,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:30:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1124818548, now seen corresponding path program 1 times [2023-11-29 04:30:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:30:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783140787] [2023-11-29 04:30:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:30:48,086 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:30:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:30:48,087 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:48,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:30:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:30:49,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:30:49,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:30:49,754 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:30:49,805 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:30:49,878 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:30:49,900 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:30:50,001 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:30:50,009 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:30:50,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-11-29 04:30:50,138 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:30:50,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:30:50,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:30:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783140787] [2023-11-29 04:30:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783140787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:30:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:30:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:30:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391949825] [2023-11-29 04:30:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:30:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:30:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:30:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:30:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:30:50,139 INFO L87 Difference]: Start difference. First operand 1149 states and 1513 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:31:02,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:31:06,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:31:10,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:10,305 INFO L93 Difference]: Finished difference Result 1148 states and 1511 transitions. [2023-11-29 04:31:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:31:10,306 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:31:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:10,312 INFO L225 Difference]: With dead ends: 1148 [2023-11-29 04:31:10,312 INFO L226 Difference]: Without dead ends: 1148 [2023-11-29 04:31:10,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:31:10,313 INFO L413 NwaCegarLoop]: 959 mSDtfsCounter, 806 mSDsluCounter, 2086 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:10,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 3045 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1554 Invalid, 2 Unknown, 0 Unchecked, 20.0s Time] [2023-11-29 04:31:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2023-11-29 04:31:10,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2023-11-29 04:31:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 686 states have (on average 2.116618075801749) internal successors, (1452), 1110 states have internal predecessors, (1452), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:31:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1511 transitions. [2023-11-29 04:31:10,329 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1511 transitions. Word has length 38 [2023-11-29 04:31:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:10,329 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 1511 transitions. [2023-11-29 04:31:10,329 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:31:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1511 transitions. [2023-11-29 04:31:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:31:10,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:10,330 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:31:10,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:10,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:31:10,531 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 439 more)] === [2023-11-29 04:31:10,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 183627281, now seen corresponding path program 1 times [2023-11-29 04:31:10,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:31:10,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430398674] [2023-11-29 04:31:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:10,532 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:31:10,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:31:10,533 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:10,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:12,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:31:12,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:12,204 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:31:12,341 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:31:12,342 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:31:12,434 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:31:12,590 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:31:12,850 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:31:12,850 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:31:12,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-29 04:31:13,066 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:31:13,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:31:13,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430398674] [2023-11-29 04:31:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430398674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:31:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715051918] [2023-11-29 04:31:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:31:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:31:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:31:13,068 INFO L87 Difference]: Start difference. First operand 1148 states and 1511 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:31:29,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:31:33,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:31:38,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:38,025 INFO L93 Difference]: Finished difference Result 1235 states and 1529 transitions. [2023-11-29 04:31:38,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:31:38,026 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:31:38,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:38,032 INFO L225 Difference]: With dead ends: 1235 [2023-11-29 04:31:38,033 INFO L226 Difference]: Without dead ends: 1235 [2023-11-29 04:31:38,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:31:38,033 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 1010 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:38,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2969 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1826 Invalid, 2 Unknown, 0 Unchecked, 24.7s Time] [2023-11-29 04:31:38,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-29 04:31:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1154. [2023-11-29 04:31:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 692 states have (on average 2.1141618497109826) internal successors, (1463), 1116 states have internal predecessors, (1463), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:31:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1522 transitions. [2023-11-29 04:31:38,049 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1522 transitions. Word has length 41 [2023-11-29 04:31:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:38,049 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1522 transitions. [2023-11-29 04:31:38,049 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:31:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1522 transitions. [2023-11-29 04:31:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 04:31:38,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:38,050 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:31:38,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:31:38,251 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 439 more)] === [2023-11-29 04:31:38,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash 183627282, now seen corresponding path program 1 times [2023-11-29 04:31:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:31:38,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306942854] [2023-11-29 04:31:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:38,252 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:31:38,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:31:38,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:38,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:31:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:39,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 04:31:39,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:39,973 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:31:40,068 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:31:40,069 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:31:40,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:31:40,188 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:31:40,227 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:31:40,404 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:31:40,445 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:31:40,707 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:31:40,708 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:31:40,734 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:31:40,927 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:31:40,945 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:31:41,016 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:31:41,017 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:31:41,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:41,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306942854] [2023-11-29 04:31:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306942854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:31:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:31:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:31:41,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235489069] [2023-11-29 04:31:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:31:41,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:31:41,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:41,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:31:41,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:31:41,019 INFO L87 Difference]: Start difference. First operand 1154 states and 1522 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:32:02,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:32:06,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:32:10,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:32:14,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:32:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:22,011 INFO L93 Difference]: Finished difference Result 1233 states and 1524 transitions. [2023-11-29 04:32:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:32:22,012 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:32:22,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:22,017 INFO L225 Difference]: With dead ends: 1233 [2023-11-29 04:32:22,017 INFO L226 Difference]: Without dead ends: 1233 [2023-11-29 04:32:22,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:32:22,018 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 1344 mSDsluCounter, 3120 mSDsCounter, 0 mSdLazyCounter, 3192 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3192 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:32:22,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 3958 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3192 Invalid, 4 Unknown, 0 Unchecked, 40.4s Time] [2023-11-29 04:32:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2023-11-29 04:32:22,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1154. [2023-11-29 04:32:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 692 states have (on average 2.1083815028901736) internal successors, (1459), 1116 states have internal predecessors, (1459), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:32:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1518 transitions. [2023-11-29 04:32:22,036 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1518 transitions. Word has length 41 [2023-11-29 04:32:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:22,036 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1518 transitions. [2023-11-29 04:32:22,036 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:32:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1518 transitions. [2023-11-29 04:32:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:32:22,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:22,036 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:32:22,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32:22,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:32:22,237 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 439 more)] === [2023-11-29 04:32:22,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1299227329, now seen corresponding path program 1 times [2023-11-29 04:32:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:32:22,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484386996] [2023-11-29 04:32:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:22,239 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:32:22,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:32:22,240 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32:22,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:32:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:24,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:32:24,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:24,394 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:32:24,542 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:32:24,542 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:32:24,647 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:32:24,817 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:32:25,108 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:32:25,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-29 04:32:25,373 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:32:25,373 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:32:25,447 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:32:25,611 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:32:25,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:30,107 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 (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~11#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_1351) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:32:30,166 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1350 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1350))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1351)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:32:30,211 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1350 (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~11#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_1350))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1351)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:32:30,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:32:30,588 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:32:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3087 treesize of output 2376 [2023-11-29 04:32:30,651 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 248 [2023-11-29 04:32:30,671 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 144 treesize of output 102 [2023-11-29 04:32:30,682 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 206 treesize of output 136 [2023-11-29 04:32:36,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:32:36,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 135 treesize of output 565 [2023-11-29 04:32:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2023-11-29 04:32:46,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:32:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484386996] [2023-11-29 04:32:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484386996] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:32:46,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:32:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-29 04:32:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700422545] [2023-11-29 04:32:46,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:32:46,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:32:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:32:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:32:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=187, Unknown=9, NotChecked=90, Total=342 [2023-11-29 04:32:46,394 INFO L87 Difference]: Start difference. First operand 1154 states and 1518 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:33:18,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:33:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:33:26,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:33:30,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:33:34,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:33:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:46,735 INFO L93 Difference]: Finished difference Result 1231 states and 1522 transitions. [2023-11-29 04:33:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:33:46,736 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:33:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:46,742 INFO L225 Difference]: With dead ends: 1231 [2023-11-29 04:33:46,743 INFO L226 Difference]: Without dead ends: 1231 [2023-11-29 04:33:46,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=79, Invalid=230, Unknown=9, NotChecked=102, Total=420 [2023-11-29 04:33:46,743 INFO L413 NwaCegarLoop]: 838 mSDtfsCounter, 1703 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 4087 mSolverCounterSat, 18 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 6186 SdHoareTripleChecker+Invalid, 7466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4087 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 3356 IncrementalHoareTripleChecker+Unchecked, 59.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:46,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 6186 Invalid, 7466 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 4087 Invalid, 5 Unknown, 3356 Unchecked, 59.8s Time] [2023-11-29 04:33:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2023-11-29 04:33:46,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1153. [2023-11-29 04:33:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 692 states have (on average 2.1054913294797686) internal successors, (1457), 1115 states have internal predecessors, (1457), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:33:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1516 transitions. [2023-11-29 04:33:46,762 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1516 transitions. Word has length 44 [2023-11-29 04:33:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:46,762 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1516 transitions. [2023-11-29 04:33:46,763 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:33:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1516 transitions. [2023-11-29 04:33:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 04:33:46,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:46,763 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:33:46,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:33:46,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:33:46,964 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 439 more)] === [2023-11-29 04:33:46,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1299227328, now seen corresponding path program 1 times [2023-11-29 04:33:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859308464] [2023-11-29 04:33:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:46,966 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:33:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:46,967 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:33:46,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:33:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:49,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 04:33:49,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:49,350 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:33:49,462 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:33:49,515 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:33:49,515 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:33:49,638 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:33:49,668 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:33:49,858 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:33:49,897 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:33:50,219 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:33:50,219 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:33:50,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 16 [2023-11-29 04:33:50,766 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:33:50,766 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:33:50,793 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:33:51,032 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:33:51,051 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:33:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-29 04:33:51,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:33:52,264 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:33:52,449 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#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_1483 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:33:52,677 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1481))) (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~mem278#1.base| v_ArrVal_1480) .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1483) |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:33:54,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1481) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1481))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1480) .cse4 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-29 04:33:54,748 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1479 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1478))) (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_~mem_track~0#1.base| v_ArrVal_1479) .cse2 v_ArrVal_1480) (select (select (store .cse3 .cse2 v_ArrVal_1481) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1483))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1479 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1480 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1482 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1478))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1481))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (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_1479) .cse5 v_ArrVal_1480) .cse6 v_ArrVal_1483) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1482) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 04:33:54,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:33:54,882 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 227 treesize of output 228 [2023-11-29 04:33:54,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:33:54,922 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 214 treesize of output 137 [2023-11-29 04:33:54,948 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 11479 treesize of output 9436 [2023-11-29 04:33:55,034 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 16221 treesize of output 15744 [2023-11-29 04:33:55,103 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 384 treesize of output 342 [2023-11-29 04:33:55,115 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 730 treesize of output 702 [2023-11-29 04:33:55,126 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 702 treesize of output 520 [2023-11-29 04:33:55,139 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 520 treesize of output 464 [2023-11-29 04:33:55,151 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 464 treesize of output 380 [2023-11-29 04:33:55,163 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 380 treesize of output 366 [2023-11-29 04:33:59,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:33:59,485 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:33:59,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:33:59,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-29 04:33:59,573 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:33:59,616 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 1807 treesize of output 1672 [2023-11-29 04:33:59,639 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:33:59,657 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:33:59,675 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:33:59,754 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:33:59,822 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:34:00,922 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:34:00,923 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:34:00,929 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:34:00,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:34:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859308464] [2023-11-29 04:34:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859308464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:34:00,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:34:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2023-11-29 04:34:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509330812] [2023-11-29 04:34:00,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:34:00,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:34:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:34:00,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:34:00,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2023-11-29 04:34:00,931 INFO L87 Difference]: Start difference. First operand 1153 states and 1516 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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:34:53,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:34:57,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:35:01,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:35:05,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:35:09,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:35:13,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:35:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:35:30,553 INFO L93 Difference]: Finished difference Result 1239 states and 1529 transitions. [2023-11-29 04:35:30,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:35:30,554 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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:35:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:35:30,560 INFO L225 Difference]: With dead ends: 1239 [2023-11-29 04:35:30,560 INFO L226 Difference]: Without dead ends: 1239 [2023-11-29 04:35:30,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=126, Invalid=441, Unknown=5, NotChecked=240, Total=812 [2023-11-29 04:35:30,561 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 1718 mSDsluCounter, 6504 mSDsCounter, 0 mSdLazyCounter, 5228 mSolverCounterSat, 18 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1730 SdHoareTripleChecker+Valid, 7341 SdHoareTripleChecker+Invalid, 10845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5228 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 5593 IncrementalHoareTripleChecker+Unchecked, 87.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:35:30,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1730 Valid, 7341 Invalid, 10845 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 5228 Invalid, 6 Unknown, 5593 Unchecked, 87.1s Time] [2023-11-29 04:35:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2023-11-29 04:35:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1159. [2023-11-29 04:35:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 698 states have (on average 2.097421203438395) internal successors, (1464), 1121 states have internal predecessors, (1464), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:35:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1523 transitions. [2023-11-29 04:35:30,579 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1523 transitions. Word has length 44 [2023-11-29 04:35:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:35:30,579 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1523 transitions. [2023-11-29 04:35:30,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 22 states have internal predecessors, (40), 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:35:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1523 transitions. [2023-11-29 04:35:30,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 04:35:30,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:35:30,580 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:35:30,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:30,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:35:30,781 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 439 more)] === [2023-11-29 04:35:30,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:35:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1012692818, now seen corresponding path program 2 times [2023-11-29 04:35:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:35:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137201548] [2023-11-29 04:35:30,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:35:30,782 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:35:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:35:30,784 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:30,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:35:38,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:35:38,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:35:38,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 04:35:38,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:35:38,200 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:35:38,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:35:38,386 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:35:38,387 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:35:38,523 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:35:38,541 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:35:38,765 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:35:38,814 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:35:39,170 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:35:39,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:35:39,202 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:35:39,711 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:35:39,712 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:35:39,740 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:35:40,311 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:35:40,311 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:35:40,353 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:35:40,632 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:35:40,652 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:35:40,780 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:35:40,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:35:42,027 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1622) |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~mem280#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1622) |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:35:42,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#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_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:35:42,450 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1620))) (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~mem280#1.base| v_ArrVal_1621) .cse1 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1621) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1622) |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:35:46,411 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1619))) (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~mem278#1.base| v_ArrVal_1618) .cse2 v_ArrVal_1621) (select (select (store .cse3 .cse2 v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1622))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1619))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1620))) (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~mem278#1.base| v_ArrVal_1618) .cse5 v_ArrVal_1621) .cse6 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 04:35:49,736 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1619))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_1620))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1618) .cse2 v_ArrVal_1621) .cse3 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1619))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1618) .cse8 v_ArrVal_1621) (select (select (store .cse9 .cse8 v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1622))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse7) (bvadd (_ bv1 64) .cse0 .cse7))))))) is different from false [2023-11-29 04:35:53,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1617))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1619))) (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_~mem_track~0#1.base| v_ArrVal_1616) .cse2 v_ArrVal_1618) .cse3 v_ArrVal_1621) (select (select (store .cse4 .cse3 v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1622))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1619 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1618 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1617))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1619))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1620))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1616) .cse7 v_ArrVal_1618) .cse8 v_ArrVal_1621) .cse9 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-29 04:35:54,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:35:54,132 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:35:54,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:35:54,172 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:35:54,193 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 8683 treesize of output 7216 [2023-11-29 04:35:54,246 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 49055 treesize of output 47390 [2023-11-29 04:35:54,287 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 318 treesize of output 290 [2023-11-29 04:35:54,297 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 290 treesize of output 262 [2023-11-29 04:35:54,307 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 234 [2023-11-29 04:35:54,317 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 234 treesize of output 206 [2023-11-29 04:35:54,327 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 206 treesize of output 178 [2023-11-29 04:35:54,436 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 102 treesize of output 88 [2023-11-29 04:35:54,565 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 88 treesize of output 74 [2023-11-29 04:35:55,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:35:55,282 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 451 treesize of output 452 [2023-11-29 04:35:55,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:35:55,333 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 438 treesize of output 257 [2023-11-29 04:35:55,346 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:35:55,367 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 14987 treesize of output 10784 [2023-11-29 04:35:55,404 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:35:55,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:35:55,415 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:35:56,499 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 04:35:56,500 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:35:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 7 not checked. [2023-11-29 04:35:56,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:35:56,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137201548] [2023-11-29 04:35:56,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137201548] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:35:56,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:35:56,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2023-11-29 04:35:56,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352509038] [2023-11-29 04:35:56,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:35:56,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 04:35:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:35:56,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 04:35:56,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=353, Unknown=14, NotChecked=258, Total=702 [2023-11-29 04:35:56,510 INFO L87 Difference]: Start difference. First operand 1159 states and 1523 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:36:09,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse1 ((_ sign_extend 32) |c_ULTIMATE.start_main_~j~0#1|))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_#t~mem280#1.offset| .cse1 (_ bv1 64))) (.cse11 (bvadd .cse10 .cse1 (_ bv1 64))) (.cse2 (select |c_#length| .cse8)) (.cse3 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse7 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (and (bvule .cse0 (select |c_#length| |c_ULTIMATE.start_main_#t~mem280#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|))) (bvule (bvadd |c_ULTIMATE.start_main_#t~mem280#1.offset| .cse1) .cse0) (= .cse2 (_ bv11 64)) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1620))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse3 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1621) .cse4 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse7) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| .cse8)) (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1621) (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse3 .cse9) (bvadd .cse3 (_ bv1 64) .cse9)))) (bvule (bvadd .cse10 .cse1) .cse11) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1620))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse3 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1621) .cse12 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))) (bvule .cse11 .cse2) (= (_ bv0 64) .cse10) (forall ((v_ArrVal_1620 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1621 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1621) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse3 .cse14) (bvadd .cse3 (_ bv1 64) .cse14)))) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (forall ((v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse15 .cse7) (bvadd .cse15 (_ bv1 64) .cse7)))))))) is different from false [2023-11-29 04:36:10,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (.cse5 ((_ sign_extend 32) |c_ULTIMATE.start_main_~j~0#1|))) (let ((.cse6 (bvadd .cse4 .cse5 (_ bv1 64))) (.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_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (bvule (bvadd .cse4 .cse5) .cse6) (bvule .cse6 (select |c_#length| .cse2)) (forall ((v_ArrVal_1623 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1622 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1622) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1623) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) is different from false [2023-11-29 04:37:26,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:30,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:34,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:38,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:42,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:46,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:51,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:37:55,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:37:59,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:38:03,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 04:38:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:27,157 INFO L93 Difference]: Finished difference Result 1172 states and 1538 transitions. [2023-11-29 04:38:27,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:38:27,158 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:38:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:27,164 INFO L225 Difference]: With dead ends: 1172 [2023-11-29 04:38:27,165 INFO L226 Difference]: Without dead ends: 1172 [2023-11-29 04:38:27,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=207, Invalid=857, Unknown=24, NotChecked=552, Total=1640 [2023-11-29 04:38:27,166 INFO L413 NwaCegarLoop]: 971 mSDtfsCounter, 48 mSDsluCounter, 13470 mSDsCounter, 0 mSdLazyCounter, 5664 mSolverCounterSat, 12 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 14441 SdHoareTripleChecker+Invalid, 8702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5664 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 3014 IncrementalHoareTripleChecker+Unchecked, 134.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:27,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 14441 Invalid, 8702 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 5664 Invalid, 12 Unknown, 3014 Unchecked, 134.0s Time] [2023-11-29 04:38:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2023-11-29 04:38:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1171. [2023-11-29 04:38:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 710 states have (on average 2.0816901408450703) internal successors, (1478), 1133 states have internal predecessors, (1478), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:38:27,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1537 transitions. [2023-11-29 04:38:27,187 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1537 transitions. Word has length 47 [2023-11-29 04:38:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:27,187 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1537 transitions. [2023-11-29 04:38:27,188 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:38:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1537 transitions. [2023-11-29 04:38:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:38:27,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:27,188 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 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:38:27,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:27,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:38:27,389 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 439 more)] === [2023-11-29 04:38:27,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash 198572201, now seen corresponding path program 1 times [2023-11-29 04:38:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:38:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725612824] [2023-11-29 04:38:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:38:27,391 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:38:27,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:38:27,392 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:27,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:38:28,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:38:28,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:38:28,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:38:28,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:38:28,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725612824] [2023-11-29 04:38:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725612824] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:38:28,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:38:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-29 04:38:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536972955] [2023-11-29 04:38:28,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:38:28,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:38:28,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:38:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:38:28,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:38:28,908 INFO L87 Difference]: Start difference. First operand 1171 states and 1537 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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:38:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:38:36,693 INFO L93 Difference]: Finished difference Result 1219 states and 1584 transitions. [2023-11-29 04:38:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:38:36,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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 54 [2023-11-29 04:38:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:38:36,702 INFO L225 Difference]: With dead ends: 1219 [2023-11-29 04:38:36,702 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 04:38:36,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:38:36,703 INFO L413 NwaCegarLoop]: 979 mSDtfsCounter, 56 mSDsluCounter, 5862 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:38:36,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6841 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2023-11-29 04:38:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 04:38:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1203. [2023-11-29 04:38:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 742 states have (on average 2.055256064690027) internal successors, (1525), 1165 states have internal predecessors, (1525), 32 states have call successors, (32), 13 states have call predecessors, (32), 10 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 04:38:36,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1584 transitions. [2023-11-29 04:38:36,723 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1584 transitions. Word has length 54 [2023-11-29 04:38:36,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:38:36,723 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1584 transitions. [2023-11-29 04:38:36,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 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:38:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1584 transitions. [2023-11-29 04:38:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:38:36,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:38:36,724 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:38:36,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 04:38:36,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_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:38:36,925 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 439 more)] === [2023-11-29 04:38:36,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:38:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash -953042478, now seen corresponding path program 3 times [2023-11-29 04:38:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:38:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715133470] [2023-11-29 04:38:36,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:38:36,927 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:38:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:38:36,928 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:38:36,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d468e49-8008-494b-b141-9f401640aba3/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 04:38:48,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-29 04:38:48,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:38:48,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 04:38:48,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:38:48,679 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:38:48,786 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:38:48,844 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:38:48,844 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:38:48,977 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:38:49,010 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:38:49,199 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:38:49,210 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:38:49,569 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:49,569 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:38:49,586 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:38:50,090 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:50,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:38:50,119 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:38:50,651 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:50,651 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:38:50,682 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:38:51,287 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:51,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:38:51,322 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:38:51,969 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:51,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 04:38:51,989 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:38:52,711 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:52,711 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:38:52,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:38:53,454 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 04:38:53,454 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:38:53,489 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:38:53,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-29 04:38:53,911 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:38:54,097 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 04:38:54,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:38:55,316 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~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1935) |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~mem280#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-11-29 04:38:55,497 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#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_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-29 04:38:58,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse7 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1932))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1931)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1933))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (_ bv1 64) (select (select (store (store .cse0 .cse1 v_ArrVal_1934) .cse2 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse7) (select |c_#length| .cse1))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1932))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1931)) (.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (select (select (store (store .cse9 .cse10 v_ArrVal_1934) (select (select (store .cse11 .cse10 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse8 .cse4) (bvadd (_ bv1 64) .cse8 .cse4)))) (not (bvule (bvadd (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse7) (select |c_#length| .cse10))))))))) is different from false [2023-11-29 04:38:58,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse7 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1932))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1931)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1933))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store .cse0 .cse1 v_ArrVal_1934) .cse2 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (not (bvule (bvadd (_ bv1 64) (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse7) (select |c_#length| .cse1))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1932))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1931)) (.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (select (select (store (store .cse10 .cse11 v_ArrVal_1934) (select (select (store .cse12 .cse11 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse9 .cse4) (bvadd .cse9 (_ bv1 64) .cse4)))) (not (bvule (bvadd (_ bv1 64) (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse7) (select |c_#length| .cse11)))))))))) is different from false [2023-11-29 04:38:58,919 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse5 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1929))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (store .cse9 .cse8 v_ArrVal_1932))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1930) .cse8 v_ArrVal_1931)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1933))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store .cse0 .cse3 v_ArrVal_1934) .cse4 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse5 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1929))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse13 (store .cse15 .cse14 v_ArrVal_1932))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1930) .cse14 v_ArrVal_1931)) (.cse11 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse11))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (select (select (store (store .cse10 .cse11 v_ArrVal_1934) (select (select (store .cse13 .cse11 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse12 .cse5) (bvadd .cse12 .cse5 (_ bv1 64))))))))))))) is different from false [2023-11-29 04:39:03,255 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse5 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1929))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_1932))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1930) .cse9 v_ArrVal_1931)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1933))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store .cse0 .cse3 v_ArrVal_1934) .cse4 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse5 (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1929))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse14 (store .cse16 .cse15 v_ArrVal_1932))) (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1930) .cse15 v_ArrVal_1931)) (.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse12))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (select (select (store (store .cse11 .cse12 v_ArrVal_1934) (select (select (store .cse14 .cse12 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse13 .cse5) (bvadd .cse13 .cse5 (_ bv1 64)))))))))))))) is different from false [2023-11-29 04:39:04,084 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse5 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv5 32)))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1927))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1929))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (store .cse10 .cse9 v_ArrVal_1932))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1928) .cse8 v_ArrVal_1930) .cse9 v_ArrVal_1931)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_1933))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store .cse0 .cse3 v_ArrVal_1934) .cse4 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse5) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1927))) (let ((.cse16 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse18 (store .cse19 .cse16 v_ArrVal_1929))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse15 (store .cse18 .cse17 v_ArrVal_1932))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1928) .cse16 v_ArrVal_1930) .cse17 v_ArrVal_1931)) (.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| .cse13))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select (store (store .cse12 .cse13 v_ArrVal_1934) (select (select (store .cse15 .cse13 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse14 .cse5) (bvadd .cse14 (_ bv1 64) .cse5)))))))))))))) is different from false [2023-11-29 04:39:08,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv5 32)))) (.cse7 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1927))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1929))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_1932))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1928) .cse9 v_ArrVal_1930) .cse10 v_ArrVal_1931)) (.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1933))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store .cse0 .cse1 v_ArrVal_1934) .cse2 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse7) (select |c_#length| .cse1))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1927))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1929))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_1932))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1928) .cse17 v_ArrVal_1930) .cse18 v_ArrVal_1931)) (.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (select (select (store (store .cse14 .cse15 v_ArrVal_1934) (select (select (store .cse16 .cse15 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse13 .cse4) (bvadd .cse13 (_ bv1 64) .cse4)))) (not (bvule (bvadd (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse7) (select |c_#length| .cse15)))))))))))))) is different from false [2023-11-29 04:39:13,557 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1926))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1927))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1929))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_1932))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1925) .cse7 v_ArrVal_1928) .cse8 v_ArrVal_1930) .cse9 v_ArrVal_1931)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (not (bvule (bvadd (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store .cse0 .cse3 v_ArrVal_1934) (select (select (store .cse6 .cse3 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse5) (bvadd (_ bv1 64) .cse4 .cse5)))))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1926))) (let ((.cse18 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse22 (store .cse23 .cse18 v_ArrVal_1927))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_1929))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse17 (store .cse21 .cse20 v_ArrVal_1932))) (let ((.cse13 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem280#1.base| v_ArrVal_1925) .cse18 v_ArrVal_1928) .cse19 v_ArrVal_1930) .cse20 v_ArrVal_1931)) (.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_1933))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (_ bv1 64) .cse4 (select (select (store (store .cse13 .cse14 v_ArrVal_1934) .cse15 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse16 .cse15 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (not (bvule (bvadd (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| .cse14))))))))))))))) is different from false [2023-11-29 04:39:18,733 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (bvadd (_ bv6 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse0 ((_ sign_extend 32) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1926))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1927))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1929))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_1932))) (let ((.cse1 (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1925) .cse8 v_ArrVal_1928) .cse9 v_ArrVal_1930) .cse10 v_ArrVal_1931)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (not (bvule (bvadd .cse0 (_ bv1 64) (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store .cse1 .cse3 v_ArrVal_1934) (select (select (store .cse6 .cse3 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse4 .cse5) (bvadd (_ bv1 64) .cse4 .cse5)))))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1926))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse23 (store .cse24 .cse19 v_ArrVal_1927))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse22 (store .cse23 .cse20 v_ArrVal_1929))) (let ((.cse21 (select (select .cse22 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse18 (store .cse22 .cse21 v_ArrVal_1932))) (let ((.cse14 (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1925) .cse19 v_ArrVal_1928) .cse20 v_ArrVal_1930) .cse21 v_ArrVal_1931)) (.cse15 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (store .cse18 .cse15 v_ArrVal_1933))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (_ bv1 64) .cse4 (select (select (store (store .cse14 .cse15 v_ArrVal_1934) .cse16 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse17 .cse16 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (not (bvule (bvadd .cse0 (_ bv1 64) (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| .cse15)))))))))))))))) is different from false [2023-11-29 04:39:24,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv6 32))) (.cse7 ((_ sign_extend 32) (_ bv4 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1924))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_1926))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_1927))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1929))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse12 .cse11 v_ArrVal_1932))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1923) .cse8 v_ArrVal_1925) .cse9 v_ArrVal_1928) .cse10 v_ArrVal_1930) .cse11 v_ArrVal_1931)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_1933))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_1934) .cse3 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) (not (bvule (bvadd .cse7 (_ bv1 64) (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| .cse2))))))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1924))) (let ((.cse20 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse26 (store .cse27 .cse20 v_ArrVal_1926))) (let ((.cse21 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse25 (store .cse26 .cse21 v_ArrVal_1927))) (let ((.cse22 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse24 (store .cse25 .cse22 v_ArrVal_1929))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse19 (store .cse24 .cse23 v_ArrVal_1932))) (let ((.cse17 (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem278#1.base| v_ArrVal_1923) .cse20 v_ArrVal_1925) .cse21 v_ArrVal_1928) .cse22 v_ArrVal_1930) .cse23 v_ArrVal_1931)) (.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (select (select (store (store .cse17 .cse18 v_ArrVal_1934) (select (select (store .cse19 .cse18 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse16) (bvadd .cse0 .cse16 (_ bv1 64))))) (not (bvule (bvadd .cse7 (_ bv1 64) (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| .cse18))))))))))))))))) is different from false [2023-11-29 04:39:29,914 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv4 32))) (.cse4 ((_ sign_extend 32) (_ bv6 32))) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1924))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_1926))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_1927))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1929))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse6 (store .cse12 .cse11 v_ArrVal_1932))) (let ((.cse1 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1923) .cse8 v_ArrVal_1925) .cse9 v_ArrVal_1928) .cse10 v_ArrVal_1930) .cse11 v_ArrVal_1931)) (.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (not (bvule (bvadd .cse0 (_ bv1 64) (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| .cse3))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store .cse1 .cse3 v_ArrVal_1934) (select (select (store .cse6 .cse3 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 (_ bv1 64) .cse5)))))))))))))))) (forall ((v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse28 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1924))) (let ((.cse21 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse27 (store .cse28 .cse21 v_ArrVal_1926))) (let ((.cse22 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse22 v_ArrVal_1927))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_1929))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse20 (store .cse25 .cse24 v_ArrVal_1932))) (let ((.cse16 (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1923) .cse21 v_ArrVal_1925) .cse22 v_ArrVal_1928) .cse23 v_ArrVal_1930) .cse24 v_ArrVal_1931)) (.cse17 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (not (bvule (bvadd .cse0 (_ bv1 64) (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| .cse17))) (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_1933))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv1 64) (select (select (store (store .cse16 .cse17 v_ArrVal_1934) .cse18 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))))))))))))))))) is different from false [2023-11-29 04:39:37,204 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv6 32))) (.cse7 ((_ sign_extend 32) (_ bv4 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~11#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1921 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1922 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1921))) (let ((.cse8 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse16 (store .cse17 .cse8 v_ArrVal_1924))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1926))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1927))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1929))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse13 .cse12 v_ArrVal_1932))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1922) .cse8 v_ArrVal_1923) .cse9 v_ArrVal_1925) .cse10 v_ArrVal_1928) .cse11 v_ArrVal_1930) .cse12 v_ArrVal_1931)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1936 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_1933))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store .cse1 .cse2 v_ArrVal_1934) .cse3 v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1936) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))) (not (bvule (bvadd .cse7 (_ bv1 64) (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| .cse2))))))))))))))))) (forall ((v_ArrVal_1921 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1932 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1931 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1923 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1922 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1930 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1929 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1928 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1925 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1924 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1927 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1926 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1921))) (let ((.cse22 (select (select .cse31 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse30 (store .cse31 .cse22 v_ArrVal_1924))) (let ((.cse23 (select (select .cse30 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse29 (store .cse30 .cse23 v_ArrVal_1926))) (let ((.cse24 (select (select .cse29 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse28 (store .cse29 .cse24 v_ArrVal_1927))) (let ((.cse25 (select (select .cse28 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse27 (store .cse28 .cse25 v_ArrVal_1929))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse21 (store .cse27 .cse26 v_ArrVal_1932))) (let ((.cse19 (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1922) .cse22 v_ArrVal_1923) .cse23 v_ArrVal_1925) .cse24 v_ArrVal_1928) .cse25 v_ArrVal_1930) .cse26 v_ArrVal_1931)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (forall ((v_ArrVal_1934 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1933 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1935 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (select (select (store (store .cse19 .cse20 v_ArrVal_1934) (select (select (store .cse21 .cse20 v_ArrVal_1933) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1935) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse18) (bvadd .cse0 .cse18 (_ bv1 64))))) (not (bvule (bvadd .cse7 (_ bv1 64) (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| .cse20))))))))))))))))))) is different from false [2023-11-29 04:39:39,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:39:39,222 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 8968 treesize of output 8955 [2023-11-29 04:39:39,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:39:39,354 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 8942 treesize of output 4821