./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/logname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/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 6e2dc8873946fef7a19f9a424fb345eb43768fe38bdfc084307c2d557560dafb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:35:58,431 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:35:58,512 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-28 20:35:58,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:35:58,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:35:58,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:35:58,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:35:58,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:35:58,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:35:58,550 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:35:58,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:35:58,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:35:58,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:35:58,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:35:58,553 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:35:58,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:35:58,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:35:58,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:35:58,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:35:58,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:35:58,557 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:35:58,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:35:58,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:35:58,561 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:35:58,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:35:58,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:35:58,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:35:58,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:35:58,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:35:58,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:35:58,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:35:58,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:35:58,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:35:58,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:35:58,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:35:58,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:35:58,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:35:58,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:35:58,566 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_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/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 -> 6e2dc8873946fef7a19f9a424fb345eb43768fe38bdfc084307c2d557560dafb [2023-11-28 20:35:58,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:35:58,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:35:58,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:35:58,869 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:35:58,870 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:35:58,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2023-11-28 20:36:02,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:02,410 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:02,410 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2023-11-28 20:36:02,444 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/ad38d5d8e/c0d333d5b66646de835c426a81a65ba2/FLAGcdff9a08e [2023-11-28 20:36:02,461 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/ad38d5d8e/c0d333d5b66646de835c426a81a65ba2 [2023-11-28 20:36:02,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:02,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:02,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:02,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:02,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:02,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:02" (1/1) ... [2023-11-28 20:36:02,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6b90b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:02, skipping insertion in model container [2023-11-28 20:36:02,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:02" (1/1) ... [2023-11-28 20:36:02,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:03,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:03,763 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-28 20:36:03,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66a3131b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:03, skipping insertion in model container [2023-11-28 20:36:03,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:03,764 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-28 20:36:03,766 INFO L158 Benchmark]: Toolchain (without parser) took 1298.82ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 97.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-28 20:36:03,766 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 144.4MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:36:03,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1295.93ms. Allocated memory is still 176.2MB. Free memory was 124.1MB in the beginning and 97.5MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-28 20:36:03,769 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.25ms. Allocated memory is still 176.2MB. Free memory was 144.5MB in the beginning and 144.4MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1295.93ms. Allocated memory is still 176.2MB. Free memory was 124.1MB in the beginning and 97.5MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2339]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/logname-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/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 6e2dc8873946fef7a19f9a424fb345eb43768fe38bdfc084307c2d557560dafb --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:36:05,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:36:05,981 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-28 20:36:05,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:36:05,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:36:06,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:36:06,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:36:06,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:36:06,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:36:06,025 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:36:06,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:36:06,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:36:06,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:36:06,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:36:06,028 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:36:06,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:36:06,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:36:06,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:36:06,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 20:36:06,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 20:36:06,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 20:36:06,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:36:06,033 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:36:06,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:36:06,034 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:36:06,035 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:36:06,035 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:36:06,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:36:06,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:36:06,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:36:06,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:36:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:06,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:36:06,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:36:06,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:36:06,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:36:06,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:36:06,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:36:06,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:36:06,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:36:06,041 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:36:06,042 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_d0804182-dbad-4f1a-a041-392ad2ad44db/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_d0804182-dbad-4f1a-a041-392ad2ad44db/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 -> 6e2dc8873946fef7a19f9a424fb345eb43768fe38bdfc084307c2d557560dafb [2023-11-28 20:36:06,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:36:06,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:36:06,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:36:06,430 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:36:06,430 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:36:06,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/logname-1.i [2023-11-28 20:36:09,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:36:09,761 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:36:09,762 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/sv-benchmarks/c/busybox-1.22.0/logname-1.i [2023-11-28 20:36:09,793 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/6d72fc17f/b196c7c1eee74d50a0c6d3046017ef04/FLAG652b7c2cb [2023-11-28 20:36:09,810 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/data/6d72fc17f/b196c7c1eee74d50a0c6d3046017ef04 [2023-11-28 20:36:09,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:36:09,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:36:09,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:09,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:36:09,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:36:09,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:09" (1/1) ... [2023-11-28 20:36:09,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317ef588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:09, skipping insertion in model container [2023-11-28 20:36:09,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:36:09" (1/1) ... [2023-11-28 20:36:09,903 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:10,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:10,995 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-28 20:36:11,021 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:36:11,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:11,131 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:36:11,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:36:11,468 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:11,468 WARN L675 CHandler]: The function strerror is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:11,468 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:36:11,478 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:36:11,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11 WrapperNode [2023-11-28 20:36:11,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:36:11,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:11,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:36:11,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:36:11,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,593 INFO L138 Inliner]: procedures = 608, calls = 155, calls flagged for inlining = 16, calls inlined = 14, statements flattened = 500 [2023-11-28 20:36:11,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:36:11,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:36:11,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:36:11,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:36:11,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,637 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-28 20:36:11,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:36:11,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:36:11,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:36:11,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:36:11,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (1/1) ... [2023-11-28 20:36:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:36:11,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:36:11,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:36:11,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:36:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2023-11-28 20:36:11,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:36:11,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-28 20:36:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-11-28 20:36:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-28 20:36:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-28 20:36:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-28 20:36:11,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:36:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:36:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-28 20:36:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-28 20:36:11,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-28 20:36:11,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-28 20:36:11,799 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-28 20:36:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2023-11-28 20:36:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2023-11-28 20:36:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-28 20:36:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-28 20:36:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-28 20:36:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-28 20:36:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-28 20:36:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-11-28 20:36:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2023-11-28 20:36:12,210 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:36:12,212 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:36:18,793 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:36:18,887 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:36:18,887 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-28 20:36:18,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:18 BoogieIcfgContainer [2023-11-28 20:36:18,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:36:18,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:36:18,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:36:18,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:36:18,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:36:09" (1/3) ... [2023-11-28 20:36:18,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0fcc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:18, skipping insertion in model container [2023-11-28 20:36:18,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:36:11" (2/3) ... [2023-11-28 20:36:18,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0fcc86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:36:18, skipping insertion in model container [2023-11-28 20:36:18,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:36:18" (3/3) ... [2023-11-28 20:36:18,898 INFO L112 eAbstractionObserver]: Analyzing ICFG logname-1.i [2023-11-28 20:36:18,921 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:36:18,921 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 141 error locations. [2023-11-28 20:36:19,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:36:19,024 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;@4ebe5c62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:36:19,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 141 error locations. [2023-11-28 20:36:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 318 states, 161 states have (on average 2.1490683229813663) internal successors, (346), 302 states have internal predecessors, (346), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 20:36:19,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:19,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 20:36:19,038 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 138 more)] === [2023-11-28 20:36:19,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash 21274, now seen corresponding path program 1 times [2023-11-28 20:36:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:19,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094573863] [2023-11-28 20:36:19,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:19,058 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-28 20:36:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:19,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:19,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:19,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 20:36:19,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:19,364 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-28 20:36:19,381 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-28 20:36:19,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:19,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094573863] [2023-11-28 20:36:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094573863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:19,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:19,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563426568] [2023-11-28 20:36:19,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:19,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:19,422 INFO L87 Difference]: Start difference. First operand has 318 states, 161 states have (on average 2.1490683229813663) internal successors, (346), 302 states have internal predecessors, (346), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-28 20:36:20,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:20,784 INFO L93 Difference]: Finished difference Result 419 states and 476 transitions. [2023-11-28 20:36:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:20,786 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-28 20:36:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:20,802 INFO L225 Difference]: With dead ends: 419 [2023-11-28 20:36:20,802 INFO L226 Difference]: Without dead ends: 418 [2023-11-28 20:36:20,804 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-28 20:36:20,808 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 260 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:20,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 371 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-28 20:36:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-28 20:36:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 314. [2023-11-28 20:36:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 161 states have (on average 2.049689440993789) internal successors, (330), 298 states have internal predecessors, (330), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 354 transitions. [2023-11-28 20:36:20,881 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 354 transitions. Word has length 2 [2023-11-28 20:36:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:20,881 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 354 transitions. [2023-11-28 20:36:20,881 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-28 20:36:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 354 transitions. [2023-11-28 20:36:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-28 20:36:20,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:20,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-28 20:36:20,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:21,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:21,083 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 138 more)] === [2023-11-28 20:36:21,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 21275, now seen corresponding path program 1 times [2023-11-28 20:36:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513782404] [2023-11-28 20:36:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:21,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-28 20:36:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:21,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:21,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:21,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:21,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:21,272 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-28 20:36:21,293 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-28 20:36:21,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:21,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513782404] [2023-11-28 20:36:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513782404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560835260] [2023-11-28 20:36:21,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:21,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:21,299 INFO L87 Difference]: Start difference. First operand 314 states and 354 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-28 20:36:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:22,893 INFO L93 Difference]: Finished difference Result 313 states and 353 transitions. [2023-11-28 20:36:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:22,895 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-28 20:36:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:22,898 INFO L225 Difference]: With dead ends: 313 [2023-11-28 20:36:22,898 INFO L226 Difference]: Without dead ends: 313 [2023-11-28 20:36:22,898 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-28 20:36:22,900 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 9 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:22,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 512 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:36:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-28 20:36:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2023-11-28 20:36:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 161 states have (on average 2.0434782608695654) internal successors, (329), 297 states have internal predecessors, (329), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 353 transitions. [2023-11-28 20:36:22,919 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 353 transitions. Word has length 2 [2023-11-28 20:36:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:22,920 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 353 transitions. [2023-11-28 20:36:22,920 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-28 20:36:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 353 transitions. [2023-11-28 20:36:22,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-28 20:36:22,920 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:22,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-28 20:36:22,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:23,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:23,122 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 138 more)] === [2023-11-28 20:36:23,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 21040744, now seen corresponding path program 1 times [2023-11-28 20:36:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049048790] [2023-11-28 20:36:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:23,124 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-28 20:36:23,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:23,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:23,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:23,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:36:23,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:23,350 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-28 20:36:23,439 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-28 20:36:23,439 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:23,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049048790] [2023-11-28 20:36:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049048790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108011237] [2023-11-28 20:36:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 20:36:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 20:36:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-28 20:36:23,442 INFO L87 Difference]: Start difference. First operand 313 states and 353 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-28 20:36:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:25,141 INFO L93 Difference]: Finished difference Result 315 states and 355 transitions. [2023-11-28 20:36:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:36:25,142 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-28 20:36:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:25,144 INFO L225 Difference]: With dead ends: 315 [2023-11-28 20:36:25,144 INFO L226 Difference]: Without dead ends: 315 [2023-11-28 20:36:25,144 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-28 20:36:25,145 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 9 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:25,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 512 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-28 20:36:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-28 20:36:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2023-11-28 20:36:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 163 states have (on average 2.0306748466257667) internal successors, (331), 299 states have internal predecessors, (331), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 355 transitions. [2023-11-28 20:36:25,157 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 355 transitions. Word has length 4 [2023-11-28 20:36:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:25,158 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 355 transitions. [2023-11-28 20:36:25,158 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-28 20:36:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 355 transitions. [2023-11-28 20:36:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 20:36:25,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:25,159 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-28 20:36:25,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:25,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:25,359 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 138 more)] === [2023-11-28 20:36:25,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1254136960, now seen corresponding path program 1 times [2023-11-28 20:36:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363818641] [2023-11-28 20:36:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:25,361 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-28 20:36:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:25,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:25,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:25,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:36:25,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:25,539 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-28 20:36:25,683 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-28 20:36:25,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:26,279 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-28 20:36:26,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:26,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363818641] [2023-11-28 20:36:26,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363818641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:26,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:26,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-28 20:36:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842012074] [2023-11-28 20:36:26,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:26,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:26,282 INFO L87 Difference]: Start difference. First operand 315 states and 355 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-28 20:36:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:33,042 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions. [2023-11-28 20:36:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:33,044 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-28 20:36:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:33,045 INFO L225 Difference]: With dead ends: 317 [2023-11-28 20:36:33,045 INFO L226 Difference]: Without dead ends: 317 [2023-11-28 20:36:33,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:33,046 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 19 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:33,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 916 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-28 20:36:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-11-28 20:36:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-11-28 20:36:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 166 states have (on average 2.0060240963855422) internal successors, (333), 301 states have internal predecessors, (333), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 357 transitions. [2023-11-28 20:36:33,054 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 357 transitions. Word has length 6 [2023-11-28 20:36:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:33,055 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 357 transitions. [2023-11-28 20:36:33,055 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-28 20:36:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 357 transitions. [2023-11-28 20:36:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-28 20:36:33,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:33,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-28 20:36:33,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:33,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:33,256 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 138 more)] === [2023-11-28 20:36:33,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1279300580, now seen corresponding path program 1 times [2023-11-28 20:36:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:33,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804765898] [2023-11-28 20:36:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:33,258 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-28 20:36:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:33,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:33,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:33,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:36:33,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:33,485 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-28 20:36:33,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:33,594 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-28 20:36:33,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:33,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804765898] [2023-11-28 20:36:33,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804765898] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:33,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:33,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-28 20:36:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079597608] [2023-11-28 20:36:33,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:33,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:36:33,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:33,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:36:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:33,596 INFO L87 Difference]: Start difference. First operand 317 states and 357 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-28 20:36:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:34,884 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2023-11-28 20:36:34,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:36:34,886 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-28 20:36:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:34,888 INFO L225 Difference]: With dead ends: 327 [2023-11-28 20:36:34,888 INFO L226 Difference]: Without dead ends: 327 [2023-11-28 20:36:34,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:36:34,889 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 5 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:34,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1552 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-28 20:36:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-11-28 20:36:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2023-11-28 20:36:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 176 states have (on average 1.9488636363636365) internal successors, (343), 311 states have internal predecessors, (343), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-28 20:36:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 367 transitions. [2023-11-28 20:36:34,898 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 367 transitions. Word has length 11 [2023-11-28 20:36:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:34,898 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 367 transitions. [2023-11-28 20:36:34,899 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-28 20:36:34,899 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 367 transitions. [2023-11-28 20:36:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-28 20:36:34,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:34,899 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-28 20:36:34,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:35,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:35,100 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 138 more)] === [2023-11-28 20:36:35,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1453543276, now seen corresponding path program 2 times [2023-11-28 20:36:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848627613] [2023-11-28 20:36:35,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:36:35,101 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-28 20:36:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:35,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:35,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:35,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:36:35,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:35,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:36:35,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:35,319 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:36:35,320 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-28 20:36:35,674 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-28 20:36:35,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:35,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:35,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848627613] [2023-11-28 20:36:35,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848627613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:35,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:35,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:35,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939702207] [2023-11-28 20:36:35,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:35,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:35,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:35,676 INFO L87 Difference]: Start difference. First operand 327 states and 367 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-28 20:36:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:37,693 INFO L93 Difference]: Finished difference Result 451 states and 506 transitions. [2023-11-28 20:36:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:37,693 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-28 20:36:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:37,695 INFO L225 Difference]: With dead ends: 451 [2023-11-28 20:36:37,695 INFO L226 Difference]: Without dead ends: 451 [2023-11-28 20:36:37,696 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-28 20:36:37,696 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 295 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:37,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 374 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-28 20:36:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-28 20:36:37,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 387. [2023-11-28 20:36:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 229 states have (on average 1.982532751091703) internal successors, (454), 363 states have internal predecessors, (454), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 488 transitions. [2023-11-28 20:36:37,709 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 488 transitions. Word has length 21 [2023-11-28 20:36:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:37,709 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 488 transitions. [2023-11-28 20:36:37,709 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-28 20:36:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 488 transitions. [2023-11-28 20:36:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-28 20:36:37,710 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:37,710 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-28 20:36:37,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-28 20:36:37,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:37,911 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 138 more)] === [2023-11-28 20:36:37,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:37,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1453543277, now seen corresponding path program 1 times [2023-11-28 20:36:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609194701] [2023-11-28 20:36:37,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:37,913 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-28 20:36:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:37,914 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:37,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:38,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 20:36:38,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:38,295 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-28 20:36:38,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:38,671 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-28 20:36:38,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:38,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609194701] [2023-11-28 20:36:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609194701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:36:38,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:36:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-28 20:36:38,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618781131] [2023-11-28 20:36:38,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:36:38,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-28 20:36:38,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:38,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-28 20:36:38,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:36:38,674 INFO L87 Difference]: Start difference. First operand 387 states and 488 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-28 20:36:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:41,340 INFO L93 Difference]: Finished difference Result 391 states and 492 transitions. [2023-11-28 20:36:41,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-28 20:36:41,342 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-28 20:36:41,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:41,344 INFO L225 Difference]: With dead ends: 391 [2023-11-28 20:36:41,344 INFO L226 Difference]: Without dead ends: 391 [2023-11-28 20:36:41,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-28 20:36:41,345 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 2 mSDsluCounter, 3399 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3710 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:41,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3710 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-28 20:36:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-11-28 20:36:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2023-11-28 20:36:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 233 states have (on average 1.9656652360515021) internal successors, (458), 367 states have internal predecessors, (458), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 492 transitions. [2023-11-28 20:36:41,356 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 492 transitions. Word has length 21 [2023-11-28 20:36:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:41,356 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 492 transitions. [2023-11-28 20:36:41,356 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-28 20:36:41,356 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 492 transitions. [2023-11-28 20:36:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-28 20:36:41,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:41,357 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-28 20:36:41,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-28 20:36:41,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:41,557 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 138 more)] === [2023-11-28 20:36:41,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash -826117827, now seen corresponding path program 2 times [2023-11-28 20:36:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750355879] [2023-11-28 20:36:41,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:36:41,558 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-28 20:36:41,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:41,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:41,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:41,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 20:36:41,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:36:41,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:36:41,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:41,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:41,757 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-28 20:36:42,049 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-28 20:36:42,050 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:42,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750355879] [2023-11-28 20:36:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750355879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 20:36:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143369357] [2023-11-28 20:36:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:42,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:42,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:42,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:42,052 INFO L87 Difference]: Start difference. First operand 391 states and 492 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-28 20:36:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:43,665 INFO L93 Difference]: Finished difference Result 394 states and 494 transitions. [2023-11-28 20:36:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:43,667 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-28 20:36:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:43,669 INFO L225 Difference]: With dead ends: 394 [2023-11-28 20:36:43,669 INFO L226 Difference]: Without dead ends: 394 [2023-11-28 20:36:43,670 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-28 20:36:43,670 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 6 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:43,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 518 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-28 20:36:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-28 20:36:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2023-11-28 20:36:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 236 states have (on average 1.9491525423728813) internal successors, (460), 369 states have internal predecessors, (460), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2023-11-28 20:36:43,684 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 25 [2023-11-28 20:36:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:43,684 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2023-11-28 20:36:43,685 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-28 20:36:43,685 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2023-11-28 20:36:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-28 20:36:43,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:43,686 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:43,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-28 20:36:43,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:43,886 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 138 more)] === [2023-11-28 20:36:43,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:43,887 INFO L85 PathProgramCache]: Analyzing trace with hash -275724299, now seen corresponding path program 1 times [2023-11-28 20:36:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:43,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126725744] [2023-11-28 20:36:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:43,888 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-28 20:36:43,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:43,889 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:43,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:44,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:36:44,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:44,287 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:36:44,288 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-28 20:36:44,319 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-28 20:36:44,320 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:44,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:44,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126725744] [2023-11-28 20:36:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126725744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552403606] [2023-11-28 20:36:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:44,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:44,322 INFO L87 Difference]: Start difference. First operand 394 states and 494 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-28 20:36:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:46,650 INFO L93 Difference]: Finished difference Result 447 states and 507 transitions. [2023-11-28 20:36:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:46,651 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-28 20:36:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:46,653 INFO L225 Difference]: With dead ends: 447 [2023-11-28 20:36:46,653 INFO L226 Difference]: Without dead ends: 447 [2023-11-28 20:36:46,653 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-28 20:36:46,653 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 245 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:46,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 376 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-28 20:36:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-11-28 20:36:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 389. [2023-11-28 20:36:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 236 states have (on average 1.9279661016949152) internal successors, (455), 364 states have internal predecessors, (455), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 489 transitions. [2023-11-28 20:36:46,666 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 489 transitions. Word has length 32 [2023-11-28 20:36:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:46,667 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 489 transitions. [2023-11-28 20:36:46,667 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-28 20:36:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 489 transitions. [2023-11-28 20:36:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-28 20:36:46,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:46,668 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:46,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:46,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:46,869 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 138 more)] === [2023-11-28 20:36:46,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash -275724298, now seen corresponding path program 1 times [2023-11-28 20:36:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338377905] [2023-11-28 20:36:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:46,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:46,871 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:46,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:47,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:36:47,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:47,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:47,418 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-28 20:36:47,427 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-28 20:36:47,496 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-28 20:36:47,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:47,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338377905] [2023-11-28 20:36:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338377905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:47,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:36:47,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643370361] [2023-11-28 20:36:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:47,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:36:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:47,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:36:47,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:36:47,499 INFO L87 Difference]: Start difference. First operand 389 states and 489 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-28 20:36:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:49,964 INFO L93 Difference]: Finished difference Result 390 states and 491 transitions. [2023-11-28 20:36:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:36:49,965 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-28 20:36:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:49,968 INFO L225 Difference]: With dead ends: 390 [2023-11-28 20:36:49,968 INFO L226 Difference]: Without dead ends: 390 [2023-11-28 20:36:49,968 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-28 20:36:49,969 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 298 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:49,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1077 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-28 20:36:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-28 20:36:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 388. [2023-11-28 20:36:49,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 236 states have (on average 1.923728813559322) internal successors, (454), 363 states have internal predecessors, (454), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 488 transitions. [2023-11-28 20:36:49,981 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 488 transitions. Word has length 32 [2023-11-28 20:36:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:49,981 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 488 transitions. [2023-11-28 20:36:49,982 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-28 20:36:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 488 transitions. [2023-11-28 20:36:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-28 20:36:49,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:49,983 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:36:49,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:50,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:50,193 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 138 more)] === [2023-11-28 20:36:50,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1317464523, now seen corresponding path program 1 times [2023-11-28 20:36:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515144511] [2023-11-28 20:36:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:50,194 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-28 20:36:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:50,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:50,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:50,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:36:50,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:50,787 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 13 treesize of output 1 [2023-11-28 20:36:50,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:50,973 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-28 20:36:51,007 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:36:51,008 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-28 20:36:51,113 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-28 20:36:51,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:51,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515144511] [2023-11-28 20:36:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515144511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:51,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:36:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207277517] [2023-11-28 20:36:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:51,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:51,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:51,115 INFO L87 Difference]: Start difference. First operand 388 states and 488 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-28 20:36:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:55,410 INFO L93 Difference]: Finished difference Result 403 states and 504 transitions. [2023-11-28 20:36:55,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:36:55,412 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-28 20:36:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:55,414 INFO L225 Difference]: With dead ends: 403 [2023-11-28 20:36:55,415 INFO L226 Difference]: Without dead ends: 403 [2023-11-28 20:36:55,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:36:55,415 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 341 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:55,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1066 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-28 20:36:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-11-28 20:36:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 396. [2023-11-28 20:36:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 245 states have (on average 1.9142857142857144) internal successors, (469), 371 states have internal predecessors, (469), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:55,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 503 transitions. [2023-11-28 20:36:55,428 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 503 transitions. Word has length 34 [2023-11-28 20:36:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:55,429 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 503 transitions. [2023-11-28 20:36:55,429 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-28 20:36:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 503 transitions. [2023-11-28 20:36:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-28 20:36:55,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:55,430 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-28 20:36:55,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:55,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:55,633 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 138 more)] === [2023-11-28 20:36:55,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -931411656, now seen corresponding path program 1 times [2023-11-28 20:36:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:55,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956043999] [2023-11-28 20:36:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:55,634 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-28 20:36:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:55,635 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:55,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:56,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:36:56,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:56,142 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-28 20:36:56,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:56,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-28 20:36:56,182 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:36:56,183 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-28 20:36:56,212 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-28 20:36:56,213 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:56,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956043999] [2023-11-28 20:36:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956043999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:36:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649538284] [2023-11-28 20:36:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:36:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:36:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:36:56,215 INFO L87 Difference]: Start difference. First operand 396 states and 503 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-28 20:36:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:36:57,462 INFO L93 Difference]: Finished difference Result 453 states and 519 transitions. [2023-11-28 20:36:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:36:57,463 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-28 20:36:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:36:57,465 INFO L225 Difference]: With dead ends: 453 [2023-11-28 20:36:57,465 INFO L226 Difference]: Without dead ends: 453 [2023-11-28 20:36:57,466 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-28 20:36:57,466 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 245 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:36:57,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 371 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-28 20:36:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2023-11-28 20:36:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 395. [2023-11-28 20:36:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 245 states have (on average 1.9061224489795918) internal successors, (467), 370 states have internal predecessors, (467), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:36:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 501 transitions. [2023-11-28 20:36:57,477 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 501 transitions. Word has length 36 [2023-11-28 20:36:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:36:57,477 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 501 transitions. [2023-11-28 20:36:57,477 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-28 20:36:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 501 transitions. [2023-11-28 20:36:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-28 20:36:57,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:36:57,478 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-28 20:36:57,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:57,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:36:57,678 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 138 more)] === [2023-11-28 20:36:57,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:36:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash -931411655, now seen corresponding path program 1 times [2023-11-28 20:36:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:36:57,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604203243] [2023-11-28 20:36:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:36:57,680 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-28 20:36:57,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:36:57,681 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:57,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:36:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:36:58,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-28 20:36:58,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:36:58,274 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-28 20:36:58,285 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-28 20:36:58,317 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-28 20:36:58,348 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-28 20:36:58,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-28 20:36:58,610 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-28 20:36:58,649 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:36:58,649 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-28 20:36:58,817 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-28 20:36:58,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:36:58,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:36:58,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604203243] [2023-11-28 20:36:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604203243] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:36:58,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:36:58,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:36:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059426539] [2023-11-28 20:36:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:36:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:36:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:36:58,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:36:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:36:58,819 INFO L87 Difference]: Start difference. First operand 395 states and 501 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-28 20:37:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:13,276 INFO L93 Difference]: Finished difference Result 458 states and 519 transitions. [2023-11-28 20:37:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:37:13,277 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-28 20:37:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:13,279 INFO L225 Difference]: With dead ends: 458 [2023-11-28 20:37:13,280 INFO L226 Difference]: Without dead ends: 458 [2023-11-28 20:37:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:37:13,280 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 614 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:13,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 967 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2023-11-28 20:37:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-11-28 20:37:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 395. [2023-11-28 20:37:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 245 states have (on average 1.9020408163265305) internal successors, (466), 370 states have internal predecessors, (466), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:37:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 500 transitions. [2023-11-28 20:37:13,289 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 500 transitions. Word has length 36 [2023-11-28 20:37:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:13,289 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 500 transitions. [2023-11-28 20:37:13,289 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-28 20:37:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 500 transitions. [2023-11-28 20:37:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-28 20:37:13,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:13,290 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-28 20:37:13,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:13,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:37:13,490 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 138 more)] === [2023-11-28 20:37:13,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:13,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1732873407, now seen corresponding path program 1 times [2023-11-28 20:37:13,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:37:13,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805887371] [2023-11-28 20:37:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:13,492 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-28 20:37:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:37:13,493 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:13,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:14,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 20:37:14,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:14,054 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-28 20:37:14,112 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-28 20:37:14,251 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-28 20:37:14,252 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-28 20:37:14,342 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-28 20:37:14,342 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-28 20:37:14,381 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-28 20:37:14,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:37:14,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:37:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805887371] [2023-11-28 20:37:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805887371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:14,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-28 20:37:14,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541707525] [2023-11-28 20:37:14,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:14,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:37:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:37:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:37:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:37:14,383 INFO L87 Difference]: Start difference. First operand 395 states and 500 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-28 20:37:21,685 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-28 20:37:25,692 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-28 20:37:29,700 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 [0] [2023-11-28 20:37:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:30,823 INFO L93 Difference]: Finished difference Result 393 states and 497 transitions. [2023-11-28 20:37:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:37:30,825 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-28 20:37:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:30,827 INFO L225 Difference]: With dead ends: 393 [2023-11-28 20:37:30,827 INFO L226 Difference]: Without dead ends: 393 [2023-11-28 20:37:30,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:37:30,828 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 287 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:30,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 990 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 694 Invalid, 3 Unknown, 0 Unchecked, 16.4s Time] [2023-11-28 20:37:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-28 20:37:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2023-11-28 20:37:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 245 states have (on average 1.889795918367347) internal successors, (463), 368 states have internal predecessors, (463), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:37:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 497 transitions. [2023-11-28 20:37:30,840 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 497 transitions. Word has length 38 [2023-11-28 20:37:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:30,840 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 497 transitions. [2023-11-28 20:37:30,840 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-28 20:37:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 497 transitions. [2023-11-28 20:37:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-28 20:37:30,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:30,841 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-28 20:37:30,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:31,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:37:31,042 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 138 more)] === [2023-11-28 20:37:31,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:31,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1732873406, now seen corresponding path program 1 times [2023-11-28 20:37:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:37:31,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692301026] [2023-11-28 20:37:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:31,043 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-28 20:37:31,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:37:31,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:31,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:31,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 20:37:31,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:31,600 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-28 20:37:31,633 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-28 20:37:31,686 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-28 20:37:31,705 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-28 20:37:31,803 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-28 20:37:31,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-28 20:37:31,885 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-28 20:37:31,924 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-28 20:37:31,924 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:37:31,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:37:31,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692301026] [2023-11-28 20:37:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692301026] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 20:37:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020562085] [2023-11-28 20:37:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:31,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 20:37:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:37:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 20:37:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-28 20:37:31,926 INFO L87 Difference]: Start difference. First operand 393 states and 497 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-28 20:37:37,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:37:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:37:37,960 INFO L93 Difference]: Finished difference Result 392 states and 495 transitions. [2023-11-28 20:37:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:37:37,962 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-28 20:37:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:37:37,964 INFO L225 Difference]: With dead ends: 392 [2023-11-28 20:37:37,964 INFO L226 Difference]: Without dead ends: 392 [2023-11-28 20:37:37,965 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-28 20:37:37,965 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 288 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:37:37,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 845 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-28 20:37:37,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-11-28 20:37:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-11-28 20:37:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 245 states have (on average 1.8816326530612244) internal successors, (461), 367 states have internal predecessors, (461), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:37:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 495 transitions. [2023-11-28 20:37:37,976 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 495 transitions. Word has length 38 [2023-11-28 20:37:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:37:37,976 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 495 transitions. [2023-11-28 20:37:37,976 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-28 20:37:37,977 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 495 transitions. [2023-11-28 20:37:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-28 20:37:37,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:37:37,978 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-28 20:37:37,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-28 20:37:38,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:37:38,188 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 138 more)] === [2023-11-28 20:37:38,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:37:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1491525459, now seen corresponding path program 1 times [2023-11-28 20:37:38,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:37:38,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367019812] [2023-11-28 20:37:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:37:38,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:37:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:37:38,190 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:38,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:37:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:37:38,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-28 20:37:38,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:37:38,790 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-28 20:37:38,881 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:37:38,882 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-28 20:37:38,958 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-28 20:37:39,095 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-28 20:37:39,304 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:37:39,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-28 20:37:39,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-28 20:37:39,484 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-28 20:37:39,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:37:39,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:37:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367019812] [2023-11-28 20:37:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367019812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:37:39,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:37:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 20:37:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220422044] [2023-11-28 20:37:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:37:39,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 20:37:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:37:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 20:37:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-28 20:37:39,486 INFO L87 Difference]: Start difference. First operand 392 states and 495 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-28 20:37:48,039 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-28 20:37:52,048 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-28 20:37:56,058 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-28 20:38:00,155 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-28 20:38:04,163 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-28 20:38:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:06,419 INFO L93 Difference]: Finished difference Result 459 states and 525 transitions. [2023-11-28 20:38:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:38:06,421 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-28 20:38:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:06,423 INFO L225 Difference]: With dead ends: 459 [2023-11-28 20:38:06,423 INFO L226 Difference]: Without dead ends: 459 [2023-11-28 20:38:06,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-28 20:38:06,423 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 603 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:06,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 887 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 798 Invalid, 5 Unknown, 0 Unchecked, 26.7s Time] [2023-11-28 20:38:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-11-28 20:38:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 398. [2023-11-28 20:38:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 251 states have (on average 1.8804780876494025) internal successors, (472), 373 states have internal predecessors, (472), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:38:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 506 transitions. [2023-11-28 20:38:06,433 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 506 transitions. Word has length 41 [2023-11-28 20:38:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:06,433 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 506 transitions. [2023-11-28 20:38:06,433 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-28 20:38:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 506 transitions. [2023-11-28 20:38:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-28 20:38:06,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:06,434 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-28 20:38:06,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:06,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:06,635 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 138 more)] === [2023-11-28 20:38:06,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1491525460, now seen corresponding path program 1 times [2023-11-28 20:38:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:06,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095658767] [2023-11-28 20:38:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:06,637 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-28 20:38:06,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:06,638 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:06,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:07,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-28 20:38:07,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:07,320 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-28 20:38:07,380 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-28 20:38:07,419 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:38:07,420 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-28 20:38:07,494 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-28 20:38:07,531 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-28 20:38:07,649 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-28 20:38:07,654 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-28 20:38:07,893 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:38:07,893 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-28 20:38:07,906 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-28 20:38:08,072 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-28 20:38:08,085 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-28 20:38:08,136 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-28 20:38:08,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:38:08,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:38:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095658767] [2023-11-28 20:38:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095658767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:38:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:38:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 20:38:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869705491] [2023-11-28 20:38:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:38:08,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:38:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:38:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:38:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:38:08,138 INFO L87 Difference]: Start difference. First operand 398 states and 506 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-28 20:38:18,477 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-28 20:38:22,487 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-28 20:38:26,501 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-28 20:38:30,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:38:34,445 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-28 20:38:38,452 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-28 20:38:42,463 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-28 20:38:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:38:45,397 INFO L93 Difference]: Finished difference Result 457 states and 520 transitions. [2023-11-28 20:38:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 20:38:45,399 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-28 20:38:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:38:45,401 INFO L225 Difference]: With dead ends: 457 [2023-11-28 20:38:45,401 INFO L226 Difference]: Without dead ends: 457 [2023-11-28 20:38:45,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:38:45,402 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 594 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:38:45,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1133 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1462 Invalid, 6 Unknown, 0 Unchecked, 36.8s Time] [2023-11-28 20:38:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-11-28 20:38:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 398. [2023-11-28 20:38:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 251 states have (on average 1.8645418326693226) internal successors, (468), 373 states have internal predecessors, (468), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:38:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 502 transitions. [2023-11-28 20:38:45,414 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 502 transitions. Word has length 41 [2023-11-28 20:38:45,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:38:45,414 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 502 transitions. [2023-11-28 20:38:45,415 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-28 20:38:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 502 transitions. [2023-11-28 20:38:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-28 20:38:45,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:38:45,415 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-28 20:38:45,426 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:45,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:38:45,616 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 138 more)] === [2023-11-28 20:38:45,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:38:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1680697781, now seen corresponding path program 1 times [2023-11-28 20:38:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:38:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [673990753] [2023-11-28 20:38:45,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:38:45,617 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-28 20:38:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:38:45,618 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:45,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:38:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:38:46,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 20:38:46,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:38:46,292 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-28 20:38:46,383 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-28 20:38:46,384 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-28 20:38:46,481 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-28 20:38:46,587 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-28 20:38:46,798 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:38:46,798 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-28 20:38:46,995 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:38:46,996 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-28 20:38:47,047 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-28 20:38:47,211 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-28 20:38:47,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:38:47,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1353 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1353) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-28 20:38:47,419 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1353 (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~5#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_1353) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-28 20:38:47,461 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1353 (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~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1352))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1353)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:38:47,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1353 (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~5#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_1352))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1353)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-28 20:38:47,530 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1352 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1351 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1353 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1351))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1352)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1353)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-28 20:38:47,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:38:47,570 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-28 20:38:47,576 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-28 20:38:47,606 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-28 20:38:47,613 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 248 treesize of output 178 [2023-11-28 20:38:47,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 67 [2023-11-28 20:38:49,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:38:49,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 278 [2023-11-28 20:38:51,386 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-28 20:38:51,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:38:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [673990753] [2023-11-28 20:38:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [673990753] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:38:51,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:38:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-28 20:38:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872322649] [2023-11-28 20:38:51,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:38:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-28 20:38:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:38:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-28 20:38:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=143, Unknown=5, NotChecked=140, Total=342 [2023-11-28 20:38:51,388 INFO L87 Difference]: Start difference. First operand 398 states and 502 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-28 20:39:00,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-28 20:39:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:39:03,852 INFO L93 Difference]: Finished difference Result 455 states and 518 transitions. [2023-11-28 20:39:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:39:03,854 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-28 20:39:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:39:03,856 INFO L225 Difference]: With dead ends: 455 [2023-11-28 20:39:03,856 INFO L226 Difference]: Without dead ends: 455 [2023-11-28 20:39:03,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=181, Unknown=5, NotChecked=160, Total=420 [2023-11-28 20:39:03,857 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 412 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2178 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-28 20:39:03,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1382 Invalid, 3385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1197 Invalid, 0 Unknown, 2178 Unchecked, 12.0s Time] [2023-11-28 20:39:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-11-28 20:39:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 397. [2023-11-28 20:39:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 251 states have (on average 1.8565737051792828) internal successors, (466), 372 states have internal predecessors, (466), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:39:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 500 transitions. [2023-11-28 20:39:03,868 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 500 transitions. Word has length 44 [2023-11-28 20:39:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:39:03,869 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 500 transitions. [2023-11-28 20:39:03,869 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-28 20:39:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 500 transitions. [2023-11-28 20:39:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-28 20:39:03,869 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:39:03,870 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-28 20:39:03,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:04,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:39:04,070 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 138 more)] === [2023-11-28 20:39:04,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:39:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1680697780, now seen corresponding path program 1 times [2023-11-28 20:39:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:39:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121976306] [2023-11-28 20:39:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:39:04,071 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-28 20:39:04,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:39:04,072 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:04,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:39:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:39:05,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-28 20:39:05,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:39:05,352 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-28 20:39:05,353 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 19 treesize of output 22 [2023-11-28 20:39:05,471 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-28 20:39:05,542 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-28 20:39:05,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-28 20:39:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-28 20:39:05,692 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 14 treesize of output 10 [2023-11-28 20:39:05,985 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 56 treesize of output 34 [2023-11-28 20:39:06,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2023-11-28 20:39:06,538 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-28 20:39:06,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 90 [2023-11-28 20:39:06,562 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 33 treesize of output 14 [2023-11-28 20:39:07,295 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2023-11-28 20:39:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 90 [2023-11-28 20:39:07,319 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 33 treesize of output 14 [2023-11-28 20:39:07,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 62 treesize of output 20 [2023-11-28 20:39:07,658 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 10 treesize of output 3 [2023-11-28 20:39:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-28 20:39:07,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:39:08,700 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~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1485 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1486) |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~mem184#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd .cse2 (_ bv1 64) .cse1)))))) is different from false [2023-11-28 20:39:08,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1485 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1485) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd (_ bv1 64) .cse3 .cse2))))))) is different from false [2023-11-28 20:39:08,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1483) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1485 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1484))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1483) .cse3 v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1485) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-28 20:39:18,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|) (bvadd |c_ULTIMATE.start_main_~mem_track~0#1.offset| .cse7) |c_ULTIMATE.start_main_#t~mem181#1.base|))) (.cse4 (bvadd .cse7 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1481) .cse2 v_ArrVal_1483) (select (select (store .cse3 .cse2 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1485 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse3 .cse2 v_ArrVal_1484))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1481) .cse2 v_ArrVal_1483) .cse5 v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1485) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-28 20:39:20,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)))) (let ((.cse4 (bvadd .cse7 |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|) (bvadd |c_ULTIMATE.start_main_~mem_track~0#1.offset| .cse7) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1481) .cse2 v_ArrVal_1483) (select (select (store .cse3 .cse2 v_ArrVal_1484) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1484 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1483 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1486 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1485 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1481 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store .cse3 .cse2 v_ArrVal_1484))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1481) .cse2 v_ArrVal_1483) .cse5 v_ArrVal_1486) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1485) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))) is different from false [2023-11-28 20:39:20,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:20,352 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 366 treesize of output 354 [2023-11-28 20:39:20,520 INFO L349 Elim1Store]: treesize reduction 30, result has 47.4 percent of original size [2023-11-28 20:39:20,520 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 2 case distinctions, treesize of input 148 treesize of output 97 [2023-11-28 20:39:20,558 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-28 20:39:20,559 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 160 treesize of output 124 [2023-11-28 20:39:20,569 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 779 treesize of output 716 [2023-11-28 20:39:20,629 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 158 treesize of output 130 [2023-11-28 20:39:20,684 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 130 treesize of output 102 [2023-11-28 20:39:20,770 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 74 [2023-11-28 20:39:20,792 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 24 treesize of output 10 [2023-11-28 20:39:20,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:20,944 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 388 treesize of output 389 [2023-11-28 20:39:20,954 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:39:21,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:39:21,016 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 2 case distinctions, treesize of input 183 treesize of output 93 [2023-11-28 20:39:21,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:39:21,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 79 [2023-11-28 20:39:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:39:21,045 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-28 20:39:21,053 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-28 20:39:22,055 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-28 20:39:22,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:39:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121976306] [2023-11-28 20:39:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121976306] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:39:22,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:39:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-28 20:39:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865120331] [2023-11-28 20:39:22,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:39:22,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:39:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:39:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:39:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=247, Unknown=11, NotChecked=180, Total=506 [2023-11-28 20:39:22,057 INFO L87 Difference]: Start difference. First operand 397 states and 500 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 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-28 20:39:52,063 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 [1] [2023-11-28 20:39:59,937 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 [1] [2023-11-28 20:40:14,384 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-28 20:40:18,395 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 [0] [2023-11-28 20:40:20,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-28 20:40:24,998 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-28 20:40:29,010 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-28 20:40:33,017 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-28 20:40:37,029 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-28 20:40:41,360 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 [1] [2023-11-28 20:40:45,372 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-28 20:40:49,387 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-28 20:40:53,397 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-28 20:40:57,431 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 [1] [2023-11-28 20:41:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:15,573 INFO L93 Difference]: Finished difference Result 491 states and 557 transitions. [2023-11-28 20:41:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 20:41:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 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-28 20:41:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:15,581 INFO L225 Difference]: With dead ends: 491 [2023-11-28 20:41:15,581 INFO L226 Difference]: Without dead ends: 491 [2023-11-28 20:41:15,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=195, Invalid=624, Unknown=13, NotChecked=290, Total=1122 [2023-11-28 20:41:15,582 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 675 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 42 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 2216 IncrementalHoareTripleChecker+Unchecked, 100.1s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:15,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1655 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2456 Invalid, 13 Unknown, 2216 Unchecked, 100.1s Time] [2023-11-28 20:41:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-11-28 20:41:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 409. [2023-11-28 20:41:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 263 states have (on average 1.832699619771863) internal successors, (482), 384 states have internal predecessors, (482), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:41:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 516 transitions. [2023-11-28 20:41:15,590 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 516 transitions. Word has length 44 [2023-11-28 20:41:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:15,590 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 516 transitions. [2023-11-28 20:41:15,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 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-28 20:41:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 516 transitions. [2023-11-28 20:41:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-28 20:41:15,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:15,591 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:15,601 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:15,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:41:15,791 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 138 more)] === [2023-11-28 20:41:15,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -968451019, now seen corresponding path program 1 times [2023-11-28 20:41:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:41:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566036006] [2023-11-28 20:41:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:41:15,793 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-28 20:41:15,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:41:15,794 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:15,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:41:16,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:41:16,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:41:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-28 20:41:16,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:41:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-28 20:41:16,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:41:16,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566036006] [2023-11-28 20:41:16,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566036006] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:41:16,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:41:16,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-28 20:41:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986795668] [2023-11-28 20:41:16,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:41:16,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:41:16,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:41:16,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:41:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-28 20:41:16,435 INFO L87 Difference]: Start difference. First operand 409 states and 516 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-28 20:41:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:41:18,073 INFO L93 Difference]: Finished difference Result 430 states and 534 transitions. [2023-11-28 20:41:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:41:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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 48 [2023-11-28 20:41:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:41:18,079 INFO L225 Difference]: With dead ends: 430 [2023-11-28 20:41:18,079 INFO L226 Difference]: Without dead ends: 430 [2023-11-28 20:41:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-28 20:41:18,079 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 29 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-28 20:41:18,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1192 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-28 20:41:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-28 20:41:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 423. [2023-11-28 20:41:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 277 states have (on average 1.8050541516245486) internal successors, (500), 398 states have internal predecessors, (500), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-28 20:41:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 534 transitions. [2023-11-28 20:41:18,088 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 534 transitions. Word has length 48 [2023-11-28 20:41:18,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:41:18,088 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 534 transitions. [2023-11-28 20:41:18,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-28 20:41:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 534 transitions. [2023-11-28 20:41:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-28 20:41:18,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:41:18,089 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:41:18,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:18,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:41:18,289 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 138 more)] === [2023-11-28 20:41:18,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:41:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1409841484, now seen corresponding path program 2 times [2023-11-28 20:41:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:41:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76489923] [2023-11-28 20:41:18,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:41:18,290 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-28 20:41:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:41:18,291 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:18,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0804182-dbad-4f1a-a041-392ad2ad44db/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-28 20:41:19,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:41:19,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:41:19,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-28 20:41:19,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:41:19,533 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-28 20:41:19,710 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-28 20:41:19,710 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-28 20:41:19,730 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-28 20:41:19,857 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-28 20:41:19,898 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-28 20:41:20,107 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-28 20:41:20,116 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-28 20:41:20,511 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:41:20,511 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-28 20:41:20,528 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-28 20:41:21,055 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:41:21,056 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-28 20:41:21,095 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-28 20:41:21,655 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:41:21,656 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-28 20:41:21,673 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-28 20:41:22,332 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-28 20:41:22,332 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-28 20:41:22,372 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-28 20:41:22,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-11-28 20:41:22,691 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-28 20:41:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-28 20:41:22,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:41:23,857 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~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd (_ bv1 64) .cse2 .cse1)))))) is different from false [2023-11-28 20:41:23,998 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#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_1762 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-11-28 20:41:24,260 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~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1761))) (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~mem184#1.base| v_ArrVal_1760) .cse1 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1760) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse4) (bvadd .cse0 (_ bv1 64) .cse4)))))) is different from false [2023-11-28 20:41:25,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1760) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1761))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1760) .cse4 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-28 20:41:25,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1759))) (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~mem184#1.base| v_ArrVal_1758) .cse2 v_ArrVal_1760) (select (select (store .cse3 .cse2 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1762))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem184#1.base| v_ArrVal_1759))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1761))) (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~mem184#1.base| v_ArrVal_1758) .cse5 v_ArrVal_1760) .cse6 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-28 20:41:30,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1759))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1758) .cse3 v_ArrVal_1760) (select (select (store .cse4 .cse3 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1762))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1759))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1761))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1758) .cse6 v_ArrVal_1760) .cse7 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))) is different from false [2023-11-28 20:41:34,773 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv3 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1757))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1759))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1756) .cse2 v_ArrVal_1758) .cse3 v_ArrVal_1760) (select (select (store .cse4 .cse3 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1762))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1757))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1759))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1761))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem182#1.base| v_ArrVal_1756) .cse7 v_ArrVal_1758) .cse8 v_ArrVal_1760) .cse9 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-28 20:41:39,726 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv3 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1757))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1759))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1756) .cse3 v_ArrVal_1758) .cse4 v_ArrVal_1760) (select (select (store .cse5 .cse4 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1762))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1757))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse12 (store .cse13 .cse8 v_ArrVal_1759))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse11 (store .cse12 .cse9 v_ArrVal_1761))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1756) .cse8 v_ArrVal_1758) .cse9 v_ArrVal_1760) .cse10 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))))))) is different from false [2023-11-28 20:41:45,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv3 32))) (.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~5#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_1757))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_1759))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1754) .cse2 v_ArrVal_1756) .cse3 v_ArrVal_1758) .cse4 v_ArrVal_1760) (select (select (store .cse5 .cse4 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_1762))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1754 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse9 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse15 (store .cse16 .cse9 v_ArrVal_1757))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_1759))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_1761))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1754) .cse9 v_ArrVal_1756) .cse10 v_ArrVal_1758) .cse11 v_ArrVal_1760) .cse12 v_ArrVal_1762) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse13 .cse12 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)))))))))))))) is different from false [2023-11-28 20:41:45,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:41:45,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 899 treesize of output 900 [2023-11-28 20:41:45,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-28 20:41:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 497 [2023-11-28 20:41:46,716 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 42299269509 treesize of output 38541059814