./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:55:26,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:55:26,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:55:26,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:55:26,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:55:26,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:55:26,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:55:26,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:55:26,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:55:26,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:55:26,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:55:26,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:55:26,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:55:26,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:55:26,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:55:26,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:55:26,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:55:26,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:26,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:26,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:26,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:55:26,978 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-09 21:55:27,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:55:27,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:55:27,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:55:27,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:55:27,177 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:55:27,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i [2025-01-09 21:55:28,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6680b304/a4a5c567bacd48ee85eb727c9a526529/FLAGee689e1f7 [2025-01-09 21:55:28,749 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:55:28,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i [2025-01-09 21:55:28,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6680b304/a4a5c567bacd48ee85eb727c9a526529/FLAGee689e1f7 [2025-01-09 21:55:28,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c6680b304/a4a5c567bacd48ee85eb727c9a526529 [2025-01-09 21:55:28,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:55:28,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:55:28,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:28,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:55:28,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:55:28,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:28" (1/1) ... [2025-01-09 21:55:28,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400d36ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:28, skipping insertion in model container [2025-01-09 21:55:28,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:28" (1/1) ... [2025-01-09 21:55:28,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:55:29,047 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,064 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,066 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,069 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,072 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,102 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,107 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,108 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,115 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,129 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,130 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,131 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,134 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,135 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,141 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,142 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,142 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,142 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,144 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:29,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:29,169 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-01-09 21:55:29,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@191dd68a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:29, skipping insertion in model container [2025-01-09 21:55:29,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:29,170 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-01-09 21:55:29,171 INFO L158 Benchmark]: Toolchain (without parser) took 396.92ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 82.6MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:55:29,173 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:55:29,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.46ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 82.6MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:55:29,174 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.46ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 82.6MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 757]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:55:30,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:55:30,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-01-09 21:55:30,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:55:30,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:55:30,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:55:30,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:55:30,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:55:30,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:55:30,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:55:30,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:55:30,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:55:30,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:55:30,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:55:30,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:55:30,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:55:30,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:55:30,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:30,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:30,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:55:30,929 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:55:30,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-09 21:55:31,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:55:31,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:55:31,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:55:31,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:55:31,177 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:55:31,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i [2025-01-09 21:55:32,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a51db806/88f9a4d10d174b8f921113e5e0cb1b11/FLAGb830ec6cf [2025-01-09 21:55:32,656 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:55:32,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i [2025-01-09 21:55:32,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a51db806/88f9a4d10d174b8f921113e5e0cb1b11/FLAGb830ec6cf [2025-01-09 21:55:32,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a51db806/88f9a4d10d174b8f921113e5e0cb1b11 [2025-01-09 21:55:32,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:55:32,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:55:32,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:32,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:55:32,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:55:32,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:32" (1/1) ... [2025-01-09 21:55:32,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:32, skipping insertion in model container [2025-01-09 21:55:32,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:55:32" (1/1) ... [2025-01-09 21:55:33,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:55:33,237 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,263 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,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-01-09 21:55:33,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-01-09 21:55:33,273 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,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-01-09 21:55:33,304 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,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-01-09 21:55:33,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-01-09 21:55:33,316 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,317 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,318 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,319 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,320 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,320 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,327 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,327 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,328 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,328 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,336 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:33,365 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-09 21:55:33,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:55:33,408 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,423 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,424 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,429 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,436 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,459 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,464 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,465 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,470 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,479 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,482 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,484 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,484 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,484 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,486 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,488 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,490 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,493 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:55:33,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:33,502 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:55:33,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:55:33,594 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:55:33,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33 WrapperNode [2025-01-09 21:55:33,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:55:33,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:55:33,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:55:33,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:55:33,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,702 INFO L138 Inliner]: procedures = 179, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1374 [2025-01-09 21:55:33,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:55:33,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:55:33,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:55:33,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:55:33,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,817 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [401, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 98 writes are split as follows [98, 0]. [2025-01-09 21:55:33,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:55:33,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:55:33,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:55:33,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:55:33,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (1/1) ... [2025-01-09 21:55:33,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:55:33,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:33,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:55:33,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:55:33,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:55:33,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 21:55:33,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:55:33,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:55:34,112 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:55:34,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:55:46,791 INFO L? ?]: Removed 197 outVars from TransFormulas that were not future-live. [2025-01-09 21:55:46,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:55:46,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:55:46,801 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-09 21:55:46,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:46 BoogieIcfgContainer [2025-01-09 21:55:46,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:55:46,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:55:46,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:55:46,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:55:46,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:55:32" (1/3) ... [2025-01-09 21:55:46,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecc1cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:46, skipping insertion in model container [2025-01-09 21:55:46,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:55:33" (2/3) ... [2025-01-09 21:55:46,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecc1cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:55:46, skipping insertion in model container [2025-01-09 21:55:46,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:55:46" (3/3) ... [2025-01-09 21:55:46,808 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-3.i [2025-01-09 21:55:46,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:55:46,818 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test4-3.i that has 3 procedures, 248 locations, 1 initial locations, 45 loop locations, and 2 error locations. [2025-01-09 21:55:46,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:55:46,857 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;@2ce5b112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:55:46,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:55:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 236 states have internal predecessors, (385), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:55:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 21:55:46,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:46,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 21:55:46,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1419133, now seen corresponding path program 1 times [2025-01-09 21:55:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:55:46,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11854701] [2025-01-09 21:55:46,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:46,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:46,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:46,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:55:46,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:55:47,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 21:55:47,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 21:55:47,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:47,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:47,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 21:55:47,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:55:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:55:47,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:55:47,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:55:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11854701] [2025-01-09 21:55:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11854701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:47,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:47,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:55:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311030988] [2025-01-09 21:55:47,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:47,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:55:47,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:55:47,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:55:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:55:47,057 INFO L87 Difference]: Start difference. First operand has 244 states, 234 states have (on average 1.6452991452991452) internal successors, (385), 236 states have internal predecessors, (385), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 21:55:51,122 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-01-09 21:55:55,161 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-01-09 21:55:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:55:55,647 INFO L93 Difference]: Finished difference Result 303 states and 398 transitions. [2025-01-09 21:55:55,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:55:55,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-01-09 21:55:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:55:55,658 INFO L225 Difference]: With dead ends: 303 [2025-01-09 21:55:55,659 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 21:55:55,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-01-09 21:55:55,662 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 77 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 21:55:55,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 645 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 21:55:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 21:55:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 250. [2025-01-09 21:55:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 241 states have (on average 1.3112033195020747) internal successors, (316), 242 states have internal predecessors, (316), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:55:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 328 transitions. [2025-01-09 21:55:55,699 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 328 transitions. Word has length 4 [2025-01-09 21:55:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:55:55,699 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 328 transitions. [2025-01-09 21:55:55,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 21:55:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 328 transitions. [2025-01-09 21:55:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 21:55:55,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:55:55,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:55:55,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:55:55,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:55,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:55:55,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:55:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1517024063, now seen corresponding path program 1 times [2025-01-09 21:55:55,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:55:55,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1576017313] [2025-01-09 21:55:55,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:55:55,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:55:55,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:55:55,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:55:55,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:55:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 21:55:56,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 21:55:56,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:55:56,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:55:56,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:55:56,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:55:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:55:56,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:55:56,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:55:56,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576017313] [2025-01-09 21:55:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576017313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:55:56,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:55:56,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:55:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310556896] [2025-01-09 21:55:56,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:55:56,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:55:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:55:56,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:55:56,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:55:56,113 INFO L87 Difference]: Start difference. First operand 250 states and 328 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 21:56:00,592 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-01-09 21:56:03,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:56:09,139 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-01-09 21:56:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:09,595 INFO L93 Difference]: Finished difference Result 368 states and 481 transitions. [2025-01-09 21:56:09,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:56:09,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-01-09 21:56:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:09,599 INFO L225 Difference]: With dead ends: 368 [2025-01-09 21:56:09,599 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 21:56:09,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:09,600 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 154 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:09,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 863 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 13.5s Time] [2025-01-09 21:56:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 21:56:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-09 21:56:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 356 states have (on average 1.300561797752809) internal successors, (463), 357 states have internal predecessors, (463), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 481 transitions. [2025-01-09 21:56:09,614 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 481 transitions. Word has length 10 [2025-01-09 21:56:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:09,614 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 481 transitions. [2025-01-09 21:56:09,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-01-09 21:56:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 481 transitions. [2025-01-09 21:56:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:56:09,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:09,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:56:09,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:56:09,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:09,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:09,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -956714940, now seen corresponding path program 1 times [2025-01-09 21:56:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459110013] [2025-01-09 21:56:09,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:09,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:09,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:09,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:56:09,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:56:09,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:56:09,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:09,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:09,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:09,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:56:10,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:10,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459110013] [2025-01-09 21:56:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459110013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:10,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:10,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:56:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370781004] [2025-01-09 21:56:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:10,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:56:10,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:10,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:56:10,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:56:10,023 INFO L87 Difference]: Start difference. First operand 368 states and 481 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 21:56:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:10,426 INFO L93 Difference]: Finished difference Result 418 states and 546 transitions. [2025-01-09 21:56:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:56:10,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-01-09 21:56:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:10,430 INFO L225 Difference]: With dead ends: 418 [2025-01-09 21:56:10,430 INFO L226 Difference]: Without dead ends: 418 [2025-01-09 21:56:10,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-01-09 21:56:10,431 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 118 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:10,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 594 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:56:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-09 21:56:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 366. [2025-01-09 21:56:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 354 states have (on average 1.2966101694915255) internal successors, (459), 355 states have internal predecessors, (459), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:10,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 477 transitions. [2025-01-09 21:56:10,465 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 477 transitions. Word has length 23 [2025-01-09 21:56:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:10,465 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 477 transitions. [2025-01-09 21:56:10,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-01-09 21:56:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 477 transitions. [2025-01-09 21:56:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 21:56:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:10,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:56:10,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:56:10,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:10,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:10,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1344107650, now seen corresponding path program 1 times [2025-01-09 21:56:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:10,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [773619002] [2025-01-09 21:56:10,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:10,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:10,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:10,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:56:10,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 21:56:10,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 21:56:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:10,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:56:10,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:56:10,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:10,839 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773619002] [2025-01-09 21:56:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773619002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:56:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368404189] [2025-01-09 21:56:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:10,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:56:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:10,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:56:10,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:10,840 INFO L87 Difference]: Start difference. First operand 366 states and 477 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-01-09 21:56:15,007 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-01-09 21:56:19,336 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-01-09 21:56:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:21,668 INFO L93 Difference]: Finished difference Result 418 states and 545 transitions. [2025-01-09 21:56:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:56:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2025-01-09 21:56:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:21,671 INFO L225 Difference]: With dead ends: 418 [2025-01-09 21:56:21,671 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 21:56:21,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-01-09 21:56:21,673 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:21,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 895 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 2 Unknown, 0 Unchecked, 10.8s Time] [2025-01-09 21:56:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 21:56:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 362. [2025-01-09 21:56:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 1.2971428571428572) internal successors, (454), 351 states have internal predecessors, (454), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 472 transitions. [2025-01-09 21:56:21,691 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 472 transitions. Word has length 23 [2025-01-09 21:56:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:21,691 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 472 transitions. [2025-01-09 21:56:21,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-01-09 21:56:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 472 transitions. [2025-01-09 21:56:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 21:56:21,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:21,695 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:21,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:56:21,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:21,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1035054689, now seen corresponding path program 1 times [2025-01-09 21:56:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:21,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518248413] [2025-01-09 21:56:21,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:21,903 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:21,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:56:22,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:56:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:56:22,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:22,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:22,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:22,413 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 21:56:22,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:22,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518248413] [2025-01-09 21:56:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518248413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:22,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:56:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544524436] [2025-01-09 21:56:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:56:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:22,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:56:22,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:56:22,415 INFO L87 Difference]: Start difference. First operand 362 states and 472 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:22,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:22,533 INFO L93 Difference]: Finished difference Result 402 states and 512 transitions. [2025-01-09 21:56:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:56:22,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 143 [2025-01-09 21:56:22,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:22,535 INFO L225 Difference]: With dead ends: 402 [2025-01-09 21:56:22,535 INFO L226 Difference]: Without dead ends: 402 [2025-01-09 21:56:22,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01-09 21:56:22,536 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 8 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 573 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-01-09 21:56:22,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 573 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:56:22,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-01-09 21:56:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-01-09 21:56:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 390 states have (on average 1.2666666666666666) internal successors, (494), 391 states have internal predecessors, (494), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 512 transitions. [2025-01-09 21:56:22,548 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 512 transitions. Word has length 143 [2025-01-09 21:56:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:22,548 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 512 transitions. [2025-01-09 21:56:22,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 512 transitions. [2025-01-09 21:56:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 21:56:22,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:22,550 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:22,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:56:22,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:22,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1523101795, now seen corresponding path program 1 times [2025-01-09 21:56:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118933454] [2025-01-09 21:56:22,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:22,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:22,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:22,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:56:23,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:56:23,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:56:23,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:23,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:23,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:23,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:56:23,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:23,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118933454] [2025-01-09 21:56:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118933454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:56:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722710094] [2025-01-09 21:56:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:56:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:23,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:56:23,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:56:23,252 INFO L87 Difference]: Start difference. First operand 402 states and 512 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:23,349 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2025-01-09 21:56:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:56:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 143 [2025-01-09 21:56:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:23,351 INFO L225 Difference]: With dead ends: 442 [2025-01-09 21:56:23,351 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 21:56:23,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-01-09 21:56:23,352 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 9 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 573 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-01-09 21:56:23,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 573 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:56:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 21:56:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 21:56:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 430 states have (on average 1.241860465116279) internal successors, (534), 431 states have internal predecessors, (534), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 552 transitions. [2025-01-09 21:56:23,358 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 552 transitions. Word has length 143 [2025-01-09 21:56:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:23,359 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 552 transitions. [2025-01-09 21:56:23,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2025-01-09 21:56:23,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 21:56:23,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:23,361 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:23,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 21:56:23,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:23,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1965492897, now seen corresponding path program 1 times [2025-01-09 21:56:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1443216957] [2025-01-09 21:56:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:23,564 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:23,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:56:23,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:56:23,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:56:23,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:23,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:24,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:56:24,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 21:56:24,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:24,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443216957] [2025-01-09 21:56:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443216957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:56:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109315492] [2025-01-09 21:56:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:24,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:56:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:56:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:24,380 INFO L87 Difference]: Start difference. First operand 442 states and 552 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:28,753 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-01-09 21:56:32,759 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-01-09 21:56:37,952 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 [] [2025-01-09 21:56:41,962 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-01-09 21:56:47,857 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-01-09 21:56:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:49,166 INFO L93 Difference]: Finished difference Result 450 states and 560 transitions. [2025-01-09 21:56:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:56:49,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 143 [2025-01-09 21:56:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:49,170 INFO L225 Difference]: With dead ends: 450 [2025-01-09 21:56:49,170 INFO L226 Difference]: Without dead ends: 450 [2025-01-09 21:56:49,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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-01-09 21:56:49,171 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 311 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.8s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:49,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 696 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 24.8s Time] [2025-01-09 21:56:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-01-09 21:56:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2025-01-09 21:56:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 431 states have (on average 1.2389791183294663) internal successors, (534), 432 states have internal predecessors, (534), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 552 transitions. [2025-01-09 21:56:49,180 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 552 transitions. Word has length 143 [2025-01-09 21:56:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:49,180 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 552 transitions. [2025-01-09 21:56:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 552 transitions. [2025-01-09 21:56:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 21:56:49,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:49,181 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:49,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 21:56:49,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:49,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:49,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 60935893, now seen corresponding path program 1 times [2025-01-09 21:56:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:49,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281150732] [2025-01-09 21:56:49,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:49,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:49,384 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:49,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 21:56:49,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:56:49,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:56:49,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:49,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:49,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:49,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 21:56:49,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:49,907 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281150732] [2025-01-09 21:56:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281150732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:56:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51455269] [2025-01-09 21:56:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:56:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:56:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:49,908 INFO L87 Difference]: Start difference. First operand 443 states and 552 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:50,003 INFO L93 Difference]: Finished difference Result 409 states and 496 transitions. [2025-01-09 21:56:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:56:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 144 [2025-01-09 21:56:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:50,005 INFO L225 Difference]: With dead ends: 409 [2025-01-09 21:56:50,005 INFO L226 Difference]: Without dead ends: 409 [2025-01-09 21:56:50,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-01-09 21:56:50,005 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 32 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 832 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-01-09 21:56:50,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 832 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:56:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-01-09 21:56:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2025-01-09 21:56:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 397 states have (on average 1.2040302267002518) internal successors, (478), 398 states have internal predecessors, (478), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 496 transitions. [2025-01-09 21:56:50,025 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 496 transitions. Word has length 144 [2025-01-09 21:56:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:50,025 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 496 transitions. [2025-01-09 21:56:50,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-09 21:56:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 496 transitions. [2025-01-09 21:56:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 21:56:50,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:50,026 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:50,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 21:56:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:50,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:50,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:50,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1584641287, now seen corresponding path program 1 times [2025-01-09 21:56:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008708847] [2025-01-09 21:56:50,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:50,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:50,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:50,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:50,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 21:56:50,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:56:50,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:56:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:50,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:50,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:56:50,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:50,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:50,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008708847] [2025-01-09 21:56:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008708847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:56:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703612222] [2025-01-09 21:56:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:56:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:50,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:56:50,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:50,729 INFO L87 Difference]: Start difference. First operand 409 states and 496 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:50,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:50,818 INFO L93 Difference]: Finished difference Result 375 states and 440 transitions. [2025-01-09 21:56:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:56:50,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2025-01-09 21:56:50,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:50,820 INFO L225 Difference]: With dead ends: 375 [2025-01-09 21:56:50,820 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 21:56:50,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-01-09 21:56:50,820 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 32 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 799 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-01-09 21:56:50,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 799 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:56:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 21:56:50,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-09 21:56:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 363 states have (on average 1.162534435261708) internal successors, (422), 364 states have internal predecessors, (422), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:56:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 440 transitions. [2025-01-09 21:56:50,826 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 440 transitions. Word has length 144 [2025-01-09 21:56:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:50,826 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 440 transitions. [2025-01-09 21:56:50,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 440 transitions. [2025-01-09 21:56:50,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 21:56:50,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:50,827 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:50,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 21:56:51,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:51,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:51,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:51,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1555476629, now seen corresponding path program 1 times [2025-01-09 21:56:51,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1715434711] [2025-01-09 21:56:51,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:51,035 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:51,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 21:56:51,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 21:56:51,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 21:56:51,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:51,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:56:51,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 21:56:51,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:56:51,564 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:51,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715434711] [2025-01-09 21:56:51,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715434711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:56:51,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:56:51,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:56:51,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479977349] [2025-01-09 21:56:51,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:56:51,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:56:51,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:51,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:56:51,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:56:51,565 INFO L87 Difference]: Start difference. First operand 375 states and 440 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:51,602 INFO L93 Difference]: Finished difference Result 378 states and 446 transitions. [2025-01-09 21:56:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:56:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 144 [2025-01-09 21:56:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:51,605 INFO L225 Difference]: With dead ends: 378 [2025-01-09 21:56:51,605 INFO L226 Difference]: Without dead ends: 378 [2025-01-09 21:56:51,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 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-01-09 21:56:51,605 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:51,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 857 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:56:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-09 21:56:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-01-09 21:56:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 365 states have (on average 1.1643835616438356) internal successors, (425), 367 states have internal predecessors, (425), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 21:56:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 446 transitions. [2025-01-09 21:56:51,611 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 446 transitions. Word has length 144 [2025-01-09 21:56:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:51,611 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 446 transitions. [2025-01-09 21:56:51,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:56:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 446 transitions. [2025-01-09 21:56:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 21:56:51,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:51,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:51,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 21:56:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:51,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1511689579, now seen corresponding path program 1 times [2025-01-09 21:56:51,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1455436958] [2025-01-09 21:56:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:56:51,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:51,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:51,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:51,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 21:56:52,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 21:56:52,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 21:56:52,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:56:52,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:52,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:56:52,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 21:56:52,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:56:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 21:56:52,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:52,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455436958] [2025-01-09 21:56:52,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455436958] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:56:52,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:56:52,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-09 21:56:52,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154482094] [2025-01-09 21:56:52,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:56:52,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:56:52,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:52,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:56:52,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:56:52,498 INFO L87 Difference]: Start difference. First operand 378 states and 446 transitions. Second operand has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 21:56:52,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:52,639 INFO L93 Difference]: Finished difference Result 389 states and 467 transitions. [2025-01-09 21:56:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:56:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-01-09 21:56:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:52,641 INFO L225 Difference]: With dead ends: 389 [2025-01-09 21:56:52,641 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 21:56:52,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 288 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-01-09 21:56:52,642 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 5 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:52,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 853 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:56:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 21:56:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2025-01-09 21:56:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 373 states have (on average 1.1769436997319034) internal successors, (439), 375 states have internal predecessors, (439), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2025-01-09 21:56:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 463 transitions. [2025-01-09 21:56:52,649 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 463 transitions. Word has length 148 [2025-01-09 21:56:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:52,649 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 463 transitions. [2025-01-09 21:56:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.5) internal successors, (140), 8 states have internal predecessors, (140), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 21:56:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 463 transitions. [2025-01-09 21:56:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 21:56:52,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:52,651 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:52,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 21:56:52,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:52,852 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:52,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2067141611, now seen corresponding path program 2 times [2025-01-09 21:56:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361293268] [2025-01-09 21:56:52,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:56:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:52,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:52,857 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:52,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 21:56:53,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-01-09 21:56:53,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:56:53,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:56:53,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:56:53,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:56:53,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:56:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-01-09 21:56:53,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:56:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 21:56:53,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:56:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361293268] [2025-01-09 21:56:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361293268] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:56:53,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:56:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 21:56:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120553398] [2025-01-09 21:56:53,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:56:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:56:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:56:53,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:56:53,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:56:53,580 INFO L87 Difference]: Start difference. First operand 387 states and 463 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 21:56:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:56:53,901 INFO L93 Difference]: Finished difference Result 395 states and 473 transitions. [2025-01-09 21:56:53,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:56:53,902 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 156 [2025-01-09 21:56:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:56:53,904 INFO L225 Difference]: With dead ends: 395 [2025-01-09 21:56:53,904 INFO L226 Difference]: Without dead ends: 393 [2025-01-09 21:56:53,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 302 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-01-09 21:56:53,905 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:56:53,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1423 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:56:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-01-09 21:56:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2025-01-09 21:56:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 377 states have (on average 1.1803713527851458) internal successors, (445), 379 states have internal predecessors, (445), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-01-09 21:56:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 466 transitions. [2025-01-09 21:56:53,912 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 466 transitions. Word has length 156 [2025-01-09 21:56:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:56:53,912 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 466 transitions. [2025-01-09 21:56:53,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 21:56:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 466 transitions. [2025-01-09 21:56:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 21:56:53,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:56:53,914 INFO L218 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 21:56:53,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 21:56:54,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:54,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:56:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:56:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash -717248235, now seen corresponding path program 3 times [2025-01-09 21:56:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:56:54,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [149136212] [2025-01-09 21:56:54,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:56:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:56:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:56:54,119 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:56:54,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 21:56:54,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 13 equivalence classes.