./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.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/ldv-memsafety/memleaks_test23_4.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 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:45:53,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:45:53,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:45:53,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:45:53,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:45:53,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:45:53,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:45:53,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:45:53,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:45:53,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:45:53,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:45:53,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:45:53,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:45:53,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:45:53,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:45:53,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:45:53,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:45:53,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:45:53,769 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 -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2025-03-04 07:45:53,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:45:53,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:45:53,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:45:53,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:45:53,999 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:45:54,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2025-03-04 07:45:55,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee685ea46/cc02678be3d34ef0a763f191ea0ff36e/FLAGeddf581e4 [2025-03-04 07:45:55,434 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:45:55,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2025-03-04 07:45:55,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee685ea46/cc02678be3d34ef0a763f191ea0ff36e/FLAGeddf581e4 [2025-03-04 07:45:55,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee685ea46/cc02678be3d34ef0a763f191ea0ff36e [2025-03-04 07:45:55,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:45:55,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:45:55,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:45:55,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:45:55,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:45:55,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:45:55" (1/1) ... [2025-03-04 07:45:55,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ae90d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:45:55, skipping insertion in model container [2025-03-04 07:45:55,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:45:55" (1/1) ... [2025-03-04 07:45:55,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:45:55,920 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:45:55,958 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:45:55,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:45:55,976 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:45:55,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d82e352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:45:55, skipping insertion in model container [2025-03-04 07:45:55,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:45:55,977 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-04 07:45:55,978 INFO L158 Benchmark]: Toolchain (without parser) took 265.55ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:45:55,978 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:45:55,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.03ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:45:55,979 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.15ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.03ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 106.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test23_4.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 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:45:57,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:45:57,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:45:57,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:45:57,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:45:57,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:45:57,696 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:45:57,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:45:57,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:45:57,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:45:57,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:45:57,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:45:57,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:45:57,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:45:57,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:45:57,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:45:57,699 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:45:57,699 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 -> 4318218de1a670b98e217596890d501e5109c78977de7e98dfa51804dcb18c15 [2025-03-04 07:45:57,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:45:57,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:45:57,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:45:57,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:45:57,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:45:57,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2025-03-04 07:45:59,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dac9c698/b328cbb0b9544eaba8e584007e784b96/FLAGd02031991 [2025-03-04 07:45:59,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:45:59,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_4.i [2025-03-04 07:45:59,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dac9c698/b328cbb0b9544eaba8e584007e784b96/FLAGd02031991 [2025-03-04 07:45:59,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dac9c698/b328cbb0b9544eaba8e584007e784b96 [2025-03-04 07:45:59,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:45:59,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:45:59,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:45:59,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:45:59,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:45:59,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:45:59" (1/1) ... [2025-03-04 07:45:59,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a2e33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:45:59, skipping insertion in model container [2025-03-04 07:45:59,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:45:59" (1/1) ... [2025-03-04 07:45:59,698 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:45:59,898 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:45:59,939 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:45:59,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:45:59,958 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-04 07:45:59,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:45:59,983 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:46:00,005 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:46:00,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:46:00,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:46:00,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:46:00,101 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:46:00,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00 WrapperNode [2025-03-04 07:46:00,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:46:00,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:46:00,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:46:00,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:46:00,107 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:46:00" (1/1) ... [2025-03-04 07:46:00,132 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:46:00" (1/1) ... [2025-03-04 07:46:00,152 INFO L138 Inliner]: procedures = 174, calls = 117, calls flagged for inlining = 29, calls inlined = 14, statements flattened = 188 [2025-03-04 07:46:00,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:46:00,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:46:00,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:46:00,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:46:00,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,203 INFO L175 MemorySlicer]: Split 35 memory accesses to 3 slices as follows [2, 4, 29]. 83 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 17 writes are split as follows [0, 4, 13]. [2025-03-04 07:46:00,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:46:00,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:46:00,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:46:00,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:46:00,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (1/1) ... [2025-03-04 07:46:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:46:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:00,267 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:46:00,272 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:46:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:46:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:46:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 07:46:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2025-03-04 07:46:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2025-03-04 07:46:00,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-04 07:46:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 07:46:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2025-03-04 07:46:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:46:00,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2025-03-04 07:46:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 07:46:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 07:46:00,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:46:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:46:00,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:46:00,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:46:00,646 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2025-03-04 07:46:00,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc #t~malloc13#1.base, #t~malloc13#1.offset; [2025-03-04 07:46:00,915 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L813: call ULTIMATE.dealloc(hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset);havoc hid_open_report_~#item~0#1.base, hid_open_report_~#item~0#1.offset; [2025-03-04 07:46:00,943 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2025-03-04 07:46:00,943 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:46:00,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:46:00,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:46:00,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:46:00 BoogieIcfgContainer [2025-03-04 07:46:00,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:46:00,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:46:00,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:46:00,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:46:00,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:45:59" (1/3) ... [2025-03-04 07:46:00,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2a4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:46:00, skipping insertion in model container [2025-03-04 07:46:00,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:46:00" (2/3) ... [2025-03-04 07:46:00,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2a4f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:46:00, skipping insertion in model container [2025-03-04 07:46:00,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:46:00" (3/3) ... [2025-03-04 07:46:00,958 INFO L128 eAbstractionObserver]: Analyzing ICFG memleaks_test23_4.i [2025-03-04 07:46:00,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:46:00,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG memleaks_test23_4.i that has 7 procedures, 197 locations, 1 initial locations, 2 loop locations, and 76 error locations. [2025-03-04 07:46:00,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:46:01,007 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;@337deb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:46:01,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2025-03-04 07:46:01,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 106 states have (on average 1.8396226415094339) internal successors, (195), 182 states have internal predecessors, (195), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:46:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:46:01,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:01,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:01,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:01,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1309613233, now seen corresponding path program 1 times [2025-03-04 07:46:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526575511] [2025-03-04 07:46:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:01,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:01,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:01,028 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:46:01,030 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:46:01,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:46:01,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:46:01,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:01,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:01,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:46:01,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:01,178 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:46:01,260 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:46:01,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:01,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:01,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526575511] [2025-03-04 07:46:01,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526575511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:46:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528531918] [2025-03-04 07:46:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:01,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:46:01,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:01,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:46:01,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:46:01,287 INFO L87 Difference]: Start difference. First operand has 197 states, 106 states have (on average 1.8396226415094339) internal successors, (195), 182 states have internal predecessors, (195), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:46:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:01,800 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2025-03-04 07:46:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:46:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2025-03-04 07:46:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:01,806 INFO L225 Difference]: With dead ends: 213 [2025-03-04 07:46:01,806 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:46:01,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:46:01,809 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 10 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:01,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 804 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:46:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:46:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 204. [2025-03-04 07:46:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 112 states have (on average 1.7946428571428572) internal successors, (201), 187 states have internal predecessors, (201), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 07:46:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2025-03-04 07:46:01,849 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 12 [2025-03-04 07:46:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:01,849 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2025-03-04 07:46:01,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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:46:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2025-03-04 07:46:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:46:01,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:01,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:01,856 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:46:02,054 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:46:02,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:02,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:02,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1309613232, now seen corresponding path program 1 times [2025-03-04 07:46:02,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:02,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [707280371] [2025-03-04 07:46:02,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:02,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:02,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:02,057 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:46:02,062 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:46:02,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:46:02,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:46:02,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:02,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:46:02,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:02,133 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:46:02,209 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:46:02,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:02,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707280371] [2025-03-04 07:46:02,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707280371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:02,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:02,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:46:02,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323353339] [2025-03-04 07:46:02,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:02,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:46:02,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:02,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:46:02,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:46:02,213 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:46:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:02,786 INFO L93 Difference]: Finished difference Result 208 states and 222 transitions. [2025-03-04 07:46:02,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:46:02,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2025-03-04 07:46:02,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:02,788 INFO L225 Difference]: With dead ends: 208 [2025-03-04 07:46:02,788 INFO L226 Difference]: Without dead ends: 208 [2025-03-04 07:46:02,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:46:02,789 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 10 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:02,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1059 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:46:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-04 07:46:02,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2025-03-04 07:46:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 112 states have (on average 1.7767857142857142) internal successors, (199), 187 states have internal predecessors, (199), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2025-03-04 07:46:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 218 transitions. [2025-03-04 07:46:02,796 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 218 transitions. Word has length 12 [2025-03-04 07:46:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:02,797 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 218 transitions. [2025-03-04 07:46:02,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:46:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 218 transitions. [2025-03-04 07:46:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:46:02,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:02,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:02,803 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:46:02,997 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:46:02,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:02,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 433197102, now seen corresponding path program 1 times [2025-03-04 07:46:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055202947] [2025-03-04 07:46:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:02,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:03,002 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:46:03,003 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:46:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:46:03,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:46:03,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:03,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:03,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:46:03,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:03,114 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:46:03,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:03,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:03,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055202947] [2025-03-04 07:46:03,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055202947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:03,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:03,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:03,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072537145] [2025-03-04 07:46:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:03,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:46:03,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:03,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:46:03,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,115 INFO L87 Difference]: Start difference. First operand 204 states and 218 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:46:03,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:03,142 INFO L93 Difference]: Finished difference Result 195 states and 208 transitions. [2025-03-04 07:46:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:46:03,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2025-03-04 07:46:03,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:03,144 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:46:03,144 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 07:46:03,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,144 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:03,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 805 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 07:46:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-03-04 07:46:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 108 states have (on average 1.7685185185185186) internal successors, (191), 179 states have internal predecessors, (191), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 07:46:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2025-03-04 07:46:03,158 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 12 [2025-03-04 07:46:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:03,158 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2025-03-04 07:46:03,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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:46:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2025-03-04 07:46:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:46:03,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:03,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:03,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:46:03,359 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:46:03,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1309782883, now seen corresponding path program 1 times [2025-03-04 07:46:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506429368] [2025-03-04 07:46:03,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:03,362 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:46:03,363 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:46:03,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:46:03,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:46:03,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:03,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:03,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:46:03,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:03,436 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:46:03,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:03,436 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506429368] [2025-03-04 07:46:03,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506429368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160096563] [2025-03-04 07:46:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:03,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:46:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:03,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:46:03,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,437 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:03,465 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2025-03-04 07:46:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:46:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 07:46:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:03,466 INFO L225 Difference]: With dead ends: 196 [2025-03-04 07:46:03,466 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 07:46:03,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,466 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 98 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:03,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 683 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 07:46:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2025-03-04 07:46:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 108 states have (on average 1.7592592592592593) internal successors, (190), 179 states have internal predecessors, (190), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 07:46:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 207 transitions. [2025-03-04 07:46:03,472 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 207 transitions. Word has length 12 [2025-03-04 07:46:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:03,472 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 207 transitions. [2025-03-04 07:46:03,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 207 transitions. [2025-03-04 07:46:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:46:03,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:03,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:03,479 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:46:03,673 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:46:03,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 433027452, now seen corresponding path program 1 times [2025-03-04 07:46:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66314644] [2025-03-04 07:46:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:03,676 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:46:03,677 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:46:03,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:46:03,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:46:03,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:03,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:46:03,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:03,756 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:46:03,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:03,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66314644] [2025-03-04 07:46:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66314644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997673226] [2025-03-04 07:46:03,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:03,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:46:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:03,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:46:03,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,757 INFO L87 Difference]: Start difference. First operand 195 states and 207 transitions. Second operand has 5 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:03,777 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2025-03-04 07:46:03,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:46:03,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 07:46:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:03,778 INFO L225 Difference]: With dead ends: 197 [2025-03-04 07:46:03,778 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 07:46:03,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:03,780 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 92 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:03,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 694 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 07:46:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-03-04 07:46:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 110 states have (on average 1.7454545454545454) internal successors, (192), 181 states have internal predecessors, (192), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-04 07:46:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 209 transitions. [2025-03-04 07:46:03,791 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 209 transitions. Word has length 12 [2025-03-04 07:46:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:03,791 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 209 transitions. [2025-03-04 07:46:03,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 209 transitions. [2025-03-04 07:46:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:46:03,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:03,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:03,798 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:46:03,992 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:46:03,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:03,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 538949691, now seen corresponding path program 1 times [2025-03-04 07:46:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:03,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406527006] [2025-03-04 07:46:03,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:03,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:03,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:03,995 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:46:03,995 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:46:04,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:46:04,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:46:04,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:04,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:04,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:46:04,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:04,077 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:46:04,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:04,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:04,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406527006] [2025-03-04 07:46:04,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406527006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:04,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:04,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:46:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089893340] [2025-03-04 07:46:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:04,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:46:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:04,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:46:04,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:46:04,079 INFO L87 Difference]: Start difference. First operand 197 states and 209 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:04,328 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2025-03-04 07:46:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:46:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 07:46:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:04,329 INFO L225 Difference]: With dead ends: 209 [2025-03-04 07:46:04,329 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 07:46:04,329 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:46:04,329 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:04,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 362 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:46:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 07:46:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2025-03-04 07:46:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 105 states have (on average 1.7714285714285714) internal successors, (186), 176 states have internal predecessors, (186), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:46:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 202 transitions. [2025-03-04 07:46:04,336 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 202 transitions. Word has length 13 [2025-03-04 07:46:04,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:04,336 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 202 transitions. [2025-03-04 07:46:04,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:46:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 202 transitions. [2025-03-04 07:46:04,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:46:04,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:04,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:04,342 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:46:04,537 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:46:04,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:04,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1121644227, now seen corresponding path program 1 times [2025-03-04 07:46:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:04,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365164756] [2025-03-04 07:46:04,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:04,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:04,540 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:46:04,541 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:46:04,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:46:04,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:46:04,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:04,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:04,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:46:04,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:04,668 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |ldv_malloc_#res.base| (select |c_#valid| |ldv_malloc_#res.base|)) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-04 07:46:04,705 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:46:04,706 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:46:04,754 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:46:04,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:04,755 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365164756] [2025-03-04 07:46:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365164756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963088605] [2025-03-04 07:46:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:04,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:46:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:04,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:46:04,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2025-03-04 07:46:04,756 INFO L87 Difference]: Start difference. First operand 191 states and 202 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:46:05,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:05,148 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2025-03-04 07:46:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:46:05,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-04 07:46:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:05,150 INFO L225 Difference]: With dead ends: 242 [2025-03-04 07:46:05,150 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 07:46:05,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=48, Unknown=1, NotChecked=14, Total=90 [2025-03-04 07:46:05,150 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 339 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:05,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 328 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 296 Invalid, 0 Unknown, 254 Unchecked, 0.3s Time] [2025-03-04 07:46:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 07:46:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 201. [2025-03-04 07:46:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 114 states have (on average 1.7543859649122806) internal successors, (200), 185 states have internal predecessors, (200), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 07:46:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2025-03-04 07:46:05,155 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 16 [2025-03-04 07:46:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:05,155 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2025-03-04 07:46:05,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:46:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2025-03-04 07:46:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:46:05,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:05,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:05,163 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:46:05,357 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:46:05,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:05,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1121644226, now seen corresponding path program 1 times [2025-03-04 07:46:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:05,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2087989585] [2025-03-04 07:46:05,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:05,359 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:46:05,360 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:46:05,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:46:05,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:46:05,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:05,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:05,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 07:46:05,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:05,499 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2025-03-04 07:46:05,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:46:05,522 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:46:05,570 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:46:05,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:05,570 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087989585] [2025-03-04 07:46:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087989585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:05,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:46:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165977673] [2025-03-04 07:46:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:46:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:05,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:46:05,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2025-03-04 07:46:05,571 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:46:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:06,183 INFO L93 Difference]: Finished difference Result 241 states and 255 transitions. [2025-03-04 07:46:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:46:06,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2025-03-04 07:46:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:06,184 INFO L225 Difference]: With dead ends: 241 [2025-03-04 07:46:06,184 INFO L226 Difference]: Without dead ends: 241 [2025-03-04 07:46:06,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2025-03-04 07:46:06,185 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:06,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 238 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 458 Invalid, 0 Unknown, 253 Unchecked, 0.5s Time] [2025-03-04 07:46:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-04 07:46:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 200. [2025-03-04 07:46:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 184 states have internal predecessors, (199), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 07:46:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2025-03-04 07:46:06,191 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 16 [2025-03-04 07:46:06,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:06,191 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2025-03-04 07:46:06,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:46:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2025-03-04 07:46:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:46:06,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:06,192 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] [2025-03-04 07:46:06,198 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:46:06,393 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:46:06,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:06,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:06,395 INFO L85 PathProgramCache]: Analyzing trace with hash 41025173, now seen corresponding path program 1 times [2025-03-04 07:46:06,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:06,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898708196] [2025-03-04 07:46:06,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:06,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:06,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:06,398 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:46:06,399 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:46:06,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:46:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:46:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:06,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:46:06,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:06,477 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:46:06,506 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:46:06,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:06,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:06,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898708196] [2025-03-04 07:46:06,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898708196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:06,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:06,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584411085] [2025-03-04 07:46:06,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:06,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:46:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:06,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:46:06,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:06,507 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:06,911 INFO L93 Difference]: Finished difference Result 249 states and 274 transitions. [2025-03-04 07:46:06,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:46:06,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-04 07:46:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:06,912 INFO L225 Difference]: With dead ends: 249 [2025-03-04 07:46:06,912 INFO L226 Difference]: Without dead ends: 249 [2025-03-04 07:46:06,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:06,912 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 59 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:06,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 611 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:46:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-04 07:46:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 225. [2025-03-04 07:46:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 141 states have (on average 1.7588652482269505) internal successors, (248), 209 states have internal predecessors, (248), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 07:46:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2025-03-04 07:46:06,917 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 25 [2025-03-04 07:46:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:06,917 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2025-03-04 07:46:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2025-03-04 07:46:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:46:06,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:06,919 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] [2025-03-04 07:46:06,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:46:07,119 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:46:07,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:07,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash 41025174, now seen corresponding path program 1 times [2025-03-04 07:46:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263166174] [2025-03-04 07:46:07,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:07,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:07,124 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:46:07,125 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:46:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:46:07,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:46:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:07,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:07,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:46:07,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:07,205 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:46:07,250 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:46:07,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:07,251 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263166174] [2025-03-04 07:46:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263166174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563712257] [2025-03-04 07:46:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:07,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:46:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:07,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:46:07,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:07,252 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:07,735 INFO L93 Difference]: Finished difference Result 247 states and 272 transitions. [2025-03-04 07:46:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:46:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-04 07:46:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:07,737 INFO L225 Difference]: With dead ends: 247 [2025-03-04 07:46:07,737 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 07:46:07,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:07,738 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 56 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:07,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 646 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:46:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 07:46:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 226. [2025-03-04 07:46:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 143 states have (on average 1.7412587412587412) internal successors, (249), 209 states have internal predecessors, (249), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 270 transitions. [2025-03-04 07:46:07,742 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 270 transitions. Word has length 25 [2025-03-04 07:46:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:07,742 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 270 transitions. [2025-03-04 07:46:07,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 270 transitions. [2025-03-04 07:46:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 07:46:07,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:07,743 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:46:07,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:46:07,943 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:46:07,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:07,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 770361997, now seen corresponding path program 1 times [2025-03-04 07:46:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:07,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355498286] [2025-03-04 07:46:07,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:07,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:07,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:07,946 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:46:07,947 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:46:08,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 07:46:08,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 07:46:08,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:08,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:08,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:46:08,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:08,065 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:46:08,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:08,065 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:08,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355498286] [2025-03-04 07:46:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355498286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:46:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995006515] [2025-03-04 07:46:08,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:08,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:46:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:08,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:46:08,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:08,067 INFO L87 Difference]: Start difference. First operand 226 states and 270 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:08,083 INFO L93 Difference]: Finished difference Result 226 states and 270 transitions. [2025-03-04 07:46:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:46:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-04 07:46:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:08,085 INFO L225 Difference]: With dead ends: 226 [2025-03-04 07:46:08,085 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:46:08,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:46:08,085 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 82 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:08,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 665 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:08,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:46:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2025-03-04 07:46:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 143 states have (on average 1.7342657342657342) internal successors, (248), 208 states have internal predecessors, (248), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2025-03-04 07:46:08,090 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 27 [2025-03-04 07:46:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:08,090 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2025-03-04 07:46:08,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2025-03-04 07:46:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:46:08,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:08,091 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] [2025-03-04 07:46:08,098 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:46:08,291 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:46:08,292 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1888581804, now seen corresponding path program 1 times [2025-03-04 07:46:08,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:08,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [965001223] [2025-03-04 07:46:08,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:08,294 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:46:08,295 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:46:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:46:08,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:46:08,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:08,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:08,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:46:08,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:08,397 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:46:08,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:08,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965001223] [2025-03-04 07:46:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965001223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:46:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181587171] [2025-03-04 07:46:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:46:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:08,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:46:08,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:08,399 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:08,463 INFO L93 Difference]: Finished difference Result 225 states and 268 transitions. [2025-03-04 07:46:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:46:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-04 07:46:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:08,465 INFO L225 Difference]: With dead ends: 225 [2025-03-04 07:46:08,465 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 07:46:08,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:08,466 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 75 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:08,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 821 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:46:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 07:46:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-03-04 07:46:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 208 states have internal predecessors, (247), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2025-03-04 07:46:08,472 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 28 [2025-03-04 07:46:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:08,472 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2025-03-04 07:46:08,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2025-03-04 07:46:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:46:08,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:08,473 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] [2025-03-04 07:46:08,483 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:46:08,680 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:46:08,680 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1309828488, now seen corresponding path program 1 times [2025-03-04 07:46:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018249285] [2025-03-04 07:46:08,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:08,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:08,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:08,687 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:46:08,688 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:46:08,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:46:08,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:46:08,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:08,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:08,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:46:08,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:08,789 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:46:08,803 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2025-03-04 07:46:08,819 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 07:46:08,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2025-03-04 07:46:08,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:46:08,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:08,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:08,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018249285] [2025-03-04 07:46:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018249285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:08,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638512623] [2025-03-04 07:46:08,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:08,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:46:08,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:08,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:46:08,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2025-03-04 07:46:08,849 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:09,228 INFO L93 Difference]: Finished difference Result 253 states and 277 transitions. [2025-03-04 07:46:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:46:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:46:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:09,232 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:46:09,232 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:46:09,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2025-03-04 07:46:09,232 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 118 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:09,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 362 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 322 Invalid, 0 Unknown, 277 Unchecked, 0.4s Time] [2025-03-04 07:46:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:46:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 222. [2025-03-04 07:46:09,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 143 states have (on average 1.6783216783216783) internal successors, (240), 205 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2025-03-04 07:46:09,239 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 33 [2025-03-04 07:46:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:09,239 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2025-03-04 07:46:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2025-03-04 07:46:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:46:09,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:09,240 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] [2025-03-04 07:46:09,249 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:46:09,447 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:46:09,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1309828489, now seen corresponding path program 1 times [2025-03-04 07:46:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:09,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863691852] [2025-03-04 07:46:09,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:09,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:09,450 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:46:09,452 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:46:09,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:46:09,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:46:09,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:09,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:09,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 07:46:09,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:09,555 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:46:09,560 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:46:09,589 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2025-03-04 07:46:09,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:46:09,608 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:46:09,614 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:46:09,614 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:46:09,668 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:46:09,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:09,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:09,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863691852] [2025-03-04 07:46:09,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863691852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:46:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504920622] [2025-03-04 07:46:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:09,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:46:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:09,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:46:09,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2025-03-04 07:46:09,670 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:10,101 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2025-03-04 07:46:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:46:10,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:46:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:10,102 INFO L225 Difference]: With dead ends: 248 [2025-03-04 07:46:10,102 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 07:46:10,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2025-03-04 07:46:10,103 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 109 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:10,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 360 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 387 Invalid, 0 Unknown, 278 Unchecked, 0.4s Time] [2025-03-04 07:46:10,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 07:46:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2025-03-04 07:46:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 143 states have (on average 1.6503496503496504) internal successors, (236), 205 states have internal predecessors, (236), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 257 transitions. [2025-03-04 07:46:10,108 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 257 transitions. Word has length 33 [2025-03-04 07:46:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:10,109 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 257 transitions. [2025-03-04 07:46:10,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 257 transitions. [2025-03-04 07:46:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:46:10,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:10,112 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:46:10,119 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:46:10,313 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:46:10,313 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:10,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash 319719540, now seen corresponding path program 1 times [2025-03-04 07:46:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:10,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22180767] [2025-03-04 07:46:10,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:10,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:10,315 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:46:10,316 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:46:10,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:46:10,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:46:10,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:10,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:10,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:46:10,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:10,421 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:46:10,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:10,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:10,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22180767] [2025-03-04 07:46:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22180767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:46:10,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252220916] [2025-03-04 07:46:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:46:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:46:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:46:10,422 INFO L87 Difference]: Start difference. First operand 222 states and 257 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:10,434 INFO L93 Difference]: Finished difference Result 226 states and 261 transitions. [2025-03-04 07:46:10,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:46:10,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-03-04 07:46:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:10,436 INFO L225 Difference]: With dead ends: 226 [2025-03-04 07:46:10,436 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:46:10,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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:46:10,436 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:10,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:46:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 07:46:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 147 states have (on average 1.6326530612244898) internal successors, (240), 209 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 261 transitions. [2025-03-04 07:46:10,443 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 261 transitions. Word has length 35 [2025-03-04 07:46:10,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:10,444 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 261 transitions. [2025-03-04 07:46:10,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 261 transitions. [2025-03-04 07:46:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 07:46:10,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:10,444 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] [2025-03-04 07:46:10,451 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:46:10,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:10,645 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:10,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1321368976, now seen corresponding path program 1 times [2025-03-04 07:46:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1460708801] [2025-03-04 07:46:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:10,647 INFO L229 MonitoredProcess]: Starting monitored process 17 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:46:10,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:46:10,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 07:46:10,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 07:46:10,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:10,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:10,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:46:10,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:10,802 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:46:10,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:10,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460708801] [2025-03-04 07:46:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460708801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:46:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515762765] [2025-03-04 07:46:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:46:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:46:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:10,804 INFO L87 Difference]: Start difference. First operand 226 states and 261 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:10,922 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2025-03-04 07:46:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:46:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-04 07:46:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:10,924 INFO L225 Difference]: With dead ends: 224 [2025-03-04 07:46:10,924 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 07:46:10,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:46:10,924 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 60 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:10,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 747 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:46:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 07:46:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-04 07:46:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 147 states have (on average 1.6122448979591837) internal successors, (237), 207 states have internal predecessors, (237), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 258 transitions. [2025-03-04 07:46:10,928 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 258 transitions. Word has length 36 [2025-03-04 07:46:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:10,928 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 258 transitions. [2025-03-04 07:46:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 258 transitions. [2025-03-04 07:46:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:46:10,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:10,929 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, 1, 1, 1, 1] [2025-03-04 07:46:10,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:46:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:11,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:11,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -486091068, now seen corresponding path program 1 times [2025-03-04 07:46:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:11,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1871594115] [2025-03-04 07:46:11,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:11,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:11,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:11,134 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:46:11,135 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:46:11,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:46:11,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:46:11,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:11,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:11,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:46:11,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:11,231 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:46:11,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:11,232 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871594115] [2025-03-04 07:46:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871594115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:11,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:11,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:46:11,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663043418] [2025-03-04 07:46:11,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:46:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:11,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:46:11,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:46:11,233 INFO L87 Difference]: Start difference. First operand 224 states and 258 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:11,249 INFO L93 Difference]: Finished difference Result 226 states and 260 transitions. [2025-03-04 07:46:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:46:11,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-04 07:46:11,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:11,250 INFO L225 Difference]: With dead ends: 226 [2025-03-04 07:46:11,250 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 07:46:11,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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:46:11,251 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:11,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:46:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 07:46:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 07:46:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 149 states have (on average 1.604026845637584) internal successors, (239), 209 states have internal predecessors, (239), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 260 transitions. [2025-03-04 07:46:11,256 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 260 transitions. Word has length 41 [2025-03-04 07:46:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 260 transitions. [2025-03-04 07:46:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:46:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 260 transitions. [2025-03-04 07:46:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:46:11,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:46:11,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:46:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:11,458 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:11,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2111099762, now seen corresponding path program 1 times [2025-03-04 07:46:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199399011] [2025-03-04 07:46:11,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:11,460 INFO L229 MonitoredProcess]: Starting monitored process 19 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:46:11,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:46:11,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:46:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:46:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:11,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:11,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:46:11,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:11,593 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:46:11,593 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:46:11,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-03-04 07:46:11,653 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:46:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:46:11,765 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 16 treesize of output 13 [2025-03-04 07:46:11,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 13 [2025-03-04 07:46:11,804 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:46:11,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:11,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199399011] [2025-03-04 07:46:11,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199399011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:11,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:46:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149327437] [2025-03-04 07:46:11,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:11,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:46:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:11,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:46:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:46:11,806 INFO L87 Difference]: Start difference. First operand 226 states and 260 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:46:12,548 INFO L93 Difference]: Finished difference Result 301 states and 340 transitions. [2025-03-04 07:46:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:46:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2025-03-04 07:46:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:46:12,549 INFO L225 Difference]: With dead ends: 301 [2025-03-04 07:46:12,549 INFO L226 Difference]: Without dead ends: 301 [2025-03-04 07:46:12,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:46:12,550 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 287 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:46:12,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 605 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:46:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-04 07:46:12,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2025-03-04 07:46:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 160 states have (on average 1.6) internal successors, (256), 217 states have internal predecessors, (256), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2025-03-04 07:46:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2025-03-04 07:46:12,557 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 42 [2025-03-04 07:46:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:46:12,557 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2025-03-04 07:46:12,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:46:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2025-03-04 07:46:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:46:12,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:46:12,558 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, 1, 1, 1, 1, 1] [2025-03-04 07:46:12,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:46:12,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:12,759 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2ASSERT_VIOLATIONMEMORY_FREE (and 73 more)] === [2025-03-04 07:46:12,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:46:12,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2111099763, now seen corresponding path program 1 times [2025-03-04 07:46:12,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:46:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736180696] [2025-03-04 07:46:12,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:46:12,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:46:12,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:46:12,762 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:46:12,765 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:46:12,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:46:12,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:46:12,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:46:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:46:12,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:46:12,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:46:12,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:46:13,000 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:46:13,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:46:13,093 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:46:21,201 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:46:21,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:46:21,306 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:46:21,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:46:21,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:46:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736180696] [2025-03-04 07:46:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736180696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:46:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:46:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:46:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293569636] [2025-03-04 07:46:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:46:21,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:46:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:46:21,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:46:21,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=79, Unknown=6, NotChecked=0, Total=110 [2025-03-04 07:46:21,308 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:46:25,333 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:46:33,374 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:46:37,454 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:46:41,467 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:46:45,489 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:46:47,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 07:47:08,514 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:47:12,550 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:47:16,588 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:47:36,693 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]