./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:59:54,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:59:54,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:59:54,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:59:54,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:59:54,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:59:54,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:59:54,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:59:54,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:59:54,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:59:54,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:59:54,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:59:54,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:59:54,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:59:54,895 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:59:54,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:59:54,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:59:54,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:59:54,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:59:54,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:59:54,899 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:59:54,902 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:59:54,903 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:59:54,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:59:54,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:59:54,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:59:54,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:59:54,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:59:54,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:59:54,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:59:54,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:59:54,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:59:54,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:59:54,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:54,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:59:54,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:59:54,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:59:54,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:59:54,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:59:54,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:59:54,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:59:54,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:59:54,909 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2024-10-14 17:59:55,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:59:55,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:59:55,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:59:55,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:59:55,190 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:59:55,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2024-10-14 17:59:56,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:59:56,916 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:59:56,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2024-10-14 17:59:56,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6d8ca63/6b8625264b2c4468bb4a49e4969d8376/FLAG5b511c707 [2024-10-14 17:59:56,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f6d8ca63/6b8625264b2c4468bb4a49e4969d8376 [2024-10-14 17:59:56,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:59:56,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:59:56,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:56,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:59:56,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:59:56,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:56" (1/1) ... [2024-10-14 17:59:56,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb5159f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:56, skipping insertion in model container [2024-10-14 17:59:56,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:59:56" (1/1) ... [2024-10-14 17:59:57,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:59:57,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:59:57,462 ERROR L321 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) [2024-10-14 17:59:57,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2885f79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:59:57, skipping insertion in model container [2024-10-14 17:59:57,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:59:57,463 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:59:57,466 INFO L158 Benchmark]: Toolchain (without parser) took 516.02ms. Allocated memory is still 180.4MB. Free memory was 145.7MB in the beginning and 129.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 17:59:57,467 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:59:57,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.35ms. Allocated memory is still 180.4MB. Free memory was 145.7MB in the beginning and 129.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 17:59:57,469 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 180.4MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.35ms. Allocated memory is still 180.4MB. Free memory was 145.7MB in the beginning and 129.6MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:59:59,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:59:59,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 17:59:59,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:59:59,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:59:59,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:59:59,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:59:59,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:59:59,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:59:59,692 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:59:59,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:59:59,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:59:59,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:59:59,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:59:59,696 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:59:59,696 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:59:59,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:59:59,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:59:59,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:59:59,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:59:59,698 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:59:59,701 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:59:59,702 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:59:59,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:59:59,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:59:59,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:59:59,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:59:59,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:59:59,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:59:59,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:59:59,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:59:59,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:59:59,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:59:59,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:59:59,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:59:59,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:59:59,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:59:59,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:59:59,711 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:59:59,711 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:59:59,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:59:59,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:59:59,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:59:59,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:59:59,712 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:59:59,712 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2024-10-14 18:00:00,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:00:00,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:00:00,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:00:00,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:00:00,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:00:00,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2024-10-14 18:00:01,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:00:01,798 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:00:01,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2024-10-14 18:00:01,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/314d9e8d0/b1d6d3a4a2e74e59bb85353d7a6f2a74/FLAGf40ca883a [2024-10-14 18:00:01,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/314d9e8d0/b1d6d3a4a2e74e59bb85353d7a6f2a74 [2024-10-14 18:00:01,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:00:01,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:00:01,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:00:01,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:00:01,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:00:01,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:00:01" (1/1) ... [2024-10-14 18:00:01,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bcd324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:01, skipping insertion in model container [2024-10-14 18:00:01,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:00:01" (1/1) ... [2024-10-14 18:00:01,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:00:02,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:00:02,360 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 18:00:02,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:00:02,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:00:02,439 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:00:02,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:00:02,556 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:00:02,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02 WrapperNode [2024-10-14 18:00:02,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:00:02,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:00:02,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:00:02,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:00:02,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,587 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,613 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 93 [2024-10-14 18:00:02,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:00:02,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:00:02,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:00:02,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:00:02,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,667 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-10-14 18:00:02,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:00:02,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:00:02,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:00:02,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:00:02,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (1/1) ... [2024-10-14 18:00:02,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:00:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:00:02,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 18:00:02,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 18:00:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-14 18:00:02,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-14 18:00:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2024-10-14 18:00:02,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2024-10-14 18:00:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:00:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:00:02,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:00:02,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:00:02,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:00:02,921 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:00:02,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:00:03,318 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-10-14 18:00:03,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:00:03,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:00:03,381 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 18:00:03,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:00:03 BoogieIcfgContainer [2024-10-14 18:00:03,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:00:03,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:00:03,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:00:03,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:00:03,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:00:01" (1/3) ... [2024-10-14 18:00:03,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759615ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:00:03, skipping insertion in model container [2024-10-14 18:00:03,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:00:02" (2/3) ... [2024-10-14 18:00:03,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@759615ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:00:03, skipping insertion in model container [2024-10-14 18:00:03,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:00:03" (3/3) ... [2024-10-14 18:00:03,403 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2024-10-14 18:00:03,421 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:00:03,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-14 18:00:03,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:00:03,483 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@34d5f664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:00:03,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-14 18:00:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 66 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:00:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:00:03,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:03,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:03,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:03,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash -70758869, now seen corresponding path program 1 times [2024-10-14 18:00:03,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:03,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507257390] [2024-10-14 18:00:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:03,520 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 [2024-10-14 18:00:03,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:03,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:03,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:03,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:00:03,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:03,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:03,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:03,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507257390] [2024-10-14 18:00:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507257390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953502560] [2024-10-14 18:00:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:03,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:03,735 INFO L87 Difference]: Start difference. First operand has 75 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 66 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-14 18:00:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:03,936 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2024-10-14 18:00:03,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 10 [2024-10-14 18:00:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:03,951 INFO L225 Difference]: With dead ends: 133 [2024-10-14 18:00:03,952 INFO L226 Difference]: Without dead ends: 132 [2024-10-14 18:00:03,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:03,960 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 53 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:03,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 263 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:00:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-14 18:00:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 78. [2024-10-14 18:00:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 18:00:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-10-14 18:00:04,020 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 10 [2024-10-14 18:00:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:04,020 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-10-14 18:00:04,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-14 18:00:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-10-14 18:00:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 18:00:04,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:04,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:04,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Ended with exit code 0 [2024-10-14 18:00:04,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:04,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:04,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 816744812, now seen corresponding path program 1 times [2024-10-14 18:00:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:04,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937371448] [2024-10-14 18:00:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:04,226 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 [2024-10-14 18:00:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:04,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:04,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:04,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:00:04,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:04,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:04,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937371448] [2024-10-14 18:00:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937371448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:00:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392071314] [2024-10-14 18:00:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:04,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:00:04,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:00:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:00:04,332 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-14 18:00:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:04,601 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2024-10-14 18:00:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:00:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2024-10-14 18:00:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:04,604 INFO L225 Difference]: With dead ends: 138 [2024-10-14 18:00:04,604 INFO L226 Difference]: Without dead ends: 136 [2024-10-14 18:00:04,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:00:04,606 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 58 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:04,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 257 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:00:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-14 18:00:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 74. [2024-10-14 18:00:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 39 states have (on average 1.794871794871795) internal successors, (70), 65 states have internal predecessors, (70), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 18:00:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-14 18:00:04,624 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 10 [2024-10-14 18:00:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:04,624 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-14 18:00:04,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-14 18:00:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-14 18:00:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:00:04,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:04,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:04,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:04,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:04,827 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:04,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:04,828 INFO L85 PathProgramCache]: Analyzing trace with hash -826532228, now seen corresponding path program 1 times [2024-10-14 18:00:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:04,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576277696] [2024-10-14 18:00:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:04,831 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 [2024-10-14 18:00:04,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:04,833 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:04,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:04,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:00:04,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:04,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:04,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576277696] [2024-10-14 18:00:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576277696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951006625] [2024-10-14 18:00:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:04,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:04,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:04,963 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:00:05,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:05,078 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2024-10-14 18:00:05,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:05,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-10-14 18:00:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:05,082 INFO L225 Difference]: With dead ends: 123 [2024-10-14 18:00:05,082 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:00:05,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:05,084 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 44 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:05,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 292 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:00:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:00:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2024-10-14 18:00:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 68 states have internal predecessors, (73), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-10-14 18:00:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-14 18:00:05,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2024-10-14 18:00:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:05,096 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-14 18:00:05,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 18:00:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-14 18:00:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:00:05,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:05,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:05,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:05,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:05,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:05,302 INFO L85 PathProgramCache]: Analyzing trace with hash -826532239, now seen corresponding path program 1 times [2024-10-14 18:00:05,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:05,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228877280] [2024-10-14 18:00:05,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:05,303 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 [2024-10-14 18:00:05,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:05,310 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:05,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:05,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:00:05,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:05,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:00:05,580 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-14 18:00:05,655 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-14 18:00:05,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 18:00:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:00:05,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:05,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228877280] [2024-10-14 18:00:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228877280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:05,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:05,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-14 18:00:05,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001232491] [2024-10-14 18:00:05,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:05,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:00:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:00:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-14 18:00:05,946 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:06,314 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2024-10-14 18:00:06,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:00:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 16 [2024-10-14 18:00:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:06,316 INFO L225 Difference]: With dead ends: 103 [2024-10-14 18:00:06,316 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 18:00:06,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-10-14 18:00:06,317 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:06,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 256 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 260 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2024-10-14 18:00:06,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 18:00:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-14 18:00:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 76 states have internal predecessors, (87), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-14 18:00:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2024-10-14 18:00:06,324 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 16 [2024-10-14 18:00:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:06,325 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2024-10-14 18:00:06,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2024-10-14 18:00:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:00:06,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:06,329 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:06,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:06,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:06,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:06,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash -826532238, now seen corresponding path program 1 times [2024-10-14 18:00:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363592886] [2024-10-14 18:00:06,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:06,534 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 [2024-10-14 18:00:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:06,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:06,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:06,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 18:00:06,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:06,634 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 [2024-10-14 18:00:06,644 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 [2024-10-14 18:00:06,805 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-14 18:00:06,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:06,841 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 [2024-10-14 18:00:06,859 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:00:06,860 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 [2024-10-14 18:00:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:00:06,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:07,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363592886] [2024-10-14 18:00:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363592886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:07,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [376429587] [2024-10-14 18:00:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:07,136 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:07,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:07,143 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-14 18:00:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:07,233 WARN L253 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 18:00:07,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:07,342 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 [2024-10-14 18:00:07,352 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 [2024-10-14 18:00:07,526 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:00:07,527 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 [2024-10-14 18:00:07,538 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 12 treesize of output 14 [2024-10-14 18:00:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:07,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [376429587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:12,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:12,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-10-14 18:00:12,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877209061] [2024-10-14 18:00:12,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 18:00:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 18:00:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=194, Unknown=2, NotChecked=28, Total=272 [2024-10-14 18:00:12,084 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:00:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:13,822 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2024-10-14 18:00:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:00:13,822 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16 [2024-10-14 18:00:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:13,824 INFO L225 Difference]: With dead ends: 210 [2024-10-14 18:00:13,824 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 18:00:13,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=71, Invalid=273, Unknown=2, NotChecked=34, Total=380 [2024-10-14 18:00:13,825 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 193 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 35 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:13,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 583 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 634 Invalid, 5 Unknown, 236 Unchecked, 1.5s Time] [2024-10-14 18:00:13,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 18:00:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 117. [2024-10-14 18:00:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 100 states have internal predecessors, (131), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-14 18:00:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 160 transitions. [2024-10-14 18:00:13,836 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 160 transitions. Word has length 16 [2024-10-14 18:00:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:13,837 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 160 transitions. [2024-10-14 18:00:13,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:00:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2024-10-14 18:00:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 18:00:13,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:13,838 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:13,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:14,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:14,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:14,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:14,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1119935246, now seen corresponding path program 1 times [2024-10-14 18:00:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:14,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339859299] [2024-10-14 18:00:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:14,241 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 [2024-10-14 18:00:14,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:14,242 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:14,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:14,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:00:14,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:14,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:14,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:14,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339859299] [2024-10-14 18:00:14,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339859299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:14,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:14,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:14,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471104361] [2024-10-14 18:00:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:14,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:14,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:14,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:14,392 INFO L87 Difference]: Start difference. First operand 117 states and 160 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:14,493 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-14 18:00:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-10-14 18:00:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:14,495 INFO L225 Difference]: With dead ends: 80 [2024-10-14 18:00:14,495 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 18:00:14,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:14,497 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:14,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:00:14,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 18:00:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 18:00:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 18:00:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-14 18:00:14,515 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 16 [2024-10-14 18:00:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:14,516 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-14 18:00:14,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 18:00:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-14 18:00:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 18:00:14,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:14,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:14,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:14,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:14,718 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:14,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1034808519, now seen corresponding path program 1 times [2024-10-14 18:00:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:14,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191652138] [2024-10-14 18:00:14,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:14,719 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 [2024-10-14 18:00:14,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:14,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:14,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:14,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 18:00:14,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:00:15,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:15,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191652138] [2024-10-14 18:00:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191652138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:15,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-14 18:00:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114075694] [2024-10-14 18:00:15,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:15,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:00:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:00:15,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:00:15,375 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:00:15,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:15,848 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-10-14 18:00:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:00:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 17 [2024-10-14 18:00:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:15,851 INFO L225 Difference]: With dead ends: 81 [2024-10-14 18:00:15,851 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 18:00:15,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 18:00:15,852 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 113 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:15,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 170 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:00:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 18:00:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-14 18:00:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.574468085106383) internal successors, (74), 68 states have internal predecessors, (74), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 18:00:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2024-10-14 18:00:15,858 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 17 [2024-10-14 18:00:15,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:15,858 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2024-10-14 18:00:15,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:00:15,859 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2024-10-14 18:00:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:00:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:15,859 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:15,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:16,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:16,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1294529984, now seen corresponding path program 1 times [2024-10-14 18:00:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63541881] [2024-10-14 18:00:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:16,069 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 [2024-10-14 18:00:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:16,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:16,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:16,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 18:00:16,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:16,495 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_22| (_ bv0 1))))) is different from true [2024-10-14 18:00:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:16,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:16,677 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-14 18:00:16,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-14 18:00:16,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63541881] [2024-10-14 18:00:16,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63541881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:16,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [620530277] [2024-10-14 18:00:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:16,933 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:16,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:16,935 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:16,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-14 18:00:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:17,009 WARN L253 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-14 18:00:17,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:17,237 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 [2024-10-14 18:00:17,560 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 5 treesize of output 3 [2024-10-14 18:00:17,699 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)) (_ bv0 1)) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_25| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_25| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~c11~0#1.base_25|))))) is different from true [2024-10-14 18:00:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:00:17,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:17,890 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-10-14 18:00:17,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2024-10-14 18:00:18,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [620530277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:18,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:18,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 15 [2024-10-14 18:00:18,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524836590] [2024-10-14 18:00:18,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:18,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 18:00:18,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 18:00:18,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=226, Unknown=2, NotChecked=62, Total=342 [2024-10-14 18:00:18,223 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:00:19,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:19,807 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2024-10-14 18:00:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:00:19,808 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2024-10-14 18:00:19,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:19,809 INFO L225 Difference]: With dead ends: 128 [2024-10-14 18:00:19,809 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 18:00:19,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=253, Unknown=2, NotChecked=66, Total=380 [2024-10-14 18:00:19,810 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 56 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:19,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 595 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 685 Invalid, 0 Unknown, 284 Unchecked, 1.5s Time] [2024-10-14 18:00:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 18:00:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 74. [2024-10-14 18:00:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.619047619047619) internal successors, (68), 64 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-14 18:00:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-14 18:00:19,817 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 20 [2024-10-14 18:00:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:19,818 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-14 18:00:19,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 18:00:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-14 18:00:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:00:19,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:19,819 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:19,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-14 18:00:20,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:20,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:20,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:20,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1421459932, now seen corresponding path program 1 times [2024-10-14 18:00:20,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:20,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98227940] [2024-10-14 18:00:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:20,221 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 [2024-10-14 18:00:20,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:20,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:20,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:20,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:00:20,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:20,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 18:00:20,410 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-14 18:00:20,460 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:00:20,460 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 [2024-10-14 18:00:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2024-10-14 18:00:20,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:20,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:20,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98227940] [2024-10-14 18:00:20,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98227940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:20,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:20,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2024-10-14 18:00:20,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614034433] [2024-10-14 18:00:20,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:20,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 18:00:20,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:20,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 18:00:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2024-10-14 18:00:20,771 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:00:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:21,415 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2024-10-14 18:00:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:00:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-14 18:00:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:21,416 INFO L225 Difference]: With dead ends: 92 [2024-10-14 18:00:21,416 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 18:00:21,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2024-10-14 18:00:21,417 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 41 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:21,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 260 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 247 Invalid, 0 Unknown, 102 Unchecked, 0.6s Time] [2024-10-14 18:00:21,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 18:00:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2024-10-14 18:00:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.588235294117647) internal successors, (81), 72 states have internal predecessors, (81), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-14 18:00:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2024-10-14 18:00:21,430 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 24 [2024-10-14 18:00:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:21,431 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2024-10-14 18:00:21,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 18:00:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2024-10-14 18:00:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:00:21,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:21,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:21,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:21,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1421459933, now seen corresponding path program 1 times [2024-10-14 18:00:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748962542] [2024-10-14 18:00:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:21,636 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 [2024-10-14 18:00:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:21,638 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:21,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:21,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 18:00:21,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:21,733 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 [2024-10-14 18:00:21,927 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|) |c_#length|)) is different from true [2024-10-14 18:00:21,969 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:00:21,970 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 12 treesize of output 14 [2024-10-14 18:00:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-14 18:00:22,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:22,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:22,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748962542] [2024-10-14 18:00:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748962542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1181475720] [2024-10-14 18:00:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:22,274 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:22,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:22,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:22,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-10-14 18:00:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:22,353 WARN L253 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 18:00:22,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:22,494 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 8 treesize of output 1 [2024-10-14 18:00:22,503 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 [2024-10-14 18:00:22,706 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 18:00:22,707 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 12 treesize of output 18 [2024-10-14 18:00:22,739 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 8 treesize of output 1 [2024-10-14 18:00:23,071 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:00:23,071 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 12 treesize of output 14 [2024-10-14 18:00:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 18:00:23,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1181475720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:23,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:00:23,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-10-14 18:00:23,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466397447] [2024-10-14 18:00:23,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:00:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:00:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:00:23,216 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:00:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:24,773 INFO L93 Difference]: Finished difference Result 204 states and 237 transitions. [2024-10-14 18:00:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 18:00:24,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-10-14 18:00:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:24,775 INFO L225 Difference]: With dead ends: 204 [2024-10-14 18:00:24,775 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 18:00:24,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2024-10-14 18:00:24,776 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 150 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:24,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 797 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 18:00:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 18:00:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 105. [2024-10-14 18:00:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 90 states have internal predecessors, (113), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-14 18:00:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-10-14 18:00:24,802 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 24 [2024-10-14 18:00:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:24,803 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-10-14 18:00:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:00:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-10-14 18:00:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:00:24,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:24,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:24,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:25,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:25,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:25,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:25,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash 915901307, now seen corresponding path program 1 times [2024-10-14 18:00:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910072737] [2024-10-14 18:00:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:25,206 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 [2024-10-14 18:00:25,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:25,208 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:25,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:25,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:00:25,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:25,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:25,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910072737] [2024-10-14 18:00:25,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910072737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:25,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:25,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819858405] [2024-10-14 18:00:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:25,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:25,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:25,310 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:25,375 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2024-10-14 18:00:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:25,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-14 18:00:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:25,376 INFO L225 Difference]: With dead ends: 95 [2024-10-14 18:00:25,376 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 18:00:25,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:25,377 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:25,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:00:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 18:00:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-14 18:00:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 80 states have internal predecessors, (98), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-10-14 18:00:25,382 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 24 [2024-10-14 18:00:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:25,382 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-10-14 18:00:25,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-10-14 18:00:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:25,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:25,383 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:25,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:25,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:25,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:25,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1115588132, now seen corresponding path program 1 times [2024-10-14 18:00:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348897155] [2024-10-14 18:00:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:25,585 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 [2024-10-14 18:00:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:25,587 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:25,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:25,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 18:00:25,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:25,679 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 8 treesize of output 1 [2024-10-14 18:00:25,710 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2024-10-14 18:00:25,735 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-14 18:00:25,735 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 [2024-10-14 18:00:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:00:25,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:25,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348897155] [2024-10-14 18:00:25,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348897155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:25,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:25,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54908641] [2024-10-14 18:00:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:25,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 18:00:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 18:00:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-10-14 18:00:25,772 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:26,067 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2024-10-14 18:00:26,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:00:26,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-10-14 18:00:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:26,068 INFO L225 Difference]: With dead ends: 107 [2024-10-14 18:00:26,068 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 18:00:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-10-14 18:00:26,069 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 53 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:26,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 212 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 129 Invalid, 0 Unknown, 126 Unchecked, 0.3s Time] [2024-10-14 18:00:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 18:00:26,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-10-14 18:00:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 79 states have internal predecessors, (97), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2024-10-14 18:00:26,074 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 25 [2024-10-14 18:00:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:26,074 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2024-10-14 18:00:26,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-14 18:00:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2024-10-14 18:00:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:26,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:26,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:26,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 18:00:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:26,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:26,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:26,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1115588133, now seen corresponding path program 1 times [2024-10-14 18:00:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:26,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515690017] [2024-10-14 18:00:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:26,280 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 [2024-10-14 18:00:26,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:26,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:26,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:26,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 18:00:26,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:26,375 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 [2024-10-14 18:00:26,386 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 [2024-10-14 18:00:26,559 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-10-14 18:00:26,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:26,589 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 [2024-10-14 18:00:26,619 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:00:26,619 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 [2024-10-14 18:00:26,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:26,778 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 [2024-10-14 18:00:26,811 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:00:26,812 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 [2024-10-14 18:00:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-10-14 18:00:26,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:27,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515690017] [2024-10-14 18:00:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515690017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:27,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1178406792] [2024-10-14 18:00:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:27,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:27,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:27,216 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:27,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-10-14 18:00:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:27,303 WARN L253 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-14 18:00:27,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:27,410 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 8 treesize of output 1 [2024-10-14 18:00:27,415 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 [2024-10-14 18:00:27,535 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 18:00:27,536 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 12 treesize of output 18 [2024-10-14 18:00:27,549 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 8 treesize of output 1 [2024-10-14 18:00:27,686 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 8 treesize of output 1 [2024-10-14 18:00:27,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:00:27,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:00:27,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:00:27,794 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 23 treesize of output 27 [2024-10-14 18:00:27,802 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 7 treesize of output 5 [2024-10-14 18:00:28,113 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:00:28,113 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 [2024-10-14 18:00:28,151 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-10-14 18:00:28,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2024-10-14 18:00:28,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-14 18:00:28,517 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:00:28,517 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 15 treesize of output 7 [2024-10-14 18:00:28,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:00:28,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:28,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1178406792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:28,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:00:28,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 21 [2024-10-14 18:00:28,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682351691] [2024-10-14 18:00:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:28,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 18:00:28,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 18:00:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=484, Unknown=1, NotChecked=44, Total=600 [2024-10-14 18:00:28,599 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:00:33,437 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 [0] [2024-10-14 18:00:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:34,098 INFO L93 Difference]: Finished difference Result 126 states and 144 transitions. [2024-10-14 18:00:34,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:00:34,099 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-10-14 18:00:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:34,100 INFO L225 Difference]: With dead ends: 126 [2024-10-14 18:00:34,100 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 18:00:34,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=614, Unknown=1, NotChecked=50, Total=756 [2024-10-14 18:00:34,101 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 70 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:34,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 657 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 680 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 18:00:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 18:00:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2024-10-14 18:00:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 87 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-14 18:00:34,106 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 25 [2024-10-14 18:00:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:34,106 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-14 18:00:34,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 18:00:34,106 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-14 18:00:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:34,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:34,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:34,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:34,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-14 18:00:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:34,508 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1115584869, now seen corresponding path program 1 times [2024-10-14 18:00:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249373655] [2024-10-14 18:00:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:34,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:34,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:34,510 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:34,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:34,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:00:34,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:00:34,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:34,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:34,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249373655] [2024-10-14 18:00:34,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249373655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:34,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:34,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:34,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224990993] [2024-10-14 18:00:34,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:34,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:34,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:34,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:34,603 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:00:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:34,727 INFO L93 Difference]: Finished difference Result 148 states and 192 transitions. [2024-10-14 18:00:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-14 18:00:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:34,731 INFO L225 Difference]: With dead ends: 148 [2024-10-14 18:00:34,731 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 18:00:34,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:34,731 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 30 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:34,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 338 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:00:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 18:00:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 102. [2024-10-14 18:00:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.536231884057971) internal successors, (106), 87 states have internal predecessors, (106), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2024-10-14 18:00:34,742 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 25 [2024-10-14 18:00:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:34,744 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2024-10-14 18:00:34,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:00:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2024-10-14 18:00:34,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:34,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:34,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:34,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:34,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:34,946 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:34,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:34,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2003091814, now seen corresponding path program 1 times [2024-10-14 18:00:34,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245075756] [2024-10-14 18:00:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:34,947 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 [2024-10-14 18:00:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:34,949 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:35,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:00:35,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:00:35,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:00:35,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245075756] [2024-10-14 18:00:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245075756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:00:35,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:00:35,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 18:00:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399185198] [2024-10-14 18:00:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:00:35,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:00:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:00:35,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:35,088 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:00:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:35,175 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-10-14 18:00:35,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:00:35,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-14 18:00:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:35,176 INFO L225 Difference]: With dead ends: 99 [2024-10-14 18:00:35,177 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 18:00:35,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:00:35,177 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:35,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:00:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 18:00:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-14 18:00:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 84 states have internal predecessors, (102), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2024-10-14 18:00:35,181 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 25 [2024-10-14 18:00:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:35,182 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2024-10-14 18:00:35,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 18:00:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2024-10-14 18:00:35,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:00:35,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:35,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:35,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:35,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:35,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:35,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2003088550, now seen corresponding path program 1 times [2024-10-14 18:00:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:35,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286533411] [2024-10-14 18:00:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:35,385 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 [2024-10-14 18:00:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:35,386 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:35,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 18:00:35,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 18:00:35,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:00:36,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:36,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286533411] [2024-10-14 18:00:36,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286533411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:00:36,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:00:36,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-10-14 18:00:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833887452] [2024-10-14 18:00:36,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:00:36,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 18:00:36,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:00:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 18:00:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:00:36,031 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:00:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:00:36,446 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2024-10-14 18:00:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:00:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 25 [2024-10-14 18:00:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:00:36,448 INFO L225 Difference]: With dead ends: 98 [2024-10-14 18:00:36,448 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 18:00:36,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:00:36,448 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 166 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 18:00:36,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 230 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 18:00:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 18:00:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 18:00:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.492537313432836) internal successors, (100), 83 states have internal predecessors, (100), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-14 18:00:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-10-14 18:00:36,452 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 25 [2024-10-14 18:00:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:00:36,453 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-10-14 18:00:36,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:00:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-10-14 18:00:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:00:36,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:00:36,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:00:36,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:36,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:00:36,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:00:36,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:00:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash 223496711, now seen corresponding path program 1 times [2024-10-14 18:00:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:00:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339792044] [2024-10-14 18:00:36,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:36,656 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 [2024-10-14 18:00:36,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:00:36,657 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:00:36,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 [2024-10-14 18:00:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:36,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 18:00:36,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:36,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:00:36,874 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 [2024-10-14 18:00:37,100 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-14 18:00:37,100 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 54 treesize of output 44 [2024-10-14 18:00:37,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:00:37,158 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-14 18:00:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-14 18:00:37,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:00:37,352 INFO L349 Elim1Store]: treesize reduction 7, result has 68.2 percent of original size [2024-10-14 18:00:37,353 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 69 treesize of output 68 [2024-10-14 18:00:37,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:00:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339792044] [2024-10-14 18:00:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339792044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:00:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [398228687] [2024-10-14 18:00:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:00:37,459 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:00:37,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:00:37,462 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:00:37,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-14 18:00:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:00:37,567 WARN L253 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-14 18:00:37,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:00:37,755 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 [2024-10-14 18:00:37,763 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 [2024-10-14 18:00:37,958 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 18:00:37,958 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 12 treesize of output 18 [2024-10-14 18:00:37,987 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 18:00:37,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 18:00:38,134 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 8 treesize of output 1 [2024-10-14 18:00:38,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:00:38,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:00:38,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:00:38,242 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 18:00:38,254 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:00:38,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:00:42,608 INFO L349 Elim1Store]: treesize reduction 58, result has 28.4 percent of original size [2024-10-14 18:00:42,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-10-14 18:00:42,645 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:00:42,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 18:00:43,186 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2024-10-14 18:00:43,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 75 [2024-10-14 18:00:43,226 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-10-14 18:00:43,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2024-10-14 18:00:43,463 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-10-14 18:00:43,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 53 [2024-10-14 18:00:43,501 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-10-14 18:00:43,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-10-14 18:00:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 18:00:43,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:01:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [398228687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:01:00,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 18:01:00,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2024-10-14 18:01:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453215857] [2024-10-14 18:01:00,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 18:01:00,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 18:01:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 18:01:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 18:01:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1117, Unknown=5, NotChecked=0, Total=1260 [2024-10-14 18:01:00,177 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 21 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:01:04,255 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 [0] [2024-10-14 18:01:08,278 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 [0] [2024-10-14 18:01:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:01:11,651 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2024-10-14 18:01:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 18:01:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 21 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2024-10-14 18:01:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:01:11,652 INFO L225 Difference]: With dead ends: 117 [2024-10-14 18:01:11,652 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 18:01:11,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=233, Invalid=1568, Unknown=5, NotChecked=0, Total=1806 [2024-10-14 18:01:11,653 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 154 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:01:11,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 446 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 736 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2024-10-14 18:01:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 18:01:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 78. [2024-10-14 18:01:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 66 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-14 18:01:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-10-14 18:01:11,660 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 26 [2024-10-14 18:01:11,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:01:11,661 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-10-14 18:01:11,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 21 states have internal predecessors, (34), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-14 18:01:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-10-14 18:01:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:01:11,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:01:11,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:01:11,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-10-14 18:01:11,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 18:01:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 18:01:12,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-14 18:01:12,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:01:12,065 INFO L85 PathProgramCache]: Analyzing trace with hash 223496712, now seen corresponding path program 1 times [2024-10-14 18:01:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 18:01:12,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435468792] [2024-10-14 18:01:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:01:12,065 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 [2024-10-14 18:01:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 18:01:12,066 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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) [2024-10-14 18:01:12,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 18:01:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:01:12,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 18:01:12,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:01:12,150 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 [2024-10-14 18:01:12,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 18:01:12,270 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 [2024-10-14 18:01:12,447 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 11 treesize of output 7 [2024-10-14 18:01:12,469 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 11 treesize of output 7 [2024-10-14 18:01:12,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:01:12,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-14 18:01:12,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-14 18:01:13,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-14 18:01:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:01:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:01:13,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:01:13,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:01:13,475 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 50 treesize of output 54 [2024-10-14 18:01:13,605 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_330 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_entry_point_~cfg~1#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_330) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_6) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (_ bv0 32)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_6) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_~cfg~1#1.offset|))) (forall ((v_ArrVal_329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_329) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-10-14 18:01:13,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 18:01:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435468792] [2024-10-14 18:01:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435468792] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:01:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [616226106] [2024-10-14 18:01:13,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:01:13,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 18:01:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 18:01:13,762 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 18:01:13,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-14 18:01:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:01:13,856 WARN L253 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-14 18:01:13,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:01:18,257 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 [2024-10-14 18:01:18,279 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 [2024-10-14 18:01:22,760 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 18:01:22,760 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 12 treesize of output 18 [2024-10-14 18:01:22,850 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-10-14 18:01:22,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-10-14 18:01:23,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:01:23,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:01:23,313 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 8 treesize of output 1 [2024-10-14 18:01:23,529 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 18:01:23,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-14 18:01:23,544 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 7 treesize of output 5