./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.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_BER_nondet_test3-2.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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:44:43,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:44:43,817 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:44:43,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:44:43,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:44:43,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:44:43,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:44:43,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:44:43,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:44:43,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:44:43,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:44:43,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:44:43,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:44:43,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:44:43,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:44:43,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:44:43,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:44:43,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:44:43,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:44:43,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:44:43,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:44:43,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:44:43,860 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-01-09 21:44:44,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:44:44,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:44:44,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:44:44,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:44:44,067 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:44:44,068 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_BER_nondet_test3-2.i [2025-01-09 21:44:45,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6905c40e0/08cc577353964022a85bc74e26bb6622/FLAG69c4a31f9 [2025-01-09 21:44:45,633 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:44:45,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2025-01-09 21:44:45,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6905c40e0/08cc577353964022a85bc74e26bb6622/FLAG69c4a31f9 [2025-01-09 21:44:45,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6905c40e0/08cc577353964022a85bc74e26bb6622 [2025-01-09 21:44:45,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:44:45,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:44:45,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:44:45,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:44:45,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:44:45,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:45" (1/1) ... [2025-01-09 21:44:45,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae21ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:45, skipping insertion in model container [2025-01-09 21:44:45,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:45" (1/1) ... [2025-01-09 21:44:45,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:44:45,861 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:44:45,879 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:44:45,881 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:44:45,883 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:44:45,887 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:44:45,906 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:44:45,907 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:44:45,908 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:44:45,908 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:44:45,910 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:44:45,911 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:44:45,911 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:44:45,912 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:44:45,915 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:44:45,915 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:44:45,917 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:44:45,918 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:44:45,918 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:44:45,918 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:44:45,921 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:44:45,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:44:45,934 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:44:45,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@799cbe1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:45, skipping insertion in model container [2025-01-09 21:44:45,934 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:44:45,934 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-01-09 21:44:45,936 INFO L158 Benchmark]: Toolchain (without parser) took 281.94ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 111.8MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:44:45,936 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:44:45,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 111.8MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:44:45,937 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 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.17ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 111.8MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_BER_nondet_test3-2.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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:44:47,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:44:47,996 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:44:48,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:44:48,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:44:48,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:44:48,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:44:48,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:44:48,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:44:48,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:44:48,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:44:48,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:44:48,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:44:48,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:44:48,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:44:48,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:44:48,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:44:48,047 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2025-01-09 21:44:48,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:44:48,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:44:48,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:44:48,238 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:44:48,238 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:44:48,238 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_BER_nondet_test3-2.i [2025-01-09 21:44:49,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abac9b4a4/2e679ea42b374233b4275f766e0c1688/FLAG8a83c4713 [2025-01-09 21:44:49,731 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:44:49,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-2.i [2025-01-09 21:44:49,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abac9b4a4/2e679ea42b374233b4275f766e0c1688/FLAG8a83c4713 [2025-01-09 21:44:49,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abac9b4a4/2e679ea42b374233b4275f766e0c1688 [2025-01-09 21:44:49,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:44:49,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:44:49,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:44:49,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:44:49,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:44:49,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:49" (1/1) ... [2025-01-09 21:44:49,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ff6373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:49, skipping insertion in model container [2025-01-09 21:44:49,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:44:49" (1/1) ... [2025-01-09 21:44:49,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:44:50,034 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:44:50,071 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:44:50,078 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:44:50,082 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:44:50,086 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:44:50,105 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:44:50,105 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:44:50,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:44:50,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:44:50,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:44:50,109 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:44:50,110 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:44:50,110 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:44:50,113 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:44:50,114 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:44:50,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:44:50,116 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:44:50,116 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:44:50,117 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:44:50,137 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:44:50,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:44:50,149 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-01-09 21:44:50,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:44:50,173 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:44:50,182 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:44:50,183 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:44:50,185 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:44:50,188 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:44:50,200 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:44:50,200 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:44:50,201 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:44:50,201 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:44:50,203 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:44:50,203 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:44:50,204 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:44:50,204 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:44:50,206 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:44:50,207 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:44:50,208 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:44:50,208 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:44:50,209 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:44:50,209 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:44:50,211 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:44:50,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:44:50,215 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:44:50,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:44:50,321 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:44:50,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50 WrapperNode [2025-01-09 21:44:50,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:44:50,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:44:50,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:44:50,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:44:50,333 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:44:50" (1/1) ... [2025-01-09 21:44:50,351 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:44:50" (1/1) ... [2025-01-09 21:44:50,379 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1137 [2025-01-09 21:44:50,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:44:50,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:44:50,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:44:50,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:44:50,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,438 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 266, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-01-09 21:44:50,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:44:50,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:44:50,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:44:50,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:44:50,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (1/1) ... [2025-01-09 21:44:50,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:44:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:44:50,512 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:44:50,524 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:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 21:44:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 21:44:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 21:44:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 21:44:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 21:44:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:44:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 21:44:50,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:44:50,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:44:50,689 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:44:50,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:44:57,001 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-01-09 21:44:57,001 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:44:57,009 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:44:57,009 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 21:44:57,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:57 BoogieIcfgContainer [2025-01-09 21:44:57,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:44:57,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:44:57,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:44:57,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:44:57,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:44:49" (1/3) ... [2025-01-09 21:44:57,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e87c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:57, skipping insertion in model container [2025-01-09 21:44:57,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:44:50" (2/3) ... [2025-01-09 21:44:57,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e87c6b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:44:57, skipping insertion in model container [2025-01-09 21:44:57,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:44:57" (3/3) ... [2025-01-09 21:44:57,015 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-2.i [2025-01-09 21:44:57,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:44:57,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test3-2.i that has 5 procedures, 236 locations, 1 initial locations, 43 loop locations, and 2 error locations. [2025-01-09 21:44:57,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:44:57,052 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;@34eba0d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:44:57,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:44:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 228 states, 218 states have (on average 1.646788990825688) internal successors, (359), 221 states have internal predecessors, (359), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 21:44:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 21:44:57,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:44:57,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 21:44:57,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:44:57,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:44:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1665323, now seen corresponding path program 1 times [2025-01-09 21:44:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:44:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820360148] [2025-01-09 21:44:57,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:44:57,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:44:57,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:44:57,068 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:44:57,070 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:44:57,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 21:44:57,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 21:44:57,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:44:57,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:44:57,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:44:57,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:44:57,262 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_16| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16|)))) is different from true [2025-01-09 21:44:57,265 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:44:57,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:44:57,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:44:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820360148] [2025-01-09 21:44:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820360148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:44:57,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:44:57,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:44:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756161812] [2025-01-09 21:44:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:44:57,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:44:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:44:57,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:44:57,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-01-09 21:44:57,283 INFO L87 Difference]: Start difference. First operand has 228 states, 218 states have (on average 1.646788990825688) internal successors, (359), 221 states have internal predecessors, (359), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:45:01,422 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:45:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:01,990 INFO L93 Difference]: Finished difference Result 348 states and 460 transitions. [2025-01-09 21:45:01,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:45:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:45:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:02,001 INFO L225 Difference]: With dead ends: 348 [2025-01-09 21:45:02,003 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 21:45:02,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-01-09 21:45:02,005 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 154 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 461 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:02,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 561 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 1 Unknown, 461 Unchecked, 4.7s Time] [2025-01-09 21:45:02,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 21:45:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 225. [2025-01-09 21:45:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 216 states have (on average 1.3101851851851851) internal successors, (283), 218 states have internal predecessors, (283), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 21:45:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 293 transitions. [2025-01-09 21:45:02,057 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 293 transitions. Word has length 4 [2025-01-09 21:45:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:02,059 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 293 transitions. [2025-01-09 21:45:02,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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:45:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 293 transitions. [2025-01-09 21:45:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 21:45:02,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:02,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:02,067 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:45:02,261 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:45:02,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:02,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:02,261 INFO L85 PathProgramCache]: Analyzing trace with hash -264369565, now seen corresponding path program 1 times [2025-01-09 21:45:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902718148] [2025-01-09 21:45:02,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:02,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:02,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:02,268 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:45:02,270 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:45:02,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 21:45:02,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 21:45:02,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:02,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:02,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:45:02,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:02,529 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:45:02,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:02,530 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902718148] [2025-01-09 21:45:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902718148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:02,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:02,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:45:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472021750] [2025-01-09 21:45:02,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:02,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:02,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:45:02,533 INFO L87 Difference]: Start difference. First operand 225 states and 293 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:06,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:45:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:08,045 INFO L93 Difference]: Finished difference Result 368 states and 481 transitions. [2025-01-09 21:45:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:45:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 21:45:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:08,050 INFO L225 Difference]: With dead ends: 368 [2025-01-09 21:45:08,050 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 21:45:08,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:45:08,051 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 178 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 822 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 21:45:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 21:45:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 338. [2025-01-09 21:45:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 328 states have (on average 1.3109756097560976) internal successors, (430), 331 states have internal predecessors, (430), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:45:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2025-01-09 21:45:08,071 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 15 [2025-01-09 21:45:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:08,071 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2025-01-09 21:45:08,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2025-01-09 21:45:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 21:45:08,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:08,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:08,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:45:08,272 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:45:08,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:08,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1117799766, now seen corresponding path program 1 times [2025-01-09 21:45:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:08,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994412849] [2025-01-09 21:45:08,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:08,278 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:45:08,280 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:45:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 21:45:08,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 21:45:08,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:08,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:08,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:45:08,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:08,481 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17|)))) is different from true [2025-01-09 21:45:08,481 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:45:08,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:08,482 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994412849] [2025-01-09 21:45:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994412849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:45:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255083077] [2025-01-09 21:45:08,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-01-09 21:45:08,484 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:45:12,599 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:45:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:13,178 INFO L93 Difference]: Finished difference Result 428 states and 558 transitions. [2025-01-09 21:45:13,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:45:13,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-01-09 21:45:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:13,186 INFO L225 Difference]: With dead ends: 428 [2025-01-09 21:45:13,186 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 21:45:13,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2025-01-09 21:45:13,187 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 86 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:13,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 557 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 393 Unchecked, 4.7s Time] [2025-01-09 21:45:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 21:45:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 382. [2025-01-09 21:45:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 371 states have (on average 1.3099730458221024) internal successors, (486), 374 states have internal predecessors, (486), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 21:45:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 500 transitions. [2025-01-09 21:45:13,210 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 500 transitions. Word has length 14 [2025-01-09 21:45:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:13,210 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 500 transitions. [2025-01-09 21:45:13,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:45:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 500 transitions. [2025-01-09 21:45:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:45:13,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:13,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:13,218 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:45:13,411 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:45:13,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:13,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 54852710, now seen corresponding path program 1 times [2025-01-09 21:45:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101978079] [2025-01-09 21:45:13,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:13,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:13,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:13,416 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:45:13,417 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:45:13,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:45:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:45:13,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:13,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:13,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:13,575 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:45:13,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:13,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101978079] [2025-01-09 21:45:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101978079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:13,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:13,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:45:13,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082115803] [2025-01-09 21:45:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:13,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:45:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:13,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:45:13,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:45:13,577 INFO L87 Difference]: Start difference. First operand 382 states and 500 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:13,647 INFO L93 Difference]: Finished difference Result 442 states and 560 transitions. [2025-01-09 21:45:13,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:45:13,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 21:45:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:13,649 INFO L225 Difference]: With dead ends: 442 [2025-01-09 21:45:13,649 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 21:45:13,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:45:13,650 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 8 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 531 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:45:13,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 531 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 21:45:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 21:45:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 431 states have (on average 1.2668213457076567) internal successors, (546), 434 states have internal predecessors, (546), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 21:45:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 560 transitions. [2025-01-09 21:45:13,657 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 560 transitions. Word has length 50 [2025-01-09 21:45:13,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:13,658 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 560 transitions. [2025-01-09 21:45:13,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:13,658 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 560 transitions. [2025-01-09 21:45:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:45:13,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:13,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:13,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:45:13,859 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:45:13,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:13,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -7186904, now seen corresponding path program 1 times [2025-01-09 21:45:13,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:13,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [418179852] [2025-01-09 21:45:13,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:13,862 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:45:13,865 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:45:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:45:14,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:45:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:14,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:14,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:14,028 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:45:14,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:14,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418179852] [2025-01-09 21:45:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418179852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:14,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:14,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:45:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8426241] [2025-01-09 21:45:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:14,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:14,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:14,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:45:14,029 INFO L87 Difference]: Start difference. First operand 442 states and 560 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:14,097 INFO L93 Difference]: Finished difference Result 391 states and 476 transitions. [2025-01-09 21:45:14,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:45:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 21:45:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:14,099 INFO L225 Difference]: With dead ends: 391 [2025-01-09 21:45:14,099 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 21:45:14,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:45:14,099 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 32 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 769 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:45:14,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 769 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 21:45:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-01-09 21:45:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 380 states have (on average 1.2157894736842105) internal successors, (462), 383 states have internal predecessors, (462), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 21:45:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 476 transitions. [2025-01-09 21:45:14,105 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 476 transitions. Word has length 50 [2025-01-09 21:45:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:14,105 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 476 transitions. [2025-01-09 21:45:14,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 476 transitions. [2025-01-09 21:45:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:45:14,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:14,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:14,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:45:14,307 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:45:14,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 470029402, now seen corresponding path program 1 times [2025-01-09 21:45:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609240381] [2025-01-09 21:45:14,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:14,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:14,310 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:45:14,311 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:45:14,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:45:14,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:45:14,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:14,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:14,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:45:14,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:14,445 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:14,445 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:14,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:14,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-01-09 21:45:14,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:45:14,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-01-09 21:45:14,579 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:45:14,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:14,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609240381] [2025-01-09 21:45:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609240381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:45:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324203170] [2025-01-09 21:45:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:14,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:45:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:14,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:45:14,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:45:14,580 INFO L87 Difference]: Start difference. First operand 391 states and 476 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:15,088 INFO L93 Difference]: Finished difference Result 393 states and 487 transitions. [2025-01-09 21:45:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:45:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 21:45:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:15,090 INFO L225 Difference]: With dead ends: 393 [2025-01-09 21:45:15,090 INFO L226 Difference]: Without dead ends: 390 [2025-01-09 21:45:15,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:45:15,091 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 108 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:15,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1155 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:45:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-01-09 21:45:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 343. [2025-01-09 21:45:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 336 states have internal predecessors, (412), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:45:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 424 transitions. [2025-01-09 21:45:15,099 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 424 transitions. Word has length 50 [2025-01-09 21:45:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:15,101 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 424 transitions. [2025-01-09 21:45:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:45:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 424 transitions. [2025-01-09 21:45:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:45:15,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:15,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:15,118 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:45:15,305 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:45:15,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1847965022, now seen corresponding path program 1 times [2025-01-09 21:45:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725567373] [2025-01-09 21:45:15,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:15,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:15,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:15,312 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:45:15,313 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:45:15,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:45:15,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:45:15,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:15,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:15,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:15,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:45:15,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:15,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:15,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725567373] [2025-01-09 21:45:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725567373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:15,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:15,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:45:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863391668] [2025-01-09 21:45:15,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:15,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:45:15,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:15,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:45:15,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:45:15,658 INFO L87 Difference]: Start difference. First operand 343 states and 424 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:15,728 INFO L93 Difference]: Finished difference Result 383 states and 464 transitions. [2025-01-09 21:45:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:45:15,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-01-09 21:45:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:15,730 INFO L225 Difference]: With dead ends: 383 [2025-01-09 21:45:15,730 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 21:45:15,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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:45:15,731 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 8 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 509 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:45:15,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 509 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 21:45:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-01-09 21:45:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2117962466487935) internal successors, (452), 376 states have internal predecessors, (452), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:45:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 464 transitions. [2025-01-09 21:45:15,736 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 464 transitions. Word has length 86 [2025-01-09 21:45:15,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:15,736 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 464 transitions. [2025-01-09 21:45:15,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 464 transitions. [2025-01-09 21:45:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:45:15,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:15,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:15,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 21:45:15,941 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:45:15,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:15,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1715034848, now seen corresponding path program 1 times [2025-01-09 21:45:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451012350] [2025-01-09 21:45:15,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:15,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:15,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:15,945 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:45:15,946 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:45:16,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:45:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:45:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:16,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:16,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:16,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:45:16,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:16,247 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451012350] [2025-01-09 21:45:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451012350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:16,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:45:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115977755] [2025-01-09 21:45:16,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:16,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:16,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:16,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:45:16,248 INFO L87 Difference]: Start difference. First operand 383 states and 464 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:16,316 INFO L93 Difference]: Finished difference Result 349 states and 408 transitions. [2025-01-09 21:45:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:45:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-01-09 21:45:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:16,317 INFO L225 Difference]: With dead ends: 349 [2025-01-09 21:45:16,317 INFO L226 Difference]: Without dead ends: 349 [2025-01-09 21:45:16,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 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:45:16,318 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 32 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 736 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:45:16,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 736 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-09 21:45:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-01-09 21:45:16,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 339 states have (on average 1.168141592920354) internal successors, (396), 342 states have internal predecessors, (396), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 21:45:16,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 408 transitions. [2025-01-09 21:45:16,323 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 408 transitions. Word has length 86 [2025-01-09 21:45:16,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:16,323 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 408 transitions. [2025-01-09 21:45:16,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 408 transitions. [2025-01-09 21:45:16,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 21:45:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:16,325 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:16,334 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:45:16,525 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:45:16,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:16,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2004398674, now seen corresponding path program 1 times [2025-01-09 21:45:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:16,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1883012911] [2025-01-09 21:45:16,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:16,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:16,528 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:45:16,530 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:45:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:45:16,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:45:16,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:16,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:16,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:16,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:45:16,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:16,843 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883012911] [2025-01-09 21:45:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883012911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:45:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268488444] [2025-01-09 21:45:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:16,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:16,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:16,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:45:16,844 INFO L87 Difference]: Start difference. First operand 349 states and 408 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:16,867 INFO L93 Difference]: Finished difference Result 352 states and 412 transitions. [2025-01-09 21:45:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:45:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2025-01-09 21:45:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:16,870 INFO L225 Difference]: With dead ends: 352 [2025-01-09 21:45:16,870 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 21:45:16,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 83 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:45:16,870 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:16,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 800 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:45:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 21:45:16,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-01-09 21:45:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 341 states have (on average 1.1700879765395895) internal successors, (399), 345 states have internal predecessors, (399), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-09 21:45:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2025-01-09 21:45:16,876 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 86 [2025-01-09 21:45:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:16,876 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2025-01-09 21:45:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2025-01-09 21:45:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 21:45:16,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:16,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:16,887 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:45:17,080 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:45:17,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1690092684, now seen corresponding path program 1 times [2025-01-09 21:45:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575518938] [2025-01-09 21:45:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:17,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:17,084 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:45:17,085 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:45:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:45:17,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:45:17,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:17,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:17,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:45:17,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:45:17,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:45:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:45:17,486 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575518938] [2025-01-09 21:45:17,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575518938] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:45:17,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:45:17,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-01-09 21:45:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283991865] [2025-01-09 21:45:17,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:45:17,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:45:17,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:17,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:45:17,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:45:17,488 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:45:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:17,584 INFO L93 Difference]: Finished difference Result 363 states and 429 transitions. [2025-01-09 21:45:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:45:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 88 [2025-01-09 21:45:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:17,586 INFO L225 Difference]: With dead ends: 363 [2025-01-09 21:45:17,586 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 21:45:17,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 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:45:17,587 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 5 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:17,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1062 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 21:45:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-01-09 21:45:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 349 states have (on average 1.183381088825215) internal successors, (413), 353 states have internal predecessors, (413), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 21:45:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 427 transitions. [2025-01-09 21:45:17,594 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 427 transitions. Word has length 88 [2025-01-09 21:45:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 427 transitions. [2025-01-09 21:45:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:45:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 427 transitions. [2025-01-09 21:45:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 21:45:17,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:17,595 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:17,605 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:45:17,798 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:45:17,799 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:17,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 962881938, now seen corresponding path program 2 times [2025-01-09 21:45:17,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:17,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [40504924] [2025-01-09 21:45:17,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:45:17,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:17,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:17,802 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:45:17,803 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:45:18,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-01-09 21:45:18,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:45:18,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:45:18,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:18,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 21:45:18,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:18,434 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:18,434 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:18,435 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:45:18,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-01-09 21:45:18,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:45:18,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-01-09 21:45:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 21:45:18,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:18,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:18,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40504924] [2025-01-09 21:45:18,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40504924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:18,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:18,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:45:18,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822974001] [2025-01-09 21:45:18,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:18,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:45:18,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:18,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:45:18,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:45:18,508 INFO L87 Difference]: Start difference. First operand 361 states and 427 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:18,700 INFO L93 Difference]: Finished difference Result 477 states and 571 transitions. [2025-01-09 21:45:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:45:18,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2025-01-09 21:45:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:18,702 INFO L225 Difference]: With dead ends: 477 [2025-01-09 21:45:18,702 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 21:45:18,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:45:18,702 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 339 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:18,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 766 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:45:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 21:45:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 363. [2025-01-09 21:45:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 351 states have (on average 1.1823361823361824) internal successors, (415), 355 states have internal predecessors, (415), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 21:45:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 429 transitions. [2025-01-09 21:45:18,708 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 429 transitions. Word has length 92 [2025-01-09 21:45:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:18,708 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 429 transitions. [2025-01-09 21:45:18,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 429 transitions. [2025-01-09 21:45:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 21:45:18,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:18,709 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:18,722 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:45:18,909 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:45:18,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:18,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1587850955, now seen corresponding path program 1 times [2025-01-09 21:45:18,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675936414] [2025-01-09 21:45:18,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:18,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:18,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:18,915 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:45:18,916 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:45:19,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:45:19,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:45:19,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:19,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:19,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 21:45:19,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 21:45:19,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:45:19,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:19,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675936414] [2025-01-09 21:45:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675936414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:45:19,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:45:19,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:45:19,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239365130] [2025-01-09 21:45:19,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:45:19,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:45:19,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:19,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:45:19,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:45:19,459 INFO L87 Difference]: Start difference. First operand 363 states and 429 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:23,667 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:45:27,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:45:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:28,747 INFO L93 Difference]: Finished difference Result 528 states and 635 transitions. [2025-01-09 21:45:28,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:45:28,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 127 [2025-01-09 21:45:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:28,750 INFO L225 Difference]: With dead ends: 528 [2025-01-09 21:45:28,750 INFO L226 Difference]: Without dead ends: 528 [2025-01-09 21:45:28,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 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:45:28,751 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 521 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:28,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 573 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2025-01-09 21:45:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-09 21:45:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 457. [2025-01-09 21:45:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 443 states have (on average 1.182844243792325) internal successors, (524), 448 states have internal predecessors, (524), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 21:45:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 542 transitions. [2025-01-09 21:45:28,758 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 542 transitions. Word has length 127 [2025-01-09 21:45:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:28,758 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 542 transitions. [2025-01-09 21:45:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 21:45:28,758 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 542 transitions. [2025-01-09 21:45:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 21:45:28,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:28,759 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:28,771 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:45:28,959 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:45:28,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:28,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2057171472, now seen corresponding path program 1 times [2025-01-09 21:45:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983661488] [2025-01-09 21:45:28,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:45:28,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:28,963 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:45:28,964 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:45:29,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 21:45:29,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 21:45:29,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:45:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:29,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 21:45:29,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:45:29,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:45:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 21:45:29,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:29,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983661488] [2025-01-09 21:45:29,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983661488] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:45:29,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:45:29,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-09 21:45:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572683535] [2025-01-09 21:45:29,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:45:29,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:45:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:45:29,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:45:29,483 INFO L87 Difference]: Start difference. First operand 457 states and 542 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:45:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:29,676 INFO L93 Difference]: Finished difference Result 465 states and 552 transitions. [2025-01-09 21:45:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:45:29,677 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 135 [2025-01-09 21:45:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:29,678 INFO L225 Difference]: With dead ends: 465 [2025-01-09 21:45:29,681 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 21:45:29,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:45:29,682 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 5 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:29,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1334 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:45:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 21:45:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 461. [2025-01-09 21:45:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 447 states have (on average 1.1856823266219239) internal successors, (530), 452 states have internal predecessors, (530), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 21:45:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 547 transitions. [2025-01-09 21:45:29,688 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 547 transitions. Word has length 135 [2025-01-09 21:45:29,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:29,688 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 547 transitions. [2025-01-09 21:45:29,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 10 states have internal predecessors, (136), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 21:45:29,688 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 547 transitions. [2025-01-09 21:45:29,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 21:45:29,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:29,689 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:29,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 21:45:29,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:29,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:29,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash 97868144, now seen corresponding path program 2 times [2025-01-09 21:45:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344440108] [2025-01-09 21:45:29,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:45:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:29,893 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:45:29,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 21:45:30,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 139 statements into 2 equivalence classes. [2025-01-09 21:45:30,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:45:30,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:45:30,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:45:30,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:45:30,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:45:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 21:45:30,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:45:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 21:45:30,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 21:45:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344440108] [2025-01-09 21:45:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344440108] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:45:30,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:45:30,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-01-09 21:45:30,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87197746] [2025-01-09 21:45:30,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 21:45:30,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 21:45:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 21:45:30,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 21:45:30,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-01-09 21:45:30,593 INFO L87 Difference]: Start difference. First operand 461 states and 547 transitions. Second operand has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:45:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:45:30,975 INFO L93 Difference]: Finished difference Result 473 states and 563 transitions. [2025-01-09 21:45:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:45:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 139 [2025-01-09 21:45:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:45:30,978 INFO L225 Difference]: With dead ends: 473 [2025-01-09 21:45:30,978 INFO L226 Difference]: Without dead ends: 469 [2025-01-09 21:45:30,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:45:30,979 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 7 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:45:30,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1862 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:45:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-01-09 21:45:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2025-01-09 21:45:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 453 states have (on average 1.1920529801324504) internal successors, (540), 458 states have internal predecessors, (540), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 21:45:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 557 transitions. [2025-01-09 21:45:30,987 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 557 transitions. Word has length 139 [2025-01-09 21:45:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:45:30,987 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 557 transitions. [2025-01-09 21:45:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:45:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 557 transitions. [2025-01-09 21:45:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 21:45:30,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:45:30,988 INFO L218 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:45:31,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 21:45:31,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:31,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:45:31,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:45:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1528920592, now seen corresponding path program 3 times [2025-01-09 21:45:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 21:45:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489515677] [2025-01-09 21:45:31,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:45:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:45:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:45:31,195 INFO L229 MonitoredProcess]: Starting monitored process 16 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:45:31,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 21:45:31,459 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 145 statements into 7 equivalence classes.