./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed 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/uthash-2.0.2/uthash_OAT_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:28:12,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:28:12,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:28:12,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:28:12,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:28:13,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:28:13,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:28:13,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:28:13,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:28:13,005 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:28:13,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:28:13,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:28:13,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:28:13,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:28:13,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:28:13,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:28:13,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:28:13,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:28:13,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:28:13,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:28:13,009 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-memcleanup) ) 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2025-03-08 22:28:13,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:28:13,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:28:13,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:28:13,233 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:28:13,234 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:28:13,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-03-08 22:28:14,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49312b6ea/1d3935d09ce64dc9951e7fe34255d15e/FLAG3e778008d [2025-03-08 22:28:14,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:28:14,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-03-08 22:28:14,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49312b6ea/1d3935d09ce64dc9951e7fe34255d15e/FLAG3e778008d [2025-03-08 22:28:14,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49312b6ea/1d3935d09ce64dc9951e7fe34255d15e [2025-03-08 22:28:14,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:28:14,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:28:14,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:28:14,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:28:14,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:28:14,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:28:14" (1/1) ... [2025-03-08 22:28:14,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0f66d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:14, skipping insertion in model container [2025-03-08 22:28:14,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:28:14" (1/1) ... [2025-03-08 22:28:14,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:28:15,241 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-08 22:28:15,266 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-08 22:28:15,269 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-08 22:28:15,271 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-08 22:28:15,276 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-08 22:28:15,296 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-08 22:28:15,298 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-08 22:28:15,300 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-08 22:28:15,300 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-08 22:28:15,302 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-08 22:28:15,303 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-08 22:28:15,303 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-08 22:28:15,303 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-08 22:28:15,306 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-08 22:28:15,306 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-08 22:28:15,307 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-08 22:28:15,309 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-08 22:28:15,309 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-08 22:28:15,310 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-08 22:28:15,312 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-08 22:28:15,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:28:15,329 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-08 22:28:15,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@62c9f990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:15, skipping insertion in model container [2025-03-08 22:28:15,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:28:15,330 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 22:28:15,331 INFO L158 Benchmark]: Toolchain (without parser) took 406.34ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:28:15,334 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:28:15,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.65ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:28:15,336 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.37ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.65ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 91.2MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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/uthash-2.0.2/uthash_OAT_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:28:16,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:28:16,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-08 22:28:16,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:28:16,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:28:17,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:28:17,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:28:17,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:28:17,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:28:17,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:28:17,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:28:17,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:28:17,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:28:17,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:28:17,019 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:28:17,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:28:17,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:28:17,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:28:17,020 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:28:17,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:28:17,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:28:17,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:28:17,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:28:17,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:28:17,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:28:17,023 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-memcleanup) ) 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 -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2025-03-08 22:28:17,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:28:17,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:28:17,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:28:17,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:28:17,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:28:17,399 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-03-08 22:28:18,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8e258f/4a7fc933280148b2851d58fd6f090c1b/FLAGb6975dcae [2025-03-08 22:28:18,763 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:28:18,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-03-08 22:28:18,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8e258f/4a7fc933280148b2851d58fd6f090c1b/FLAGb6975dcae [2025-03-08 22:28:19,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8e258f/4a7fc933280148b2851d58fd6f090c1b [2025-03-08 22:28:19,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:28:19,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:28:19,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:28:19,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:28:19,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:28:19,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f3a973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19, skipping insertion in model container [2025-03-08 22:28:19,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:28:19,366 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-08 22:28:19,392 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-08 22:28:19,395 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-08 22:28:19,398 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-08 22:28:19,402 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-08 22:28:19,425 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-08 22:28:19,426 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-08 22:28:19,427 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-08 22:28:19,427 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-08 22:28:19,430 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-08 22:28:19,431 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-08 22:28:19,432 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-08 22:28:19,432 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-08 22:28:19,435 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-08 22:28:19,435 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-08 22:28:19,439 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-08 22:28:19,439 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-08 22:28:19,440 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-08 22:28:19,440 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-08 22:28:19,443 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-08 22:28:19,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:28:19,458 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 22:28:19,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:28:19,503 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-08 22:28:19,518 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-08 22:28:19,520 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-08 22:28:19,525 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-08 22:28:19,528 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-08 22:28:19,540 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-08 22:28:19,541 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-08 22:28:19,542 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-08 22:28:19,542 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-08 22:28:19,543 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-08 22:28:19,544 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-08 22:28:19,545 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-08 22:28:19,545 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-08 22:28:19,547 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-08 22:28:19,548 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-08 22:28:19,549 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-08 22:28:19,549 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-08 22:28:19,550 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-08 22:28:19,550 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-08 22:28:19,552 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-08 22:28:19,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:28:19,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:28:19,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:28:19,694 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:28:19,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19 WrapperNode [2025-03-08 22:28:19,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:28:19,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:28:19,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:28:19,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:28:19,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,759 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1156 [2025-03-08 22:28:19,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:28:19,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:28:19,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:28:19,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:28:19,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,845 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-08 22:28:19,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:28:19,904 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:28:19,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:28:19,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:28:19,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (1/1) ... [2025-03-08 22:28:19,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:28:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:19,931 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-08 22:28:19,932 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-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 22:28:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 22:28:19,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 22:28:19,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 22:28:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 22:28:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 22:28:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 22:28:19,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:28:19,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:28:20,124 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:28:20,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:28:27,055 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 22:28:27,119 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-03-08 22:28:27,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:28:27,128 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:28:27,128 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:28:27,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:28:27 BoogieIcfgContainer [2025-03-08 22:28:27,129 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:28:27,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:28:27,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:28:27,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:28:27,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:28:19" (1/3) ... [2025-03-08 22:28:27,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94c88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:28:27, skipping insertion in model container [2025-03-08 22:28:27,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:28:19" (2/3) ... [2025-03-08 22:28:27,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d94c88a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:28:27, skipping insertion in model container [2025-03-08 22:28:27,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:28:27" (3/3) ... [2025-03-08 22:28:27,135 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2025-03-08 22:28:27,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:28:27,145 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test3-2.i that has 6 procedures, 243 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-08 22:28:27,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:28:27,180 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;@4224ddad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:28:27,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:28:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 219 states have (on average 1.6621004566210045) internal successors, (364), 228 states have internal predecessors, (364), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 22:28:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:28:27,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:27,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:27,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:27,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2030207923, now seen corresponding path program 1 times [2025-03-08 22:28:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503064111] [2025-03-08 22:28:27,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:27,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:27,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:27,202 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-08 22:28:27,204 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-08 22:28:27,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:28:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:28:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:27,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 22:28:27,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:27,376 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-08 22:28:27,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:27,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:27,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503064111] [2025-03-08 22:28:27,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503064111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:27,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:27,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:28:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809742654] [2025-03-08 22:28:27,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:28:27,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:28:27,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:28:27,404 INFO L87 Difference]: Start difference. First operand has 235 states, 219 states have (on average 1.6621004566210045) internal successors, (364), 228 states have internal predecessors, (364), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:27,429 INFO L93 Difference]: Finished difference Result 233 states and 309 transitions. [2025-03-08 22:28:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:28:27,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:28:27,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:27,436 INFO L225 Difference]: With dead ends: 233 [2025-03-08 22:28:27,436 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 22:28:27,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:28:27,439 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:27,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:28:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 22:28:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-08 22:28:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 217 states have (on average 1.3317972350230414) internal successors, (289), 224 states have internal predecessors, (289), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 22:28:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 307 transitions. [2025-03-08 22:28:27,475 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 307 transitions. Word has length 11 [2025-03-08 22:28:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:27,475 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 307 transitions. [2025-03-08 22:28:27,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 307 transitions. [2025-03-08 22:28:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:28:27,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:27,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:27,482 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-08 22:28:27,677 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-08 22:28:27,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1773689166, now seen corresponding path program 1 times [2025-03-08 22:28:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:27,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509323651] [2025-03-08 22:28:27,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:27,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:27,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:27,682 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-08 22:28:27,683 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-08 22:28:27,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:28:27,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:28:27,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:27,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:27,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:28:27,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:27,933 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-08 22:28:27,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:27,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:27,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509323651] [2025-03-08 22:28:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509323651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:27,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:28:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180001377] [2025-03-08 22:28:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:28:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:27,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:28:27,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:28:27,935 INFO L87 Difference]: Start difference. First operand 231 states and 307 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:32,449 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 [] [2025-03-08 22:28:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:32,450 INFO L93 Difference]: Finished difference Result 381 states and 512 transitions. [2025-03-08 22:28:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:28:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:28:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:32,499 INFO L225 Difference]: With dead ends: 381 [2025-03-08 22:28:32,499 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 22:28:32,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:28:32,499 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 182 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:32,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 559 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 22:28:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 22:28:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 350. [2025-03-08 22:28:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 331 states have (on average 1.3413897280966767) internal successors, (444), 343 states have internal predecessors, (444), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:28:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 472 transitions. [2025-03-08 22:28:32,513 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 472 transitions. Word has length 13 [2025-03-08 22:28:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:32,513 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 472 transitions. [2025-03-08 22:28:32,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 472 transitions. [2025-03-08 22:28:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 22:28:32,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:32,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:32,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:28:32,715 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-08 22:28:32,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1773659375, now seen corresponding path program 1 times [2025-03-08 22:28:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32218572] [2025-03-08 22:28:32,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:32,718 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-08 22:28:32,719 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-08 22:28:32,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 22:28:32,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 22:28:32,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:32,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:32,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:28:32,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:32,852 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:32,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:32,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:32,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-08 22:28:32,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:28:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-08 22:28:32,972 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-08 22:28:32,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:32,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:32,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32218572] [2025-03-08 22:28:32,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32218572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:32,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:32,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:32,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997309369] [2025-03-08 22:28:32,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:32,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:32,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:32,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:32,976 INFO L87 Difference]: Start difference. First operand 350 states and 472 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:33,624 INFO L93 Difference]: Finished difference Result 549 states and 743 transitions. [2025-03-08 22:28:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:28:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 22:28:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:33,627 INFO L225 Difference]: With dead ends: 549 [2025-03-08 22:28:33,627 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 22:28:33,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:28:33,628 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 268 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:33,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 853 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:28:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 22:28:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 349. [2025-03-08 22:28:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 330 states have (on average 1.3393939393939394) internal successors, (442), 342 states have internal predecessors, (442), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:28:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 470 transitions. [2025-03-08 22:28:33,648 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 470 transitions. Word has length 13 [2025-03-08 22:28:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:33,648 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 470 transitions. [2025-03-08 22:28:33,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:28:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 470 transitions. [2025-03-08 22:28:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 22:28:33,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:33,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2025-03-08 22:28:33,657 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-08 22:28:33,850 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-08 22:28:33,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:33,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash -500022500, now seen corresponding path program 1 times [2025-03-08 22:28:33,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:33,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [492293504] [2025-03-08 22:28:33,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:33,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:33,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:33,854 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-08 22:28:33,857 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-08 22:28:34,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:28:34,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:28:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:34,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:28:34,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:28:34,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:34,172 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:34,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492293504] [2025-03-08 22:28:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492293504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:34,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:28:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756123284] [2025-03-08 22:28:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:28:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:34,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:28:34,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:28:34,174 INFO L87 Difference]: Start difference. First operand 349 states and 470 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:34,265 INFO L93 Difference]: Finished difference Result 389 states and 510 transitions. [2025-03-08 22:28:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:28:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2025-03-08 22:28:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:34,267 INFO L225 Difference]: With dead ends: 389 [2025-03-08 22:28:34,267 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 22:28:34,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:28:34,267 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 9 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:34,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 559 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:28:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 22:28:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-08 22:28:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 370 states have (on average 1.3027027027027027) internal successors, (482), 382 states have internal predecessors, (482), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 22:28:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 510 transitions. [2025-03-08 22:28:34,275 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 510 transitions. Word has length 82 [2025-03-08 22:28:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:34,275 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 510 transitions. [2025-03-08 22:28:34,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 510 transitions. [2025-03-08 22:28:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 22:28:34,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:34,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2025-03-08 22:28:34,296 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-08 22:28:34,485 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-08 22:28:34,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -16347173, now seen corresponding path program 1 times [2025-03-08 22:28:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155546368] [2025-03-08 22:28:34,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:34,488 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-08 22:28:34,490 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-08 22:28:34,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 22:28:34,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 22:28:34,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:34,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:28:34,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:28:34,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:34,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155546368] [2025-03-08 22:28:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155546368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065454366] [2025-03-08 22:28:34,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:34,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:34,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:35,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:35,000 INFO L87 Difference]: Start difference. First operand 389 states and 510 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:39,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:28:43,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:28:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:45,526 INFO L93 Difference]: Finished difference Result 570 states and 760 transitions. [2025-03-08 22:28:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:28:45,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2025-03-08 22:28:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:45,528 INFO L225 Difference]: With dead ends: 570 [2025-03-08 22:28:45,528 INFO L226 Difference]: Without dead ends: 570 [2025-03-08 22:28:45,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:28:45,529 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 632 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:45,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 627 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-03-08 22:28:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-08 22:28:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 488. [2025-03-08 22:28:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 464 states have (on average 1.3125) internal successors, (609), 481 states have internal predecessors, (609), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 22:28:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 647 transitions. [2025-03-08 22:28:45,540 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 647 transitions. Word has length 82 [2025-03-08 22:28:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:45,540 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 647 transitions. [2025-03-08 22:28:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 647 transitions. [2025-03-08 22:28:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 22:28:45,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:45,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:45,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:28:45,744 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-08 22:28:45,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1028825523, now seen corresponding path program 1 times [2025-03-08 22:28:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350006126] [2025-03-08 22:28:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:45,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:45,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:45,747 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-08 22:28:45,748 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-08 22:28:45,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 22:28:46,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 22:28:46,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:46,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:46,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:28:46,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:28:46,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:46,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:46,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350006126] [2025-03-08 22:28:46,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350006126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081436088] [2025-03-08 22:28:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:46,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:46,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:46,101 INFO L87 Difference]: Start difference. First operand 488 states and 647 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:46,224 INFO L93 Difference]: Finished difference Result 454 states and 591 transitions. [2025-03-08 22:28:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:28:46,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-03-08 22:28:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:46,226 INFO L225 Difference]: With dead ends: 454 [2025-03-08 22:28:46,226 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 22:28:46,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:28:46,226 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 32 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:46,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 811 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:28:46,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 22:28:46,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-08 22:28:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 430 states have (on average 1.286046511627907) internal successors, (553), 447 states have internal predecessors, (553), 20 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (18), 6 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 22:28:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 591 transitions. [2025-03-08 22:28:46,235 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 591 transitions. Word has length 85 [2025-03-08 22:28:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:46,235 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 591 transitions. [2025-03-08 22:28:46,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 591 transitions. [2025-03-08 22:28:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 22:28:46,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:46,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:46,246 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-08 22:28:46,436 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-08 22:28:46,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:46,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1600070310, now seen corresponding path program 1 times [2025-03-08 22:28:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:46,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063877491] [2025-03-08 22:28:46,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:46,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:46,439 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-08 22:28:46,440 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-08 22:28:46,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 22:28:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 22:28:46,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:46,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:46,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:28:46,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:28:46,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:46,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:46,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063877491] [2025-03-08 22:28:46,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063877491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:46,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965774116] [2025-03-08 22:28:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:46,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:46,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:46,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:46,773 INFO L87 Difference]: Start difference. First operand 454 states and 591 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:46,823 INFO L93 Difference]: Finished difference Result 457 states and 595 transitions. [2025-03-08 22:28:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:28:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-03-08 22:28:46,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:46,826 INFO L225 Difference]: With dead ends: 457 [2025-03-08 22:28:46,826 INFO L226 Difference]: Without dead ends: 457 [2025-03-08 22:28:46,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-08 22:28:46,827 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:46,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 875 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:28:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-08 22:28:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-08 22:28:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 432 states have (on average 1.287037037037037) internal successors, (556), 450 states have internal predecessors, (556), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 6 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 22:28:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 595 transitions. [2025-03-08 22:28:46,838 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 595 transitions. Word has length 85 [2025-03-08 22:28:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:46,838 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 595 transitions. [2025-03-08 22:28:46,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 595 transitions. [2025-03-08 22:28:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 22:28:46,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:46,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:46,854 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-08 22:28:47,040 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-08 22:28:47,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:47,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2138751746, now seen corresponding path program 1 times [2025-03-08 22:28:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1324943359] [2025-03-08 22:28:47,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:47,043 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-08 22:28:47,044 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-08 22:28:47,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 22:28:47,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 22:28:47,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:47,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:28:47,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:47,372 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:47,372 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:47,373 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:47,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-08 22:28:47,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:28:47,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-08 22:28:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:28:47,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:47,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324943359] [2025-03-08 22:28:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324943359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:47,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856099649] [2025-03-08 22:28:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:47,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:47,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:47,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:47,453 INFO L87 Difference]: Start difference. First operand 457 states and 595 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:47,952 INFO L93 Difference]: Finished difference Result 599 states and 780 transitions. [2025-03-08 22:28:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:28:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2025-03-08 22:28:47,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:47,954 INFO L225 Difference]: With dead ends: 599 [2025-03-08 22:28:47,955 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 22:28:47,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:28:47,955 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 201 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:47,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 865 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:28:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 22:28:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 459. [2025-03-08 22:28:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 434 states have (on average 1.2857142857142858) internal successors, (558), 452 states have internal predecessors, (558), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 6 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 22:28:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 597 transitions. [2025-03-08 22:28:47,963 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 597 transitions. Word has length 87 [2025-03-08 22:28:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:47,963 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 597 transitions. [2025-03-08 22:28:47,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 597 transitions. [2025-03-08 22:28:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 22:28:47,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:47,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:47,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 22:28:48,165 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-08 22:28:48,165 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash -708299168, now seen corresponding path program 1 times [2025-03-08 22:28:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1814381181] [2025-03-08 22:28:48,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:48,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:48,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:48,168 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-08 22:28:48,170 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-08 22:28:48,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 22:28:48,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 22:28:48,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:48,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:48,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:28:48,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:28:48,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:28:48,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:48,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814381181] [2025-03-08 22:28:48,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814381181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:28:48,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:28:48,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:28:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291125634] [2025-03-08 22:28:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:28:48,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:28:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:48,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:28:48,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:28:48,553 INFO L87 Difference]: Start difference. First operand 459 states and 597 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:48,661 INFO L93 Difference]: Finished difference Result 468 states and 582 transitions. [2025-03-08 22:28:48,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:28:48,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 125 [2025-03-08 22:28:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:48,663 INFO L225 Difference]: With dead ends: 468 [2025-03-08 22:28:48,663 INFO L226 Difference]: Without dead ends: 468 [2025-03-08 22:28:48,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:28:48,663 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 30 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:48,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 782 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:28:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-08 22:28:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-03-08 22:28:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 443 states have (on average 1.2257336343115124) internal successors, (543), 461 states have internal predecessors, (543), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 6 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 22:28:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 582 transitions. [2025-03-08 22:28:48,678 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 582 transitions. Word has length 125 [2025-03-08 22:28:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:48,679 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 582 transitions. [2025-03-08 22:28:48,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:28:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 582 transitions. [2025-03-08 22:28:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 22:28:48,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:48,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:48,693 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-08 22:28:48,880 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-08 22:28:48,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:48,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:48,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1843814727, now seen corresponding path program 1 times [2025-03-08 22:28:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911305321] [2025-03-08 22:28:48,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:28:48,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:48,885 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-08 22:28:48,885 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-08 22:28:49,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-08 22:28:49,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 22:28:49,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:28:49,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:49,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:28:49,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:28:49,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:28:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:28:49,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:49,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911305321] [2025-03-08 22:28:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911305321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:28:49,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:28:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 22:28:49,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470978830] [2025-03-08 22:28:49,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:28:49,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:28:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:49,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:28:49,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:28:49,405 INFO L87 Difference]: Start difference. First operand 468 states and 582 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:28:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:49,544 INFO L93 Difference]: Finished difference Result 479 states and 599 transitions. [2025-03-08 22:28:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:28:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2025-03-08 22:28:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:49,547 INFO L225 Difference]: With dead ends: 479 [2025-03-08 22:28:49,548 INFO L226 Difference]: Without dead ends: 479 [2025-03-08 22:28:49,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:28:49,549 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 5 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:49,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1396 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:28:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-08 22:28:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2025-03-08 22:28:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 451 states have (on average 1.2350332594235034) internal successors, (557), 469 states have internal predecessors, (557), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 6 states have call predecessors, (20), 18 states have call successors, (20) [2025-03-08 22:28:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 597 transitions. [2025-03-08 22:28:49,557 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 597 transitions. Word has length 125 [2025-03-08 22:28:49,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:49,557 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 597 transitions. [2025-03-08 22:28:49,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:28:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 597 transitions. [2025-03-08 22:28:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 22:28:49,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:49,558 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1] [2025-03-08 22:28:49,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:28:49,758 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-08 22:28:49,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:49,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1864556413, now seen corresponding path program 2 times [2025-03-08 22:28:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130698067] [2025-03-08 22:28:49,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:28:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:49,762 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-08 22:28:49,762 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-08 22:28:49,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-08 22:28:50,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:28:50,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:28:50,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:50,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:28:50,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:28:50,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:28:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:28:50,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130698067] [2025-03-08 22:28:50,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130698067] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:28:50,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:28:50,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 22:28:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670795283] [2025-03-08 22:28:50,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:28:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:28:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:28:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:28:50,438 INFO L87 Difference]: Start difference. First operand 477 states and 597 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:28:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:28:50,709 INFO L93 Difference]: Finished difference Result 485 states and 607 transitions. [2025-03-08 22:28:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:28:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2025-03-08 22:28:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:28:50,715 INFO L225 Difference]: With dead ends: 485 [2025-03-08 22:28:50,715 INFO L226 Difference]: Without dead ends: 483 [2025-03-08 22:28:50,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:28:50,716 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 6 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:28:50,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1405 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:28:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-08 22:28:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2025-03-08 22:28:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 455 states have (on average 1.2373626373626374) internal successors, (563), 473 states have internal predecessors, (563), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 6 states have call predecessors, (19), 18 states have call successors, (19) [2025-03-08 22:28:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 602 transitions. [2025-03-08 22:28:50,727 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 602 transitions. Word has length 129 [2025-03-08 22:28:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:28:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 602 transitions. [2025-03-08 22:28:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:28:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 602 transitions. [2025-03-08 22:28:50,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 22:28:50,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:28:50,728 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:28:50,742 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-08 22:28:50,929 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-08 22:28:50,929 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:28:50,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:28:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1867198403, now seen corresponding path program 3 times [2025-03-08 22:28:50,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:28:50,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204025731] [2025-03-08 22:28:50,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:28:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:28:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:28:50,931 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-08 22:28:50,932 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-08 22:28:51,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 133 statements into 6 equivalence classes. [2025-03-08 22:28:51,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 116 of 133 statements. [2025-03-08 22:28:51,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 22:28:51,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:28:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:28:51,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:28:51,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:51,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:51,374 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:28:51,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-08 22:28:53,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:28:53,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 87 [2025-03-08 22:28:53,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:28:53,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 74 [2025-03-08 22:28:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:28:53,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:28:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:28:53,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:28:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204025731] [2025-03-08 22:28:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204025731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:28:53,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:28:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-08 22:28:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455895811] [2025-03-08 22:28:53,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:28:53,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 22:28:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:28:53,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 22:28:53,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:28:53,909 INFO L87 Difference]: Start difference. First operand 481 states and 602 transitions. Second operand has 12 states, 12 states have (on average 15.166666666666666) internal successors, (182), 12 states have internal predecessors, (182), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:28:58,306 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-08 22:29:02,510 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-08 22:29:06,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:29:10,836 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-08 22:29:14,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:29:18,964 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-08 22:29:22,999 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-08 22:29:27,076 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-08 22:29:31,301 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-08 22:29:35,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:29:39,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:29:43,529 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-08 22:29:47,553 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-08 22:29:51,714 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-08 22:29:56,012 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]