./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:50:43,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:50:43,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:50:43,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:50:43,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:50:43,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:50:43,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:50:43,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:50:43,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:50:43,151 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:50:43,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:50:43,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:50:43,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:50:43,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:50:43,153 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:50:43,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:50:43,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:50:43,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:50:43,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:50:43,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:50:43,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:50:43,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:50:43,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:50:43,155 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/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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-03-04 07:50:43,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:50:43,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:50:43,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:50:43,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:50:43,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:50:43,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-04 07:50:44,477 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7897ed8cc/0fe8d2c5f03d4b6cac5fbb35fedc0f47/FLAG6c94aca28 [2025-03-04 07:50:44,754 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:50:44,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-04 07:50:44,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7897ed8cc/0fe8d2c5f03d4b6cac5fbb35fedc0f47/FLAG6c94aca28 [2025-03-04 07:50:45,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7897ed8cc/0fe8d2c5f03d4b6cac5fbb35fedc0f47 [2025-03-04 07:50:45,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:50:45,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:50:45,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:50:45,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:50:45,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:50:45,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:50:45" (1/1) ... [2025-03-04 07:50:45,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bda5bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:45, skipping insertion in model container [2025-03-04 07:50:45,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:50:45" (1/1) ... [2025-03-04 07:50:45,073 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:50:45,291 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:50:45,292 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:50:45,292 WARN L617 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2025-03-04 07:50:45,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:50:45,327 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-03-04 07:50:45,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@118a85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:45, skipping insertion in model container [2025-03-04 07:50:45,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:50:45,328 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:50:45,331 INFO L158 Benchmark]: Toolchain (without parser) took 297.95ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 95.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:50:45,331 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:50:45,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.76ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 95.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:50:45,332 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.76ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 95.6MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:50:46,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:50:46,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:50:46,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:50:46,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:50:46,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:50:46,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:50:46,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:50:46,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:50:46,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:50:46,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:50:46,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:50:46,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:50:46,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:50:46,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:50:46,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:50:46,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:50:46,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:50:46,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:50:46,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:50:46,952 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/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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2025-03-04 07:50:47,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:50:47,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:50:47,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:50:47,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:50:47,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:50:47,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-04 07:50:48,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c011b5b37/850b0812545b44c9a440ba00bef2ab14/FLAG8870e16e4 [2025-03-04 07:50:48,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:50:48,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2025-03-04 07:50:48,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c011b5b37/850b0812545b44c9a440ba00bef2ab14/FLAG8870e16e4 [2025-03-04 07:50:48,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c011b5b37/850b0812545b44c9a440ba00bef2ab14 [2025-03-04 07:50:48,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:50:48,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:50:48,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:50:48,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:50:48,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:50:48,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:50:48" (1/1) ... [2025-03-04 07:50:48,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c24e3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:48, skipping insertion in model container [2025-03-04 07:50:48,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:50:48" (1/1) ... [2025-03-04 07:50:48,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:50:49,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:50:49,212 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:50:49,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:50:49,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:50:49,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:50:49,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:50:49,354 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:50:49,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49 WrapperNode [2025-03-04 07:50:49,355 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:50:49,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:50:49,356 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:50:49,356 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:50:49,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,389 INFO L138 Inliner]: procedures = 235, calls = 76, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 119 [2025-03-04 07:50:49,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:50:49,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:50:49,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:50:49,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:50:49,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,449 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2025-03-04 07:50:49,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:50:49,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:50:49,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:50:49,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:50:49,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (1/1) ... [2025-03-04 07:50:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:50:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:49,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:50:49,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:50:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:50:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:50:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:50:49,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-03-04 07:50:49,527 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:50:49,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-03-04 07:50:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-03-04 07:50:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:50:49,528 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-04 07:50:49,528 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-04 07:50:49,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:50:49,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:50:49,656 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:50:49,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:50:49,706 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L923: havoc #t~mem54; [2025-03-04 07:50:50,245 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2025-03-04 07:50:50,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:50:50,258 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:50:50,259 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:50:50,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:50:50 BoogieIcfgContainer [2025-03-04 07:50:50,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:50:50,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:50:50,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:50:50,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:50:50,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:50:48" (1/3) ... [2025-03-04 07:50:50,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424934c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:50:50, skipping insertion in model container [2025-03-04 07:50:50,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:50:49" (2/3) ... [2025-03-04 07:50:50,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424934c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:50:50, skipping insertion in model container [2025-03-04 07:50:50,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:50:50" (3/3) ... [2025-03-04 07:50:50,268 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2025-03-04 07:50:50,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:50:50,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort_linux-1.i that has 5 procedures, 219 locations, 1 initial locations, 23 loop locations, and 71 error locations. [2025-03-04 07:50:50,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:50:50,316 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;@5f02284a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:50:50,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-04 07:50:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 120 states have (on average 2.1333333333333333) internal successors, (256), 209 states have internal predecessors, (256), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 07:50:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:50:50,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:50,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:50:50,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash 298664630, now seen corresponding path program 1 times [2025-03-04 07:50:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [270305831] [2025-03-04 07:50:50,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:50,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:50,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:50,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:50:50,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:50:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:50:50,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:50,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:50,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 07:50:50,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:50,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:50,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:50,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270305831] [2025-03-04 07:50:50,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270305831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:50,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:50,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:50:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647823694] [2025-03-04 07:50:50,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:50,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:50:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:50:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:50:50,455 INFO L87 Difference]: Start difference. First operand has 219 states, 120 states have (on average 2.1333333333333333) internal successors, (256), 209 states have internal predecessors, (256), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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-03-04 07:50:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:50,476 INFO L93 Difference]: Finished difference Result 214 states and 236 transitions. [2025-03-04 07:50:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:50:50,477 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-03-04 07:50:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:50,485 INFO L225 Difference]: With dead ends: 214 [2025-03-04 07:50:50,486 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:50:50,487 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-03-04 07:50:50,489 INFO L435 NwaCegarLoop]: 236 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, 236 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-03-04 07:50:50,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:50:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:50:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 07:50:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 117 states have (on average 1.7692307692307692) internal successors, (207), 201 states have internal predecessors, (207), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:50:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 234 transitions. [2025-03-04 07:50:50,527 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 234 transitions. Word has length 5 [2025-03-04 07:50:50,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:50,528 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 234 transitions. [2025-03-04 07:50:50,528 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-03-04 07:50:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 234 transitions. [2025-03-04 07:50:50,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:50:50,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:50,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:50:50,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:50:50,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:50,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:50,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:50,744 INFO L85 PathProgramCache]: Analyzing trace with hash 298664661, now seen corresponding path program 1 times [2025-03-04 07:50:50,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:50,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101359832] [2025-03-04 07:50:50,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:50,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:50,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:50:50,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:50:50,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:50:50,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:50,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:50,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:50:50,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:50,832 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-03-04 07:50:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:50,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:50,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101359832] [2025-03-04 07:50:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101359832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:50:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870423405] [2025-03-04 07:50:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:50,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:50:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:50,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:50:50,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:50:50,848 INFO L87 Difference]: Start difference. First operand 212 states and 234 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:50,999 INFO L93 Difference]: Finished difference Result 209 states and 231 transitions. [2025-03-04 07:50:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:50:51,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:51,002 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:50:51,002 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 07:50:51,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-04 07:50:51,003 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:51,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 378 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:50:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 07:50:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-03-04 07:50:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 198 states have internal predecessors, (204), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:50:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 231 transitions. [2025-03-04 07:50:51,019 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 231 transitions. Word has length 5 [2025-03-04 07:50:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 231 transitions. [2025-03-04 07:50:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 231 transitions. [2025-03-04 07:50:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:50:51,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:51,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:50:51,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:50:51,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:51,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:51,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:51,221 INFO L85 PathProgramCache]: Analyzing trace with hash 298664662, now seen corresponding path program 1 times [2025-03-04 07:50:51,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:51,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972289977] [2025-03-04 07:50:51,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:51,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:51,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:50:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:50:51,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:50:51,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:51,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:51,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:50:51,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:51,282 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-03-04 07:50:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:51,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:51,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:51,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972289977] [2025-03-04 07:50:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972289977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:50:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938474420] [2025-03-04 07:50:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:51,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:50:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:51,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:50:51,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:50:51,298 INFO L87 Difference]: Start difference. First operand 209 states and 231 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:51,465 INFO L93 Difference]: Finished difference Result 206 states and 228 transitions. [2025-03-04 07:50:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:50:51,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:51,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:51,466 INFO L225 Difference]: With dead ends: 206 [2025-03-04 07:50:51,466 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 07:50:51,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-04 07:50:51,467 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:51,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 382 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:50:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 07:50:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 07:50:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 117 states have (on average 1.7179487179487178) internal successors, (201), 195 states have internal predecessors, (201), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:50:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 228 transitions. [2025-03-04 07:50:51,475 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 228 transitions. Word has length 5 [2025-03-04 07:50:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:51,475 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 228 transitions. [2025-03-04 07:50:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-03-04 07:50:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 228 transitions. [2025-03-04 07:50:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:50:51,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:51,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:51,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:50:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:51,680 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:51,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1653029133, now seen corresponding path program 1 times [2025-03-04 07:50:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248739026] [2025-03-04 07:50:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:51,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:51,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:50:51,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:50:51,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:50:51,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:51,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:50:51,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:51,808 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:50:51,808 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-03-04 07:50:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:51,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:51,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248739026] [2025-03-04 07:50:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248739026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:50:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728439053] [2025-03-04 07:50:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:50:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:50:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:50:51,860 INFO L87 Difference]: Start difference. First operand 206 states and 228 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-03-04 07:50:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:52,222 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2025-03-04 07:50:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:50:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2025-03-04 07:50:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:52,224 INFO L225 Difference]: With dead ends: 243 [2025-03-04 07:50:52,224 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 07:50:52,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:50:52,224 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 255 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:52,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 403 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:50:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 07:50:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 220. [2025-03-04 07:50:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 131 states have (on average 1.7404580152671756) internal successors, (228), 208 states have internal predecessors, (228), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:50:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 255 transitions. [2025-03-04 07:50:52,233 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 255 transitions. Word has length 8 [2025-03-04 07:50:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:52,233 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 255 transitions. [2025-03-04 07:50:52,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-03-04 07:50:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 255 transitions. [2025-03-04 07:50:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:50:52,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:52,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:52,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:50:52,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:52,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:52,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1653029132, now seen corresponding path program 1 times [2025-03-04 07:50:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559904957] [2025-03-04 07:50:52,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:52,438 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:52,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:50:52,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:50:52,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:50:52,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:52,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:52,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:50:52,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:52,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:50:52,564 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-03-04 07:50:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:52,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:52,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:52,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559904957] [2025-03-04 07:50:52,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559904957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:52,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:52,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:50:52,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142373601] [2025-03-04 07:50:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:52,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:50:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:52,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:50:52,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:50:52,631 INFO L87 Difference]: Start difference. First operand 220 states and 255 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03-04 07:50:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:53,039 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2025-03-04 07:50:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:50:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2025-03-04 07:50:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:53,040 INFO L225 Difference]: With dead ends: 224 [2025-03-04 07:50:53,040 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 07:50:53,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:50:53,041 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 254 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:53,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 314 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:50:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 07:50:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 212. [2025-03-04 07:50:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 127 states have (on average 1.68503937007874) internal successors, (214), 200 states have internal predecessors, (214), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 07:50:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 241 transitions. [2025-03-04 07:50:53,046 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 241 transitions. Word has length 8 [2025-03-04 07:50:53,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:53,046 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 241 transitions. [2025-03-04 07:50:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-03-04 07:50:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 241 transitions. [2025-03-04 07:50:53,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:50:53,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:53,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:53,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:50:53,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:53,247 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:53,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 576907568, now seen corresponding path program 1 times [2025-03-04 07:50:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833480411] [2025-03-04 07:50:53,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:53,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:53,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:50:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:50:53,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:50:53,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:53,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:53,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:50:53,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:53,347 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:50:53,348 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-03-04 07:50:53,369 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-03-04 07:50:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:53,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:53,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833480411] [2025-03-04 07:50:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833480411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:50:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962999196] [2025-03-04 07:50:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:53,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:50:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:53,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:50:53,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:50:53,445 INFO L87 Difference]: Start difference. First operand 212 states and 241 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-03-04 07:50:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:53,819 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2025-03-04 07:50:53,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:50:53,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 10 [2025-03-04 07:50:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:53,821 INFO L225 Difference]: With dead ends: 224 [2025-03-04 07:50:53,821 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 07:50:53,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:50:53,822 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 17 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:53,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1052 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:50:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 07:50:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2025-03-04 07:50:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 207 states have internal predecessors, (222), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2025-03-04 07:50:53,829 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 10 [2025-03-04 07:50:53,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:53,829 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2025-03-04 07:50:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-03-04 07:50:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2025-03-04 07:50:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:50:53,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:53,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:53,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:50:54,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:54,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:54,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash 576907569, now seen corresponding path program 1 times [2025-03-04 07:50:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:54,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176323542] [2025-03-04 07:50:54,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:54,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:54,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:54,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:50:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:50:54,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:50:54,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:54,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 07:50:54,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:54,176 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:50:54,176 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-03-04 07:50:54,185 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-03-04 07:50:54,243 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-03-04 07:50:54,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:50:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:54,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:54,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:54,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176323542] [2025-03-04 07:50:54,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176323542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:54,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:50:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121266296] [2025-03-04 07:50:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:50:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:54,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:50:54,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:50:54,385 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-03-04 07:50:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:54,947 INFO L93 Difference]: Finished difference Result 226 states and 256 transitions. [2025-03-04 07:50:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:50:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 10 [2025-03-04 07:50:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:54,948 INFO L225 Difference]: With dead ends: 226 [2025-03-04 07:50:54,948 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:50:54,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:50:54,949 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 26 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:54,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 971 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:50:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:50:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 220. [2025-03-04 07:50:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 207 states have internal predecessors, (221), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 250 transitions. [2025-03-04 07:50:54,954 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 250 transitions. Word has length 10 [2025-03-04 07:50:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 250 transitions. [2025-03-04 07:50:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-03-04 07:50:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 250 transitions. [2025-03-04 07:50:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:50:54,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:54,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:54,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:50:55,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:55,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:55,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:55,156 INFO L85 PathProgramCache]: Analyzing trace with hash 704265570, now seen corresponding path program 1 times [2025-03-04 07:50:55,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:55,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835859558] [2025-03-04 07:50:55,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:55,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:55,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:55,158 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:55,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:50:55,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:50:55,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:50:55,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:55,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:55,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:50:55,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:55,220 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-03-04 07:50:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:55,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:55,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835859558] [2025-03-04 07:50:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835859558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:55,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:50:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807551171] [2025-03-04 07:50:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:55,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:50:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:55,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:50:55,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:50:55,252 INFO L87 Difference]: Start difference. First operand 220 states and 250 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:55,527 INFO L93 Difference]: Finished difference Result 225 states and 247 transitions. [2025-03-04 07:50:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:50:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:55,529 INFO L225 Difference]: With dead ends: 225 [2025-03-04 07:50:55,529 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:50:55,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-03-04 07:50:55,529 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 27 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:55,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 799 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:50:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:50:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2025-03-04 07:50:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.626865671641791) internal successors, (218), 206 states have internal predecessors, (218), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 247 transitions. [2025-03-04 07:50:55,534 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 247 transitions. Word has length 11 [2025-03-04 07:50:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:55,534 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 247 transitions. [2025-03-04 07:50:55,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:55,534 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 247 transitions. [2025-03-04 07:50:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:50:55,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:55,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:55,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:50:55,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:55,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 704265571, now seen corresponding path program 1 times [2025-03-04 07:50:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263917858] [2025-03-04 07:50:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:55,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:55,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:55,738 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:55,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:50:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:50:55,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:50:55,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:55,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:55,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:50:55,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:55,810 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-03-04 07:50:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:55,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:55,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:55,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263917858] [2025-03-04 07:50:55,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263917858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:55,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:55,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:50:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613541174] [2025-03-04 07:50:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:55,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:50:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:55,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:50:55,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:50:55,865 INFO L87 Difference]: Start difference. First operand 219 states and 247 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:56,184 INFO L93 Difference]: Finished difference Result 223 states and 245 transitions. [2025-03-04 07:50:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:50:56,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:56,186 INFO L225 Difference]: With dead ends: 223 [2025-03-04 07:50:56,186 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 07:50:56,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-03-04 07:50:56,186 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:56,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 824 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:50:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 07:50:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-03-04 07:50:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 206 states have internal predecessors, (216), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2025-03-04 07:50:56,191 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 11 [2025-03-04 07:50:56,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:56,191 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2025-03-04 07:50:56,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03-04 07:50:56,191 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2025-03-04 07:50:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:50:56,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:56,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:56,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:50:56,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:56,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1805615425, now seen corresponding path program 1 times [2025-03-04 07:50:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736697113] [2025-03-04 07:50:56,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:56,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:56,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:56,395 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:56,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:50:56,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:50:56,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:50:56,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:56,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:56,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:50:56,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:56,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:56,476 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:56,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736697113] [2025-03-04 07:50:56,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736697113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:56,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:56,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:50:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109821691] [2025-03-04 07:50:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:56,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:50:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:56,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:50:56,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:50:56,477 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-04 07:50:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:56,644 INFO L93 Difference]: Finished difference Result 218 states and 243 transitions. [2025-03-04 07:50:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:50:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2025-03-04 07:50:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:56,645 INFO L225 Difference]: With dead ends: 218 [2025-03-04 07:50:56,645 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 07:50:56,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-03-04 07:50:56,645 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 5 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:56,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 515 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:50:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 07:50:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 07:50:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.5970149253731343) internal successors, (214), 205 states have internal predecessors, (214), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 243 transitions. [2025-03-04 07:50:56,650 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 243 transitions. Word has length 13 [2025-03-04 07:50:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:56,650 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 243 transitions. [2025-03-04 07:50:56,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03-04 07:50:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 243 transitions. [2025-03-04 07:50:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:50:56,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:56,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:56,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:50:56,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:56,851 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:56,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:56,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1805615424, now seen corresponding path program 1 times [2025-03-04 07:50:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:56,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995651576] [2025-03-04 07:50:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:56,854 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:56,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:50:56,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:50:56,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:50:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:56,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:50:56,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:56,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:56,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995651576] [2025-03-04 07:50:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995651576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:50:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680841908] [2025-03-04 07:50:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:56,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:50:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:50:56,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:50:56,976 INFO L87 Difference]: Start difference. First operand 218 states and 243 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-03-04 07:50:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:57,247 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2025-03-04 07:50:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:50:57,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 13 [2025-03-04 07:50:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:57,249 INFO L225 Difference]: With dead ends: 220 [2025-03-04 07:50:57,249 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 07:50:57,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:50:57,250 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 239 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:57,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 900 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:50:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 07:50:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-04 07:50:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.5895522388059702) internal successors, (213), 205 states have internal predecessors, (213), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 242 transitions. [2025-03-04 07:50:57,256 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 242 transitions. Word has length 13 [2025-03-04 07:50:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:57,256 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 242 transitions. [2025-03-04 07:50:57,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-03-04 07:50:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 242 transitions. [2025-03-04 07:50:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:50:57,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:57,257 INFO L218 NwaCegarLoop]: trace histogram [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-03-04 07:50:57,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:50:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:57,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting inspectErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:57,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2064045554, now seen corresponding path program 1 times [2025-03-04 07:50:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2095698654] [2025-03-04 07:50:57,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:57,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:57,463 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:57,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:50:57,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:50:57,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:50:57,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:57,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:57,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:50:57,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:57,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:57,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:57,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095698654] [2025-03-04 07:50:57,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095698654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:57,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:50:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008921531] [2025-03-04 07:50:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:50:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:57,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:50:57,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:50:57,607 INFO L87 Difference]: Start difference. First operand 218 states and 242 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:58,087 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2025-03-04 07:50:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:50:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:50:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:58,088 INFO L225 Difference]: With dead ends: 213 [2025-03-04 07:50:58,088 INFO L226 Difference]: Without dead ends: 213 [2025-03-04 07:50:58,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:50:58,089 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 364 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:58,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 440 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:50:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-04 07:50:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-04 07:50:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 134 states have (on average 1.5522388059701493) internal successors, (208), 200 states have internal predecessors, (208), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 237 transitions. [2025-03-04 07:50:58,093 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 237 transitions. Word has length 27 [2025-03-04 07:50:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:58,093 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 237 transitions. [2025-03-04 07:50:58,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 237 transitions. [2025-03-04 07:50:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:50:58,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:58,093 INFO L218 NwaCegarLoop]: trace histogram [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-03-04 07:50:58,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:50:58,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:58,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:58,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2064045553, now seen corresponding path program 1 times [2025-03-04 07:50:58,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:58,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869476367] [2025-03-04 07:50:58,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:58,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:58,301 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:58,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:50:58,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:50:58,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:50:58,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:58,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:58,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:50:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:58,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:58,525 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869476367] [2025-03-04 07:50:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869476367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:58,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:50:58,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182183447] [2025-03-04 07:50:58,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:58,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:50:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:58,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:50:58,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:50:58,526 INFO L87 Difference]: Start difference. First operand 213 states and 237 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:59,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:59,130 INFO L93 Difference]: Finished difference Result 212 states and 236 transitions. [2025-03-04 07:50:59,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:50:59,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 07:50:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:59,131 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:50:59,131 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:50:59,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:50:59,131 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 304 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:59,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 495 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:50:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:50:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-04 07:50:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 134 states have (on average 1.544776119402985) internal successors, (207), 199 states have internal predecessors, (207), 22 states have call successors, (22), 6 states have call predecessors, (22), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 236 transitions. [2025-03-04 07:50:59,135 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 236 transitions. Word has length 27 [2025-03-04 07:50:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 236 transitions. [2025-03-04 07:50:59,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:59,136 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 236 transitions. [2025-03-04 07:50:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:50:59,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:59,136 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-03-04 07:50:59,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:50:59,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:59,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 730667486, now seen corresponding path program 1 times [2025-03-04 07:50:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072357911] [2025-03-04 07:50:59,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:59,339 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:59,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:50:59,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:50:59,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:50:59,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:59,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:59,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:50:59,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:50:59,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:50:59,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:50:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072357911] [2025-03-04 07:50:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072357911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:50:59,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:50:59,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:50:59,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952639084] [2025-03-04 07:50:59,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:50:59,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:50:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:50:59,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:50:59,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:50:59,463 INFO L87 Difference]: Start difference. First operand 212 states and 236 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:50:59,551 INFO L93 Difference]: Finished difference Result 211 states and 234 transitions. [2025-03-04 07:50:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:50:59,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-03-04 07:50:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:50:59,552 INFO L225 Difference]: With dead ends: 211 [2025-03-04 07:50:59,552 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:50:59,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:50:59,553 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 280 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:50:59,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 450 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:50:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:50:59,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-03-04 07:50:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 134 states have (on average 1.537313432835821) internal successors, (206), 198 states have internal predecessors, (206), 21 states have call successors, (21), 6 states have call predecessors, (21), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:50:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 234 transitions. [2025-03-04 07:50:59,556 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 234 transitions. Word has length 29 [2025-03-04 07:50:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:50:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 234 transitions. [2025-03-04 07:50:59,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:50:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 234 transitions. [2025-03-04 07:50:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:50:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:50:59,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:50:59,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 07:50:59,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:59,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:50:59,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:50:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash 586905377, now seen corresponding path program 1 times [2025-03-04 07:50:59,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:50:59,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499554725] [2025-03-04 07:50:59,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:50:59,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:50:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:50:59,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:50:59,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:50:59,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:50:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:50:59,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:50:59,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:50:59,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 07:50:59,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:50:59,897 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:50:59,897 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-03-04 07:51:00,205 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-03-04 07:51:00,366 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-03-04 07:51:00,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:51:00,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:51:00,514 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2025-03-04 07:51:00,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2025-03-04 07:51:00,609 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 36 treesize of output 27 [2025-03-04 07:51:00,714 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-03-04 07:51:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:00,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:51:00,880 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_436) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2025-03-04 07:51:00,966 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_17| (_ BitVec 32)) (v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_435 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_17|))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_17| v_ArrVal_435) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_434) |v_ULTIMATE.start_gl_insert_~node~1#1.base_17| v_ArrVal_436) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) is different from false [2025-03-04 07:51:01,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:01,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 07:51:01,048 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:01,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 44 treesize of output 36 [2025-03-04 07:51:01,055 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 16 treesize of output 14 [2025-03-04 07:51:01,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:51:01,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499554725] [2025-03-04 07:51:01,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499554725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:51:01,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [312545837] [2025-03-04 07:51:01,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:51:01,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:51:01,230 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:51:01,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-04 07:51:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:51:01,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:51:01,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:01,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:51:01,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:01,631 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:51:01,632 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-03-04 07:51:02,077 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-03-04 07:51:02,266 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-03-04 07:51:02,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:51:02,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:51:02,436 INFO L349 Elim1Store]: treesize reduction 98, result has 30.0 percent of original size [2025-03-04 07:51:02,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 60 [2025-03-04 07:51:02,559 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 36 treesize of output 27 [2025-03-04 07:51:02,702 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-03-04 07:51:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:02,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:51:03,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-04 07:51:03,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:03,020 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 44 treesize of output 36 [2025-03-04 07:51:03,023 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 16 treesize of output 14 [2025-03-04 07:51:03,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [312545837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:51:03,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:51:03,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-03-04 07:51:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201567040] [2025-03-04 07:51:03,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:51:03,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:51:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:51:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:51:03,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1139, Unknown=21, NotChecked=142, Total=1482 [2025-03-04 07:51:03,126 INFO L87 Difference]: Start difference. First operand 211 states and 234 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:51:05,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:51:05,873 INFO L93 Difference]: Finished difference Result 376 states and 415 transitions. [2025-03-04 07:51:05,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:51:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 07:51:05,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:51:05,875 INFO L225 Difference]: With dead ends: 376 [2025-03-04 07:51:05,875 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 07:51:05,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=1503, Unknown=21, NotChecked=166, Total=1980 [2025-03-04 07:51:05,876 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1111 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:51:05,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 2033 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 07:51:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 07:51:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 290. [2025-03-04 07:51:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 208 states have (on average 1.5625) internal successors, (325), 273 states have internal predecessors, (325), 24 states have call successors, (24), 8 states have call predecessors, (24), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:51:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 359 transitions. [2025-03-04 07:51:05,881 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 359 transitions. Word has length 29 [2025-03-04 07:51:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:51:05,882 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 359 transitions. [2025-03-04 07:51:05,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:51:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 359 transitions. [2025-03-04 07:51:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 07:51:05,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:51:05,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:51:05,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2025-03-04 07:51:06,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:51:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:06,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:51:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:51:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 586905378, now seen corresponding path program 1 times [2025-03-04 07:51:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:51:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917979959] [2025-03-04 07:51:06,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:51:06,286 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:51:06,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:51:06,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:51:06,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:51:06,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:06,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-04 07:51:06,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:51:06,422 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:51:06,422 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-03-04 07:51:06,672 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-03-04 07:51:06,678 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-03-04 07:51:06,810 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-03-04 07:51:06,823 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-03-04 07:51:06,851 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:51:06,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2025-03-04 07:51:06,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:51:06,985 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2025-03-04 07:51:06,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2025-03-04 07:51:06,993 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:51:06,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-03-04 07:51:07,084 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-03-04 07:51:07,090 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-03-04 07:51:07,221 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-03-04 07:51:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:07,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:51:07,555 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_599) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_599) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_598) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2025-03-04 07:51:07,598 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1))) (forall ((v_ArrVal_598 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_597 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_599) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_597) (select (select (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_598) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_599 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_599) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1)))))) is different from false [2025-03-04 07:51:08,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:08,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2025-03-04 07:51:08,111 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:08,112 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 46 treesize of output 34 [2025-03-04 07:51:08,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:08,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2025-03-04 07:51:08,137 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:08,139 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 84 treesize of output 76 [2025-03-04 07:51:08,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2025-03-04 07:51:08,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:08,154 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 96 treesize of output 84 [2025-03-04 07:51:08,162 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 18 treesize of output 16 [2025-03-04 07:51:08,168 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 16 treesize of output 14 [2025-03-04 07:51:08,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:51:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917979959] [2025-03-04 07:51:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917979959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:51:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1979815623] [2025-03-04 07:51:08,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 07:51:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 07:51:08,409 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 07:51:08,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-03-04 07:51:08,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 07:51:08,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 07:51:08,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:08,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:08,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-04 07:51:08,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:08,920 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-03-04 07:51:08,935 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:51:08,935 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-03-04 07:51:09,594 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-03-04 07:51:09,601 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-03-04 07:51:09,873 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-03-04 07:51:09,886 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-03-04 07:51:09,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:51:09,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2025-03-04 07:51:09,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:51:10,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:51:10,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:51:10,148 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:51:10,149 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-03-04 07:51:10,169 INFO L349 Elim1Store]: treesize reduction 32, result has 34.7 percent of original size [2025-03-04 07:51:10,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2025-03-04 07:51:10,323 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-03-04 07:51:10,327 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-03-04 07:51:10,571 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-03-04 07:51:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:10,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:51:10,657 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_688 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_687) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_688) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_687 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_687) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2025-03-04 07:51:11,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:11,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2025-03-04 07:51:11,930 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:11,933 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 84 treesize of output 76 [2025-03-04 07:51:11,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:11,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2025-03-04 07:51:11,942 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:11,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2025-03-04 07:51:11,953 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 18 treesize of output 16 [2025-03-04 07:51:11,964 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 16 treesize of output 14 [2025-03-04 07:51:12,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:51:12,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2025-03-04 07:51:12,041 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:51:12,043 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 46 treesize of output 34 [2025-03-04 07:51:12,053 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 11 treesize of output 7 [2025-03-04 07:51:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1979815623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:51:12,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:51:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2025-03-04 07:51:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204612581] [2025-03-04 07:51:12,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:51:12,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:51:12,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:51:12,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:51:12,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1378, Unknown=17, NotChecked=234, Total=1806 [2025-03-04 07:51:12,245 INFO L87 Difference]: Start difference. First operand 290 states and 359 transitions. Second operand has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:51:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:51:16,733 INFO L93 Difference]: Finished difference Result 375 states and 414 transitions. [2025-03-04 07:51:16,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:51:16,733 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-04 07:51:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:51:16,735 INFO L225 Difference]: With dead ends: 375 [2025-03-04 07:51:16,735 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 07:51:16,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=316, Invalid=1841, Unknown=17, NotChecked=276, Total=2450 [2025-03-04 07:51:16,735 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 656 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-04 07:51:16,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1755 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-04 07:51:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 07:51:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 282. [2025-03-04 07:51:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 201 states have (on average 1.5771144278606966) internal successors, (317), 266 states have internal predecessors, (317), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:51:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 349 transitions. [2025-03-04 07:51:16,744 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 349 transitions. Word has length 29 [2025-03-04 07:51:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:51:16,745 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 349 transitions. [2025-03-04 07:51:16,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 26 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:51:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 349 transitions. [2025-03-04 07:51:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:51:16,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:51:16,746 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-03-04 07:51:16,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-03-04 07:51:16,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 07:51:17,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:17,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting inspectErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:51:17,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:51:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1065802636, now seen corresponding path program 1 times [2025-03-04 07:51:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:51:17,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1238084578] [2025-03-04 07:51:17,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:17,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:17,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:51:17,149 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:51:17,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:51:17,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:51:17,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:51:17,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:17,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:17,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:51:17,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:51:17,273 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-03-04 07:51:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:17,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:51:17,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:51:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238084578] [2025-03-04 07:51:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238084578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:51:17,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:51:17,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:51:17,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68755062] [2025-03-04 07:51:17,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:51:17,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:51:17,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:51:17,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:51:17,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:51:17,430 INFO L87 Difference]: Start difference. First operand 282 states and 349 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:51:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:51:17,919 INFO L93 Difference]: Finished difference Result 280 states and 345 transitions. [2025-03-04 07:51:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:51:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 07:51:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:51:17,921 INFO L225 Difference]: With dead ends: 280 [2025-03-04 07:51:17,921 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 07:51:17,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:51:17,921 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 290 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:51:17,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 224 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:51:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 07:51:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2025-03-04 07:51:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 201 states have (on average 1.5572139303482586) internal successors, (313), 264 states have internal predecessors, (313), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:51:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 345 transitions. [2025-03-04 07:51:17,929 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 345 transitions. Word has length 30 [2025-03-04 07:51:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:51:17,929 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 345 transitions. [2025-03-04 07:51:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:51:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 345 transitions. [2025-03-04 07:51:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:51:17,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:51:17,931 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-04 07:51:17,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:51:18,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:18,132 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:51:18,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:51:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2037887101, now seen corresponding path program 1 times [2025-03-04 07:51:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:51:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [799274536] [2025-03-04 07:51:18,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:18,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:51:18,135 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:51:18,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 07:51:18,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:51:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:51:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:18,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:51:18,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:18,262 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:51:18,263 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-03-04 07:51:18,357 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-03-04 07:51:18,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 16 treesize of output 11 [2025-03-04 07:51:18,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:51:18,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 07:51:18,484 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 16 treesize of output 8 [2025-03-04 07:51:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:18,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:51:18,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:51:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799274536] [2025-03-04 07:51:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799274536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:51:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:51:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:51:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658828260] [2025-03-04 07:51:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:51:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:51:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:51:18,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:51:18,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:51:18,501 INFO L87 Difference]: Start difference. First operand 280 states and 345 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:51:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:51:19,813 INFO L93 Difference]: Finished difference Result 352 states and 390 transitions. [2025-03-04 07:51:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:51:19,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 07:51:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:51:19,815 INFO L225 Difference]: With dead ends: 352 [2025-03-04 07:51:19,815 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 07:51:19,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:51:19,815 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 583 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:51:19,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1019 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 07:51:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 07:51:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 280. [2025-03-04 07:51:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 201 states have (on average 1.5522388059701493) internal successors, (312), 264 states have internal predecessors, (312), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 07:51:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 344 transitions. [2025-03-04 07:51:19,820 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 344 transitions. Word has length 32 [2025-03-04 07:51:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:51:19,821 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 344 transitions. [2025-03-04 07:51:19,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 10 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:51:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 344 transitions. [2025-03-04 07:51:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:51:19,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:51:19,821 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:51:19,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 07:51:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:20,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:51:20,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:51:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 765372633, now seen corresponding path program 1 times [2025-03-04 07:51:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:51:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290985092] [2025-03-04 07:51:20,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:51:20,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:51:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:51:20,025 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:51:20,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 07:51:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:51:20,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:51:20,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:51:20,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:51:20,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 07:51:20,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:51:20,178 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:51:20,178 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-03-04 07:51:20,219 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-03-04 07:51:20,226 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-03-04 07:51:20,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2025-03-04 07:51:20,913 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2025-03-04 07:51:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:51:20,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2025-03-04 07:51:20,994 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 23 treesize of output 14 [2025-03-04 07:51:25,045 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-03-04 07:51:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:51:25,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:51:25,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:51:25,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290985092] [2025-03-04 07:51:25,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290985092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:51:25,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:51:25,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 07:51:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515078504] [2025-03-04 07:51:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:51:25,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:51:25,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:51:25,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:51:25,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=257, Unknown=6, NotChecked=0, Total=306 [2025-03-04 07:51:25,317 INFO L87 Difference]: Start difference. First operand 280 states and 344 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:51:30,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:51:35,079 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-03-04 07:51:39,253 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-03-04 07:51:41,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:51:47,559 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-03-04 07:51:52,656 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-03-04 07:52:05,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:52:12,371 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-03-04 07:52:16,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:52:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:23,011 INFO L93 Difference]: Finished difference Result 456 states and 538 transitions. [2025-03-04 07:52:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:52:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 07:52:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:23,013 INFO L225 Difference]: With dead ends: 456 [2025-03-04 07:52:23,013 INFO L226 Difference]: Without dead ends: 456 [2025-03-04 07:52:23,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=99, Invalid=588, Unknown=15, NotChecked=0, Total=702 [2025-03-04 07:52:23,013 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 356 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 36 mSolverCounterUnsat, 192 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 192 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:23,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1115 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2107 Invalid, 192 Unknown, 0 Unchecked, 56.3s Time] [2025-03-04 07:52:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-04 07:52:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 381. [2025-03-04 07:52:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 294 states have (on average 1.5238095238095237) internal successors, (448), 358 states have internal predecessors, (448), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:52:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 490 transitions. [2025-03-04 07:52:23,021 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 490 transitions. Word has length 35 [2025-03-04 07:52:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:23,021 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 490 transitions. [2025-03-04 07:52:23,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:52:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 490 transitions. [2025-03-04 07:52:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 07:52:23,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:23,023 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:23,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 07:52:23,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:23,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting inspectErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2025-03-04 07:52:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1549988383, now seen corresponding path program 1 times [2025-03-04 07:52:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:23,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441676101] [2025-03-04 07:52:23,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:23,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:23,226 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:23,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 07:52:23,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 07:52:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 07:52:23,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:23,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:23,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 07:52:23,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:23,642 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:23,642 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-03-04 07:52:23,868 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-03-04 07:52:23,907 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-03-04 07:52:27,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2025-03-04 07:52:27,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2025-03-04 07:52:27,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:27,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2025-03-04 07:52:27,445 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 23 treesize of output 14