./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0102-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:15:54,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:15:55,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:15:55,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:15:55,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:15:55,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:15:55,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:15:55,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:15:55,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:15:55,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:15:55,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:15:55,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:15:55,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:15:55,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:15:55,044 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:15:55,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:15:55,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:15:55,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:15:55,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:15:55,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:15:55,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:15:55,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:15:55,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2025-02-06 10:15:55,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:15:55,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:15:55,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:15:55,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:15:55,337 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:15:55,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2025-02-06 10:15:56,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/498456e19/b99714acf5bb48ceb5d71d78862846e3/FLAG8266db3ee [2025-02-06 10:15:56,841 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:15:56,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2025-02-06 10:15:56,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/498456e19/b99714acf5bb48ceb5d71d78862846e3/FLAG8266db3ee [2025-02-06 10:15:57,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/498456e19/b99714acf5bb48ceb5d71d78862846e3 [2025-02-06 10:15:57,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:15:57,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:15:57,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:15:57,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:15:57,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:15:57,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:15:57" (1/1) ... [2025-02-06 10:15:57,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e076742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:15:57, skipping insertion in model container [2025-02-06 10:15:57,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:15:57" (1/1) ... [2025-02-06 10:15:57,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:15:57,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:15:57,380 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) [2025-02-06 10:15:57,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64120707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:15:57, skipping insertion in model container [2025-02-06 10:15:57,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:15:57,381 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-02-06 10:15:57,382 INFO L158 Benchmark]: Toolchain (without parser) took 289.97ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:15:57,384 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:15:57,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.50ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:15:57,385 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 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.50ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:15:59,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:15:59,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 10:15:59,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:15:59,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:15:59,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:15:59,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:15:59,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:15:59,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:15:59,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:15:59,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:15:59,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:15:59,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:15:59,644 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:15:59,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:15:59,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:15:59,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:15:59,646 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> d10910cb8c44ec8f982d35122d9e66670129ee7c874265953b685f7f63a30072 [2025-02-06 10:15:59,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:15:59,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:15:59,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:15:59,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:15:59,951 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:15:59,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-2.i [2025-02-06 10:16:01,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/350c1ded6/32219b07f3554d9ca6741e2c97322717/FLAG6fd0b6637 [2025-02-06 10:16:01,401 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:16:01,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-2.i [2025-02-06 10:16:01,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/350c1ded6/32219b07f3554d9ca6741e2c97322717/FLAG6fd0b6637 [2025-02-06 10:16:01,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/350c1ded6/32219b07f3554d9ca6741e2c97322717 [2025-02-06 10:16:01,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:16:01,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:16:01,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:16:01,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:16:01,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:16:01,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b78c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01, skipping insertion in model container [2025-02-06 10:16:01,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:16:01,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:16:01,696 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-02-06 10:16:01,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:16:01,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:16:01,747 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:16:01,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:16:01,815 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:16:01,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01 WrapperNode [2025-02-06 10:16:01,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:16:01,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:16:01,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:16:01,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:16:01,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,856 INFO L138 Inliner]: procedures = 136, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-02-06 10:16:01,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:16:01,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:16:01,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:16:01,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:16:01,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,868 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,889 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2025-02-06 10:16:01,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:16:01,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:16:01,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:16:01,913 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:16:01,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (1/1) ... [2025-02-06 10:16:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:16:01,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:01,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:16:01,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-02-06 10:16:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2025-02-06 10:16:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:16:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:16:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:16:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 10:16:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 10:16:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:16:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:16:02,073 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:16:02,074 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:16:02,402 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L601: call ULTIMATE.dealloc(main_~#top~1#1.base, main_~#top~1#1.offset);havoc main_~#top~1#1.base, main_~#top~1#1.offset; [2025-02-06 10:16:02,428 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2025-02-06 10:16:02,428 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:16:02,434 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:16:02,437 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:16:02,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:16:02 BoogieIcfgContainer [2025-02-06 10:16:02,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:16:02,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:16:02,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:16:02,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:16:02,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:16:01" (1/3) ... [2025-02-06 10:16:02,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360517ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:16:02, skipping insertion in model container [2025-02-06 10:16:02,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:16:01" (2/3) ... [2025-02-06 10:16:02,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@360517ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:16:02, skipping insertion in model container [2025-02-06 10:16:02,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:16:02" (3/3) ... [2025-02-06 10:16:02,446 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0102-2.i [2025-02-06 10:16:02,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:16:02,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0102-2.i that has 3 procedures, 83 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2025-02-06 10:16:02,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:16:02,498 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;@21c50147, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:16:02,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-06 10:16:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 76 states have internal predecessors, (84), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:16:02,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:02,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:16:02,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:02,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 112575892, now seen corresponding path program 1 times [2025-02-06 10:16:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937439340] [2025-02-06 10:16:02,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:02,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:02,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:02,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:02,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:16:02,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:16:02,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:16:02,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:02,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:02,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 10:16:02,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:02,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:02,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937439340] [2025-02-06 10:16:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937439340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:02,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:16:02,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135771636] [2025-02-06 10:16:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:16:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:02,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:16:02,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:16:02,628 INFO L87 Difference]: Start difference. First operand has 83 states, 45 states have (on average 1.8666666666666667) internal successors, (84), 76 states have internal predecessors, (84), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:02,639 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-02-06 10:16:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:16:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:16:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:02,644 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:16:02,644 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:16:02,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:16:02,647 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:16:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:16:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:16:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-02-06 10:16:02,674 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2025-02-06 10:16:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:02,675 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-02-06 10:16:02,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-02-06 10:16:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:16:02,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:02,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:02,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:16:02,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:02,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:02,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 810586304, now seen corresponding path program 1 times [2025-02-06 10:16:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:02,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164068969] [2025-02-06 10:16:02,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:02,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:02,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:02,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:16:02,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:16:02,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:16:02,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:02,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:02,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 10:16:02,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:02,963 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 [2025-02-06 10:16:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:03,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:03,012 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164068969] [2025-02-06 10:16:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164068969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:16:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707314793] [2025-02-06 10:16:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:16:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:03,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:16:03,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:16:03,014 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:03,195 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2025-02-06 10:16:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:16:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:16:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:03,197 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:16:03,197 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:16:03,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:16:03,197 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:03,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 237 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:16:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:16:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-02-06 10:16:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 76 states have internal predecessors, (83), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2025-02-06 10:16:03,207 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 7 [2025-02-06 10:16:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:03,208 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2025-02-06 10:16:03,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2025-02-06 10:16:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:16:03,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:03,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:03,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:16:03,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:03,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:03,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash 810586303, now seen corresponding path program 1 times [2025-02-06 10:16:03,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:03,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1732217218] [2025-02-06 10:16:03,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:03,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:03,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:03,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:03,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:16:03,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:16:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:16:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:03,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 10:16:03,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:03,491 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 [2025-02-06 10:16:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:03,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:03,513 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732217218] [2025-02-06 10:16:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732217218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:16:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961989447] [2025-02-06 10:16:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:16:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:03,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:16:03,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:16:03,514 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:03,652 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-02-06 10:16:03,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:16:03,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:16:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:03,653 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:16:03,653 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:16:03,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:16:03,653 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 23 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:03,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 180 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:16:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:16:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:16:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 74 states have internal predecessors, (79), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-02-06 10:16:03,658 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 7 [2025-02-06 10:16:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-02-06 10:16:03,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-02-06 10:16:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:16:03,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:03,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:03,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:16:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:03,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2147277671, now seen corresponding path program 1 times [2025-02-06 10:16:03,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:03,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648409788] [2025-02-06 10:16:03,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:03,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:03,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:03,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:03,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:16:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:16:03,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:16:03,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:03,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:03,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 10:16:03,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:03,960 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 [2025-02-06 10:16:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:03,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:03,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:03,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648409788] [2025-02-06 10:16:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648409788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:03,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:16:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579251070] [2025-02-06 10:16:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:16:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:16:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:16:03,968 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:04,026 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-02-06 10:16:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:16:04,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:16:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:04,028 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:16:04,028 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:16:04,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:16:04,028 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:04,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:16:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:16:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 10:16:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 47 states have (on average 1.6595744680851063) internal successors, (78), 73 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-02-06 10:16:04,032 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 11 [2025-02-06 10:16:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:04,033 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-02-06 10:16:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-02-06 10:16:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:16:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:04,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:04,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:16:04,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:04,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2147277670, now seen corresponding path program 1 times [2025-02-06 10:16:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251039307] [2025-02-06 10:16:04,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:04,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:04,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:04,244 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:04,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:16:04,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:16:04,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:16:04,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:04,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:16:04,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:04,335 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 [2025-02-06 10:16:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:04,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:04,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251039307] [2025-02-06 10:16:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251039307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:04,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:04,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:16:04,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881123416] [2025-02-06 10:16:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:04,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:16:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:04,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:16:04,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:16:04,352 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:04,423 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-02-06 10:16:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:16:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:16:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:04,425 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:16:04,425 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:16:04,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:16:04,426 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:16:04,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:16:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 10:16:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 72 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-02-06 10:16:04,433 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 11 [2025-02-06 10:16:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:04,433 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-02-06 10:16:04,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-02-06 10:16:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:16:04,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:04,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:04,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:16:04,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:04,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:04,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash -306132288, now seen corresponding path program 1 times [2025-02-06 10:16:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1666102464] [2025-02-06 10:16:04,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:04,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:04,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:04,639 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:04,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:16:04,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:16:04,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:16:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:04,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 10:16:04,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:04,736 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 [2025-02-06 10:16:04,800 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-02-06 10:16:04,801 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 [2025-02-06 10:16:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:04,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:04,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:04,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666102464] [2025-02-06 10:16:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666102464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:04,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:04,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:16:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166129439] [2025-02-06 10:16:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:16:04,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:04,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:16:04,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:16:04,837 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:05,100 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2025-02-06 10:16:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:16:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:16:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:05,101 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:16:05,101 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:16:05,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:16:05,102 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:05,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 263 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:16:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:16:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2025-02-06 10:16:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 81 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-06 10:16:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-02-06 10:16:05,107 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 14 [2025-02-06 10:16:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:05,107 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-02-06 10:16:05,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-02-06 10:16:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:16:05,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:05,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:05,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:05,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -306132287, now seen corresponding path program 1 times [2025-02-06 10:16:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790060599] [2025-02-06 10:16:05,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:05,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:05,315 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:05,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:16:05,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:16:05,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:16:05,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:05,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:05,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:16:05,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:05,397 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 [2025-02-06 10:16:05,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-02-06 10:16:05,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:05,498 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 [2025-02-06 10:16:05,506 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:05,506 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 [2025-02-06 10:16:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:05,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:05,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790060599] [2025-02-06 10:16:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790060599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:05,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:16:05,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540637167] [2025-02-06 10:16:05,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:05,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:16:05,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:05,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:16:05,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:16:05,560 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:05,924 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2025-02-06 10:16:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:16:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:16:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:05,925 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:16:05,925 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:16:05,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:16:05,926 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:05,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 293 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:16:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:16:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2025-02-06 10:16:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.676056338028169) internal successors, (119), 97 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:16:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2025-02-06 10:16:05,930 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 14 [2025-02-06 10:16:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:05,930 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2025-02-06 10:16:05,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2025-02-06 10:16:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:16:05,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:05,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:05,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:06,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:06,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2135352579, now seen corresponding path program 1 times [2025-02-06 10:16:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461856350] [2025-02-06 10:16:06,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:06,138 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:06,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:16:06,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:16:06,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:16:06,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:06,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:06,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:16:06,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:06,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:06,214 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461856350] [2025-02-06 10:16:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461856350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:16:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285961710] [2025-02-06 10:16:06,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:06,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:16:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:06,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:16:06,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:16:06,216 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:06,290 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-02-06 10:16:06,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:16:06,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:16:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:06,291 INFO L225 Difference]: With dead ends: 107 [2025-02-06 10:16:06,291 INFO L226 Difference]: Without dead ends: 107 [2025-02-06 10:16:06,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:16:06,292 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:06,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 170 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:16:06,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-06 10:16:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-06 10:16:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 96 states have internal predecessors, (116), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:16:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2025-02-06 10:16:06,295 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 16 [2025-02-06 10:16:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2025-02-06 10:16:06,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2025-02-06 10:16:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:16:06,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:06,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:06,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:06,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2135352578, now seen corresponding path program 1 times [2025-02-06 10:16:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:06,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272518056] [2025-02-06 10:16:06,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:06,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:06,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:06,503 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:06,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:16:06,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:16:06,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:16:06,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:06,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:06,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-06 10:16:06,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:06,578 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 [2025-02-06 10:16:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:06,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:06,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:06,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272518056] [2025-02-06 10:16:06,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272518056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:06,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:06,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:16:06,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356074176] [2025-02-06 10:16:06,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:06,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:16:06,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:06,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:16:06,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:16:06,680 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:06,934 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2025-02-06 10:16:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:16:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:16:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:06,935 INFO L225 Difference]: With dead ends: 114 [2025-02-06 10:16:06,935 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 10:16:06,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:16:06,936 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:06,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 538 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:16:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 10:16:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2025-02-06 10:16:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.619718309859155) internal successors, (115), 96 states have internal predecessors, (115), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:16:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2025-02-06 10:16:06,939 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 16 [2025-02-06 10:16:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2025-02-06 10:16:06,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2025-02-06 10:16:06,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:16:06,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:06,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:06,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:16:07,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:07,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:07,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:07,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1771420513, now seen corresponding path program 1 times [2025-02-06 10:16:07,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:07,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288654003] [2025-02-06 10:16:07,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:07,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:07,144 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:07,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:16:07,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:16:07,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:16:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:07,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 10:16:07,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:07,226 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 [2025-02-06 10:16:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:07,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:07,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:07,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288654003] [2025-02-06 10:16:07,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288654003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:07,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:16:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278816155] [2025-02-06 10:16:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:16:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:07,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:16:07,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:16:07,286 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:07,499 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2025-02-06 10:16:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:16:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:16:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:07,500 INFO L225 Difference]: With dead ends: 112 [2025-02-06 10:16:07,500 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 10:16:07,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:16:07,501 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:07,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 241 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:16:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 10:16:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2025-02-06 10:16:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 95 states have internal predecessors, (110), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:16:07,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2025-02-06 10:16:07,505 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2025-02-06 10:16:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:07,505 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2025-02-06 10:16:07,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2025-02-06 10:16:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:16:07,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:07,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:07,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:07,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:07,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:07,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1771420512, now seen corresponding path program 1 times [2025-02-06 10:16:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:07,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137993108] [2025-02-06 10:16:07,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:07,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:07,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:07,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:07,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:16:07,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:16:07,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:16:07,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:07,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:07,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 10:16:07,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:07,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:16:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:07,866 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:07,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:07,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137993108] [2025-02-06 10:16:07,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137993108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:07,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:07,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:16:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546838565] [2025-02-06 10:16:07,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:16:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:07,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:16:07,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:16:07,867 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:08,057 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2025-02-06 10:16:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:16:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:16:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:08,057 INFO L225 Difference]: With dead ends: 110 [2025-02-06 10:16:08,058 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 10:16:08,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:16:08,058 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:08,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 256 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:16:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 10:16:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-02-06 10:16:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 95 states have internal predecessors, (106), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 10:16:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-02-06 10:16:08,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 17 [2025-02-06 10:16:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:08,061 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-02-06 10:16:08,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-02-06 10:16:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:16:08,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:08,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:08,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:16:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:08,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:08,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1528064004, now seen corresponding path program 1 times [2025-02-06 10:16:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294779162] [2025-02-06 10:16:08,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:08,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:08,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:08,269 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:08,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:16:08,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:16:08,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:16:08,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:08,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:16:08,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:08,366 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 [2025-02-06 10:16:08,370 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 [2025-02-06 10:16:08,443 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 [2025-02-06 10:16:08,467 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 [2025-02-06 10:16:08,472 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 19 treesize of output 18 [2025-02-06 10:16:08,510 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:08,510 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 [2025-02-06 10:16:08,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:08,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 10:16:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:08,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:08,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294779162] [2025-02-06 10:16:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294779162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:08,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:16:08,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977731961] [2025-02-06 10:16:08,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:08,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:16:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:08,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:16:08,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:16:08,670 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:09,311 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2025-02-06 10:16:09,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:16:09,312 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:16:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:09,316 INFO L225 Difference]: With dead ends: 117 [2025-02-06 10:16:09,316 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 10:16:09,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:16:09,317 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:09,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 448 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:16:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 10:16:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 10:16:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 105 states have internal predecessors, (117), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:16:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2025-02-06 10:16:09,320 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 19 [2025-02-06 10:16:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:09,320 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2025-02-06 10:16:09,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2025-02-06 10:16:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:16:09,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:09,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:09,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:09,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:09,524 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:09,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1528064003, now seen corresponding path program 1 times [2025-02-06 10:16:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:09,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997059129] [2025-02-06 10:16:09,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:09,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:09,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:09,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:16:09,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:16:09,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:16:09,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:16:09,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:09,636 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 [2025-02-06 10:16:09,639 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 [2025-02-06 10:16:09,698 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 [2025-02-06 10:16:09,704 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 [2025-02-06 10:16:09,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:16:09,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:16:09,798 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:09,798 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 [2025-02-06 10:16:09,806 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 [2025-02-06 10:16:09,857 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 16 treesize of output 11 [2025-02-06 10:16:09,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:09,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 10:16:09,983 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 7 treesize of output 3 [2025-02-06 10:16:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:10,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:16:10,040 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997059129] [2025-02-06 10:16:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997059129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:16:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:16:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 10:16:10,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482094349] [2025-02-06 10:16:10,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:16:10,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:16:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:10,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:16:10,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:16:10,041 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:10,721 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2025-02-06 10:16:10,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:16:10,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:16:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:10,722 INFO L225 Difference]: With dead ends: 117 [2025-02-06 10:16:10,722 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 10:16:10,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-02-06 10:16:10,723 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:10,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 414 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:16:10,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 10:16:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 10:16:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 105 states have internal predecessors, (116), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 10:16:10,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2025-02-06 10:16:10,725 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 19 [2025-02-06 10:16:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:10,727 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2025-02-06 10:16:10,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:16:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2025-02-06 10:16:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:16:10,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:10,729 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:10,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:10,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:10,930 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:10,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:10,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2048594143, now seen corresponding path program 1 times [2025-02-06 10:16:10,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:10,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1631367482] [2025-02-06 10:16:10,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:10,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:10,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:10,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:16:10,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:16:11,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:16:11,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:11,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:11,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 10:16:11,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:11,033 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 [2025-02-06 10:16:11,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-02-06 10:16:11,152 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 [2025-02-06 10:16:11,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:11,287 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 [2025-02-06 10:16:11,296 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:11,296 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 [2025-02-06 10:16:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:11,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:11,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631367482] [2025-02-06 10:16:11,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631367482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:11,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [869214937] [2025-02-06 10:16:11,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 10:16:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 10:16:11,763 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 10:16:11,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-02-06 10:16:11,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:16:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:16:12,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:12,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:12,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 10:16:12,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:12,037 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 [2025-02-06 10:16:12,040 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 [2025-02-06 10:16:12,119 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 [2025-02-06 10:16:12,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:12,224 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 [2025-02-06 10:16:12,233 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:12,233 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 [2025-02-06 10:16:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:12,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [869214937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:12,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:16:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2025-02-06 10:16:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716678487] [2025-02-06 10:16:12,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:16:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:16:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:16:12,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:16:12,527 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:16:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:13,230 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2025-02-06 10:16:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:16:13,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-06 10:16:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:13,231 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:16:13,231 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:16:13,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:16:13,232 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 34 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:13,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 424 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:16:13,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:16:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2025-02-06 10:16:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 110 states have internal predecessors, (123), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2025-02-06 10:16:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2025-02-06 10:16:13,238 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 29 [2025-02-06 10:16:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:13,239 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2025-02-06 10:16:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:16:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2025-02-06 10:16:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:16:13,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:13,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:13,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:13,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:13,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 10:16:13,644 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:13,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:13,645 INFO L85 PathProgramCache]: Analyzing trace with hash -136124771, now seen corresponding path program 1 times [2025-02-06 10:16:13,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:13,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979238285] [2025-02-06 10:16:13,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:13,647 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:13,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:16:13,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:16:13,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:16:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:13,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-06 10:16:13,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:13,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-02-06 10:16:13,808 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 [2025-02-06 10:16:13,868 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 [2025-02-06 10:16:13,874 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 [2025-02-06 10:16:13,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:16:13,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:16:13,913 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 [2025-02-06 10:16:13,965 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-06 10:16:13,966 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 [2025-02-06 10:16:14,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:14,079 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 16 treesize of output 11 [2025-02-06 10:16:14,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:16:14,111 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 [2025-02-06 10:16:14,992 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2025-02-06 10:16:15,031 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-06 10:16:15,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 97 [2025-02-06 10:16:15,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 18 [2025-02-06 10:16:15,043 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 0 case distinctions, treesize of input 33 treesize of output 22 [2025-02-06 10:16:15,050 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 7 treesize of output 3 [2025-02-06 10:16:15,249 INFO L349 Elim1Store]: treesize reduction 156, result has 25.4 percent of original size [2025-02-06 10:16:15,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 76 [2025-02-06 10:16:15,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-06 10:16:15,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-06 10:16:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:20,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:21,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979238285] [2025-02-06 10:16:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979238285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1041926729] [2025-02-06 10:16:21,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 10:16:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 10:16:21,212 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 10:16:21,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-02-06 10:16:21,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:16:21,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:16:21,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:21,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-06 10:16:21,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:21,619 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 [2025-02-06 10:16:21,796 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 [2025-02-06 10:16:21,801 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 [2025-02-06 10:16:21,879 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 19 treesize of output 18 [2025-02-06 10:16:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:16:21,928 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-06 10:16:21,928 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 [2025-02-06 10:16:21,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:21,984 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 16 treesize of output 11 [2025-02-06 10:16:22,024 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 [2025-02-06 10:16:22,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:16:22,413 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 7 treesize of output 3 [2025-02-06 10:16:22,419 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2025-02-06 10:16:22,444 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-06 10:16:22,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 97 [2025-02-06 10:16:22,449 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 0 case distinctions, treesize of input 77 treesize of output 56 [2025-02-06 10:16:22,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2025-02-06 10:16:22,586 INFO L349 Elim1Store]: treesize reduction 156, result has 25.4 percent of original size [2025-02-06 10:16:22,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 46 treesize of output 76 [2025-02-06 10:16:22,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-06 10:16:22,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 10:16:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:23,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:23,549 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_741) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|)))))) is different from false [2025-02-06 10:16:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1041926729] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:24,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:16:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 31 [2025-02-06 10:16:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285774489] [2025-02-06 10:16:24,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:16:24,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:16:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:24,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:16:24,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1982, Unknown=19, NotChecked=90, Total=2256 [2025-02-06 10:16:24,168 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 27 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:16:30,878 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] [2025-02-06 10:16:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:16:36,587 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2025-02-06 10:16:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:16:36,587 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 27 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-02-06 10:16:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:16:36,588 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:16:36,588 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:16:36,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=353, Invalid=3535, Unknown=22, NotChecked=122, Total=4032 [2025-02-06 10:16:36,589 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:16:36,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 765 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 951 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2025-02-06 10:16:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:16:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 10:16:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 123 states have internal predecessors, (136), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:16:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2025-02-06 10:16:36,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 35 [2025-02-06 10:16:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:16:36,592 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2025-02-06 10:16:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 27 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 10:16:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2025-02-06 10:16:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 10:16:36,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:16:36,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:16:36,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-02-06 10:16:36,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:16:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:36,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:16:36,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:16:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -136124770, now seen corresponding path program 1 times [2025-02-06 10:16:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:16:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637019591] [2025-02-06 10:16:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:36,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:16:36,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:16:37,001 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:16:37,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:16:37,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:16:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:16:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:37,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjuncts are in the unsatisfiable core [2025-02-06 10:16:37,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:37,147 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 [2025-02-06 10:16:37,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 5 [2025-02-06 10:16:37,189 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 [2025-02-06 10:16:37,194 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 [2025-02-06 10:16:37,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:16:37,225 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 19 treesize of output 18 [2025-02-06 10:16:37,283 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-02-06 10:16:37,283 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 [2025-02-06 10:16:37,301 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:16:37,301 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 [2025-02-06 10:16:37,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:37,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:37,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:37,399 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 16 treesize of output 11 [2025-02-06 10:16:37,411 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 7 treesize of output 3 [2025-02-06 10:16:37,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:16:38,550 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 0 case distinctions, treesize of input 57 treesize of output 44 [2025-02-06 10:16:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:38,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:38,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2025-02-06 10:16:38,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 54 [2025-02-06 10:16:38,590 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-06 10:16:38,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 98 [2025-02-06 10:16:38,595 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 0 case distinctions, treesize of input 98 treesize of output 84 [2025-02-06 10:16:38,658 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 18 treesize of output 11 [2025-02-06 10:16:38,906 INFO L349 Elim1Store]: treesize reduction 92, result has 42.9 percent of original size [2025-02-06 10:16:38,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 33 treesize of output 81 [2025-02-06 10:16:39,008 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-06 10:16:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-02-06 10:16:39,296 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-06 10:16:39,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 78 [2025-02-06 10:16:39,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:16:39,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:16:39,579 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 17 treesize of output 9 [2025-02-06 10:16:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:39,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:40,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_867 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_867) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_866) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_867 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_867) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2025-02-06 10:16:44,354 INFO L349 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2025-02-06 10:16:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 345 [2025-02-06 10:16:45,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse10 (select |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse9 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~head#1.base| (store .cse10 .cse9 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~sub~0#1.offset|)))) (.cse2 (select .cse8 .cse9)) (.cse3 (select .cse10 .cse9)) (.cse5 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_6 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse0 (select (select (store (let ((.cse1 (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_prenex_5))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_prenex_6))) v_prenex_7 v_prenex_8) |c_create_sub_list_~sub#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))) (= v_prenex_7 |c_create_sub_list_insert_sub_~head#1.base|) (= v_prenex_7 |c_create_sub_list_insert_sub_~sub~0#1.base|))) (forall ((v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_865 (_ BitVec 32)) (v_ArrVal_886 (_ BitVec 32)) (v_ArrVal_885 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_31| (_ BitVec 32)) (v_ArrVal_866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_867 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_create_sub_list_insert_sub_~sub~0#1.base_31| |c_create_sub_list_insert_sub_~sub~0#1.base|) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse6 (store .cse4 |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_884))) (store .cse6 .cse2 (store (select .cse6 .cse2) .cse3 v_ArrVal_885))) |v_create_sub_list_insert_sub_~sub~0#1.base_31| v_ArrVal_867) |c_create_sub_list_~sub#1.base|) .cse5)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_31| v_ArrVal_865) (select (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse8 .cse9 |c_create_sub_list_insert_sub_~sub~0#1.base|)) |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_883))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 v_ArrVal_886))) |v_create_sub_list_insert_sub_~sub~0#1.base_31| v_ArrVal_866) |c_create_sub_list_~sub#1.base|) .cse5))) (= |c_create_sub_list_insert_sub_~head#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_31|)))))) is different from false [2025-02-06 10:16:45,226 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:16:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637019591] [2025-02-06 10:16:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637019591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [655406570] [2025-02-06 10:16:45,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:16:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 10:16:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 10:16:45,229 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 10:16:45,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-02-06 10:16:45,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 10:16:45,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 10:16:45,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:16:45,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:16:45,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-02-06 10:16:45,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:16:45,750 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 [2025-02-06 10:16:45,957 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 [2025-02-06 10:16:45,961 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 [2025-02-06 10:16:46,044 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 19 treesize of output 18 [2025-02-06 10:16:46,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:16:46,172 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-02-06 10:16:46,172 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 [2025-02-06 10:16:46,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:16:46,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:16:46,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:16:46,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:16:46,402 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 [2025-02-06 10:16:49,452 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2025-02-06 10:16:49,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:49,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2025-02-06 10:16:49,469 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 61 [2025-02-06 10:16:49,476 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 18 treesize of output 11 [2025-02-06 10:16:49,514 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-06 10:16:49,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 104 [2025-02-06 10:16:49,520 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 0 case distinctions, treesize of input 84 treesize of output 61 [2025-02-06 10:16:49,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2025-02-06 10:16:49,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:49,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:16:49,747 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:16:49,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2025-02-06 10:16:49,793 INFO L349 Elim1Store]: treesize reduction 72, result has 22.6 percent of original size [2025-02-06 10:16:49,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 38 treesize of output 44 [2025-02-06 10:16:49,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-02-06 10:16:50,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:16:50,500 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 [2025-02-06 10:16:50,505 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 [2025-02-06 10:16:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:16:50,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:16:50,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1003) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1002) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1003) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2025-02-06 10:16:50,928 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_35| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_35|))) (forall ((v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_35| v_ArrVal_1003) |c_create_sub_list_~sub#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_35| (_ BitVec 32))) (or (forall ((v_ArrVal_1002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1003 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1001 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_35| v_ArrVal_1003) |c_create_sub_list_~sub#1.base|) .cse1)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_35| v_ArrVal_1001) (select (select (store |c_#memory_$Pointer$#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_35| v_ArrVal_1002) |c_create_sub_list_~sub#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_35|))))))) is different from false [2025-02-06 10:16:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [655406570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:16:54,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:16:54,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2025-02-06 10:16:54,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4208748] [2025-02-06 10:16:54,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:16:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 10:16:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:16:54,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 10:16:54,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2388, Unknown=9, NotChecked=404, Total=2970 [2025-02-06 10:16:54,562 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 44 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:17:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:08,901 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2025-02-06 10:17:08,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 10:17:08,901 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-02-06 10:17:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:08,902 INFO L225 Difference]: With dead ends: 142 [2025-02-06 10:17:08,902 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:17:08,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=369, Invalid=4746, Unknown=13, NotChecked=572, Total=5700 [2025-02-06 10:17:08,903 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:08,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1116 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1578 Invalid, 6 Unknown, 0 Unchecked, 8.1s Time] [2025-02-06 10:17:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:17:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 10:17:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 126 states have internal predecessors, (137), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:17:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2025-02-06 10:17:08,913 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 35 [2025-02-06 10:17:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:08,913 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2025-02-06 10:17:08,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:17:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2025-02-06 10:17:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:17:08,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:08,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:08,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:09,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:09,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 10:17:09,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:17:09,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:09,319 INFO L85 PathProgramCache]: Analyzing trace with hash -193417920, now seen corresponding path program 1 times [2025-02-06 10:17:09,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:17:09,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475074413] [2025-02-06 10:17:09,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:09,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:09,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:09,321 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:09,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:17:09,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:17:09,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:17:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:09,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:09,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:17:09,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:09,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:17:09,591 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 [2025-02-06 10:17:09,599 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:17:09,599 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 [2025-02-06 10:17:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:09,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:13,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-06 10:17:13,515 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:13,515 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 16 treesize of output 15 [2025-02-06 10:17:13,574 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:13,574 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 16 treesize of output 15 [2025-02-06 10:17:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:13,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:17:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475074413] [2025-02-06 10:17:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475074413] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:13,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2025-02-06 10:17:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946100114] [2025-02-06 10:17:13,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:17:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:17:13,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:17:13,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:17:13,587 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:17:18,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:17:22,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:17:26,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:17:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:27,851 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2025-02-06 10:17:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:17:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2025-02-06 10:17:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:27,854 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:17:27,854 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 10:17:27,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:17:27,855 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:27,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 751 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 782 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2025-02-06 10:17:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 10:17:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2025-02-06 10:17:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.34) internal successors, (134), 124 states have internal predecessors, (134), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:17:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2025-02-06 10:17:27,861 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 36 [2025-02-06 10:17:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:27,861 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2025-02-06 10:17:27,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.0) internal successors, (40), 17 states have internal predecessors, (40), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:17:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2025-02-06 10:17:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:17:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:27,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:27,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 10:17:28,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:28,066 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:17:28,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1191028291, now seen corresponding path program 1 times [2025-02-06 10:17:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:17:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294546805] [2025-02-06 10:17:28,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:28,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:28,072 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:28,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:17:28,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:17:28,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:17:28,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:28,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:28,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 10:17:28,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:28,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:28,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:17:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294546805] [2025-02-06 10:17:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294546805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:17:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060670264] [2025-02-06 10:17:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:17:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:17:28,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:17:28,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:17:28,292 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:17:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:28,472 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2025-02-06 10:17:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:17:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-02-06 10:17:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:28,475 INFO L225 Difference]: With dead ends: 142 [2025-02-06 10:17:28,478 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:17:28,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:17:28,479 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 30 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:28,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 625 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:17:28,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2025-02-06 10:17:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.33) internal successors, (133), 124 states have internal predecessors, (133), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2025-02-06 10:17:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2025-02-06 10:17:28,482 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 38 [2025-02-06 10:17:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:28,482 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2025-02-06 10:17:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:17:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2025-02-06 10:17:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:17:28,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:28,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:28,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-06 10:17:28,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:28,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:17:28,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1199018787, now seen corresponding path program 1 times [2025-02-06 10:17:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:17:28,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [377456214] [2025-02-06 10:17:28,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:28,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:28,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:28,686 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:28,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 10:17:28,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:17:28,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:17:28,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:28,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:28,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 10:17:28,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:28,975 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 [2025-02-06 10:17:29,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:17:29,039 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:17:29,039 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 [2025-02-06 10:17:29,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:17:29,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 10:17:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:29,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:29,246 INFO L349 Elim1Store]: treesize reduction 7, result has 56.3 percent of original size [2025-02-06 10:17:29,246 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 22 treesize of output 21 [2025-02-06 10:17:29,342 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1304) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|)) |c_create_sub_list_insert_sub_~head#1.base|)) is different from false [2025-02-06 10:17:29,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_46| (_ BitVec 32)) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_~sub#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_create_sub_list_~sub#1.base|) |c_create_sub_list_~sub#1.offset| |c_create_sub_list_~sub#1.base|)) |v_create_sub_list_insert_sub_~sub~0#1.base_46| v_ArrVal_1304) |c_create_sub_list_~sub#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|)) |c_create_sub_list_~sub#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_46|))))) is different from false [2025-02-06 10:17:29,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:29,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2025-02-06 10:17:29,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:29,447 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 44 treesize of output 28 [2025-02-06 10:17:29,450 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 3 [2025-02-06 10:17:29,573 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:29,574 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 16 treesize of output 15 [2025-02-06 10:17:29,592 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:29,593 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 16 treesize of output 15 [2025-02-06 10:17:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-06 10:17:29,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:17:29,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377456214] [2025-02-06 10:17:29,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377456214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:29,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:29,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 27 [2025-02-06 10:17:29,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802073427] [2025-02-06 10:17:29,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:17:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:17:29,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:17:29,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=8, NotChecked=98, Total=756 [2025-02-06 10:17:29,603 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand has 28 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:17:34,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 10:17:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:35,445 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2025-02-06 10:17:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:17:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2025-02-06 10:17:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:35,446 INFO L225 Difference]: With dead ends: 151 [2025-02-06 10:17:35,446 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 10:17:35,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=8, NotChecked=178, Total=2256 [2025-02-06 10:17:35,448 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 73 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 34 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:35,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 880 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 758 Invalid, 21 Unknown, 157 Unchecked, 5.0s Time] [2025-02-06 10:17:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 10:17:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-06 10:17:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.309090909090909) internal successors, (144), 134 states have internal predecessors, (144), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10) [2025-02-06 10:17:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2025-02-06 10:17:35,451 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 41 [2025-02-06 10:17:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:35,452 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2025-02-06 10:17:35,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 10:17:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2025-02-06 10:17:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:17:35,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:35,452 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:35,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:35,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:35,652 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-02-06 10:17:35,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1199018786, now seen corresponding path program 1 times [2025-02-06 10:17:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 10:17:35,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [639466196] [2025-02-06 10:17:35,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:35,655 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:35,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 10:17:35,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:17:35,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:17:35,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:35,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:35,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 10:17:35,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:35,925 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 [2025-02-06 10:17:35,931 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 [2025-02-06 10:17:35,959 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 19 treesize of output 18 [2025-02-06 10:17:35,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:17:36,007 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 10:17:36,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-02-06 10:17:36,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-02-06 10:17:36,060 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 16 treesize of output 11 [2025-02-06 10:17:36,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-06 10:17:36,168 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 7 treesize of output 3 [2025-02-06 10:17:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:36,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:36,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:36,358 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 46 treesize of output 50 [2025-02-06 10:17:36,591 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1416 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_create_sub_list_insert_sub_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1416) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1415) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))) (forall ((v_ArrVal_1415 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1415) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))))) is different from false [2025-02-06 10:17:37,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:37,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2025-02-06 10:17:37,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:37,078 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 44 treesize of output 28 [2025-02-06 10:17:37,081 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 3 [2025-02-06 10:17:37,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:37,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2025-02-06 10:17:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:17:37,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-02-06 10:17:37,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:37,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2025-02-06 10:17:37,106 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:17:37,108 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 28 treesize of output 10 [2025-02-06 10:17:37,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:37,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 62 [2025-02-06 10:17:37,623 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:37,623 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 16 treesize of output 15 [2025-02-06 10:17:37,641 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2025-02-06 10:17:37,641 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 16 treesize of output 15 [2025-02-06 10:17:37,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-06 10:17:37,656 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 10:17:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639466196] [2025-02-06 10:17:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639466196] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:37,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2025-02-06 10:17:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135813927] [2025-02-06 10:17:37,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:17:37,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 10:17:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:17:37,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=782, Unknown=9, NotChecked=56, Total=930 [2025-02-06 10:17:37,657 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 31 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)