./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:26:25,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:26:25,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:26:25,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:26:25,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:26:25,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:26:25,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:26:25,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:26:25,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:26:25,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:26:25,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:26:25,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:26:25,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:26:25,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:26:25,542 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:26:25,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:26:25,544 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:26:25,544 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:26:25,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:26:25,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:26:25,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:26:25,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:26:25,546 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2025-03-08 22:26:25,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:26:25,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:26:25,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:26:25,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:26:25,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:26:25,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2025-03-08 22:26:26,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf201e32/d41783b7c17c446fb92354934005583d/FLAGd7375cf79 [2025-03-08 22:26:27,273 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:26:27,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2025-03-08 22:26:27,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf201e32/d41783b7c17c446fb92354934005583d/FLAGd7375cf79 [2025-03-08 22:26:27,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf201e32/d41783b7c17c446fb92354934005583d [2025-03-08 22:26:27,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:26:27,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:26:27,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:27,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:26:27,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:26:27,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:27" (1/1) ... [2025-03-08 22:26:27,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145e77ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:27, skipping insertion in model container [2025-03-08 22:26:27,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:27" (1/1) ... [2025-03-08 22:26:27,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:26:27,941 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,955 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,959 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,961 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,983 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,984 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,984 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,986 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,988 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,989 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,990 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,990 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,994 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:27,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:28,009 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2025-03-08 22:26:28,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3db43162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:28, skipping insertion in model container [2025-03-08 22:26:28,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:28,010 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-08 22:26:28,012 INFO L158 Benchmark]: Toolchain (without parser) took 533.33ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 124.3MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 22:26:28,013 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:26:28,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.31ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 124.3MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 22:26:28,014 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.31ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 124.3MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:26:29,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:26:29,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-08 22:26:29,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:26:29,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:26:29,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:26:29,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:26:29,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:26:29,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:26:29,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:26:29,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:26:29,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:26:29,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:26:29,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:26:29,860 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:26:29,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:26:29,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:26:29,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:26:29,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:26:29,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:26:29,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2025-03-08 22:26:30,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:26:30,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:26:30,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:26:30,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:26:30,115 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:26:30,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2025-03-08 22:26:31,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e7c09a/a24c24818ffa4c5789be4b048fe68e0d/FLAG5a3f62317 [2025-03-08 22:26:31,598 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:26:31,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2025-03-08 22:26:31,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e7c09a/a24c24818ffa4c5789be4b048fe68e0d/FLAG5a3f62317 [2025-03-08 22:26:31,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/339e7c09a/a24c24818ffa4c5789be4b048fe68e0d [2025-03-08 22:26:31,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:26:31,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:26:31,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:31,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:26:31,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:26:31,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:31" (1/1) ... [2025-03-08 22:26:31,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d018ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:31, skipping insertion in model container [2025-03-08 22:26:31,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:26:31" (1/1) ... [2025-03-08 22:26:31,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:26:32,322 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,341 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,344 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,346 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,350 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,382 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,383 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,385 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,385 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,386 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,387 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,389 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,390 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,394 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:32,409 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-08 22:26:32,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:26:32,493 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,505 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,507 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,508 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,512 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,534 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,536 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,536 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,537 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,537 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,539 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,540 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:26:32,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:32,546 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:26:32,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:26:32,656 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:26:32,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32 WrapperNode [2025-03-08 22:26:32,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:26:32,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:26:32,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:26:32,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:26:32,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,792 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2998 [2025-03-08 22:26:32,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:26:32,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:26:32,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:26:32,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:26:32,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,904 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-08 22:26:32,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:26:32,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:26:32,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:26:32,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:26:32,987 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (1/1) ... [2025-03-08 22:26:32,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:26:33,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:33,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:26:33,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:26:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 22:26:33,040 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 22:26:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 22:26:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 22:26:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 22:26:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 22:26:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 22:26:33,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 22:26:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 22:26:33,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 22:26:33,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 22:26:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 22:26:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 22:26:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 22:26:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 22:26:33,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:26:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:26:33,212 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:26:33,213 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:26:41,403 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-08 22:26:41,588 INFO L? ?]: Removed 637 outVars from TransFormulas that were not future-live. [2025-03-08 22:26:41,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:26:41,631 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:26:41,631 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:26:41,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:26:41 BoogieIcfgContainer [2025-03-08 22:26:41,632 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:26:41,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:26:41,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:26:41,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:26:41,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:26:31" (1/3) ... [2025-03-08 22:26:41,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3456d39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:26:41, skipping insertion in model container [2025-03-08 22:26:41,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:26:32" (2/3) ... [2025-03-08 22:26:41,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3456d39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:26:41, skipping insertion in model container [2025-03-08 22:26:41,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:26:41" (3/3) ... [2025-03-08 22:26:41,641 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-2.i [2025-03-08 22:26:41,653 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:26:41,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test9-2.i that has 6 procedures, 1208 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-03-08 22:26:41,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:26:41,718 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;@5322286c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:26:41,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:26:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 1200 states, 689 states have (on average 1.9042089985486212) internal successors, (1312), 1193 states have internal predecessors, (1312), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2025-03-08 22:26:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:26:41,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:41,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:26:41,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:41,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1456785381, now seen corresponding path program 1 times [2025-03-08 22:26:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339617674] [2025-03-08 22:26:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:41,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:41,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:41,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:41,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:26:41,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:26:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:26:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:41,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:41,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 22:26:41,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:26:41,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:41,916 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:41,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339617674] [2025-03-08 22:26:41,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339617674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:41,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:41,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:26:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794064662] [2025-03-08 22:26:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:41,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:26:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:41,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:26:41,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:26:41,937 INFO L87 Difference]: Start difference. First operand has 1200 states, 689 states have (on average 1.9042089985486212) internal successors, (1312), 1193 states have internal predecessors, (1312), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:42,029 INFO L93 Difference]: Finished difference Result 1198 states and 2255 transitions. [2025-03-08 22:26:42,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:26:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:26:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:42,049 INFO L225 Difference]: With dead ends: 1198 [2025-03-08 22:26:42,050 INFO L226 Difference]: Without dead ends: 1196 [2025-03-08 22:26:42,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:26:42,053 INFO L435 NwaCegarLoop]: 2255 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:42,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:26:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2025-03-08 22:26:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2025-03-08 22:26:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 687 states have (on average 1.8122270742358078) internal successors, (1245), 1189 states have internal predecessors, (1245), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 22:26:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2253 transitions. [2025-03-08 22:26:42,410 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2253 transitions. Word has length 11 [2025-03-08 22:26:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 2253 transitions. [2025-03-08 22:26:42,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2253 transitions. [2025-03-08 22:26:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:26:42,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:42,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:26:42,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 22:26:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:42,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2122123227, now seen corresponding path program 1 times [2025-03-08 22:26:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670536881] [2025-03-08 22:26:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:42,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:42,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:42,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:26:42,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:26:42,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:26:42,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:42,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:42,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:26:42,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:26:42,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:42,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670536881] [2025-03-08 22:26:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670536881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:26:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084492429] [2025-03-08 22:26:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:42,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:26:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:42,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:26:42,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:42,826 INFO L87 Difference]: Start difference. First operand 1196 states and 2253 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:43,453 INFO L93 Difference]: Finished difference Result 2312 states and 4405 transitions. [2025-03-08 22:26:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:26:43,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-03-08 22:26:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:43,468 INFO L225 Difference]: With dead ends: 2312 [2025-03-08 22:26:43,468 INFO L226 Difference]: Without dead ends: 2312 [2025-03-08 22:26:43,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:43,470 INFO L435 NwaCegarLoop]: 2241 mSDtfsCounter, 1142 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:43,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 4468 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:26:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-03-08 22:26:43,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2282. [2025-03-08 22:26:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 1273 states have (on average 1.8523173605655932) internal successors, (2358), 2275 states have internal predecessors, (2358), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 22:26:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 4366 transitions. [2025-03-08 22:26:43,689 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 4366 transitions. Word has length 12 [2025-03-08 22:26:43,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:43,689 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 4366 transitions. [2025-03-08 22:26:43,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 4366 transitions. [2025-03-08 22:26:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:26:43,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:43,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:26:43,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:26:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:43,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2122153018, now seen corresponding path program 1 times [2025-03-08 22:26:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1364805306] [2025-03-08 22:26:43,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:43,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:43,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:43,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:26:43,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:26:44,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:26:44,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:44,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:44,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:26:44,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:44,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:26:44,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:26:44,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:26:44,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-08 22:26:44,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:26:44,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2025-03-08 22:26:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:26:44,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:44,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:44,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364805306] [2025-03-08 22:26:44,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364805306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:44,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:44,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:44,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748919680] [2025-03-08 22:26:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:44,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:44,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:44,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:44,087 INFO L87 Difference]: Start difference. First operand 2282 states and 4366 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:46,064 INFO L93 Difference]: Finished difference Result 4426 states and 8555 transitions. [2025-03-08 22:26:46,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:26:46,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-08 22:26:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:46,086 INFO L225 Difference]: With dead ends: 4426 [2025-03-08 22:26:46,087 INFO L226 Difference]: Without dead ends: 4426 [2025-03-08 22:26:46,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:26:46,087 INFO L435 NwaCegarLoop]: 2455 mSDtfsCounter, 1224 mSDsluCounter, 4181 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 6636 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:46,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 6636 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 22:26:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2025-03-08 22:26:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 2281. [2025-03-08 22:26:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 1272 states have (on average 1.8522012578616351) internal successors, (2356), 2274 states have internal predecessors, (2356), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 22:26:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 4364 transitions. [2025-03-08 22:26:46,583 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 4364 transitions. Word has length 12 [2025-03-08 22:26:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:46,583 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 4364 transitions. [2025-03-08 22:26:46,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:26:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 4364 transitions. [2025-03-08 22:26:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 22:26:46,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:46,586 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] [2025-03-08 22:26:46,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:26:46,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:46,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:46,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -120709599, now seen corresponding path program 1 times [2025-03-08 22:26:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376330574] [2025-03-08 22:26:46,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:46,791 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:46,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:26:46,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:26:47,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:26:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:47,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:26:47,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:26:47,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:47,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376330574] [2025-03-08 22:26:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376330574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:26:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458914395] [2025-03-08 22:26:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:26:47,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:47,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:26:47,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:47,106 INFO L87 Difference]: Start difference. First operand 2281 states and 4364 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:47,206 INFO L93 Difference]: Finished difference Result 2321 states and 4404 transitions. [2025-03-08 22:26:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:26:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2025-03-08 22:26:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:47,214 INFO L225 Difference]: With dead ends: 2321 [2025-03-08 22:26:47,215 INFO L226 Difference]: Without dead ends: 2321 [2025-03-08 22:26:47,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:26:47,215 INFO L435 NwaCegarLoop]: 2233 mSDtfsCounter, 9 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4451 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:47,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4451 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-03-08 22:26:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2321. [2025-03-08 22:26:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1312 states have (on average 1.826219512195122) internal successors, (2396), 2314 states have internal predecessors, (2396), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-03-08 22:26:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 4404 transitions. [2025-03-08 22:26:47,387 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 4404 transitions. Word has length 81 [2025-03-08 22:26:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:47,388 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 4404 transitions. [2025-03-08 22:26:47,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 4404 transitions. [2025-03-08 22:26:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 22:26:47,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:47,389 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] [2025-03-08 22:26:47,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 22:26:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:47,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1074938494, now seen corresponding path program 1 times [2025-03-08 22:26:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939796685] [2025-03-08 22:26:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:47,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:47,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:47,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:47,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:26:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:26:47,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:26:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:47,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:26:47,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 22:26:48,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:48,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939796685] [2025-03-08 22:26:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939796685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:48,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:48,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:48,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536782570] [2025-03-08 22:26:48,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:48,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:48,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:48,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:48,050 INFO L87 Difference]: Start difference. First operand 2321 states and 4404 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:52,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:26:56,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:26:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:58,495 INFO L93 Difference]: Finished difference Result 1344 states and 2431 transitions. [2025-03-08 22:26:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:26:58,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2025-03-08 22:26:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:58,500 INFO L225 Difference]: With dead ends: 1344 [2025-03-08 22:26:58,501 INFO L226 Difference]: Without dead ends: 1344 [2025-03-08 22:26:58,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:26:58,501 INFO L435 NwaCegarLoop]: 2256 mSDtfsCounter, 2427 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1005 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:58,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 3426 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 88 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2025-03-08 22:26:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-03-08 22:26:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1276. [2025-03-08 22:26:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 767 states have (on average 1.7392438070404173) internal successors, (1334), 1269 states have internal predecessors, (1334), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 22:26:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 2342 transitions. [2025-03-08 22:26:58,603 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 2342 transitions. Word has length 81 [2025-03-08 22:26:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:58,604 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 2342 transitions. [2025-03-08 22:26:58,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 2342 transitions. [2025-03-08 22:26:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 22:26:58,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:58,606 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, 1, 1, 1, 1] [2025-03-08 22:26:58,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 22:26:58,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:58,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:58,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1170808301, now seen corresponding path program 1 times [2025-03-08 22:26:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287989296] [2025-03-08 22:26:58,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:58,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:58,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:58,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:58,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:26:59,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 22:26:59,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 22:26:59,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:59,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:59,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:26:59,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:26:59,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:59,158 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287989296] [2025-03-08 22:26:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287989296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221221897] [2025-03-08 22:26:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:59,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:59,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:59,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:59,160 INFO L87 Difference]: Start difference. First operand 1276 states and 2342 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:26:59,304 INFO L93 Difference]: Finished difference Result 1242 states and 2286 transitions. [2025-03-08 22:26:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:26:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-08 22:26:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:26:59,309 INFO L225 Difference]: With dead ends: 1242 [2025-03-08 22:26:59,309 INFO L226 Difference]: Without dead ends: 1242 [2025-03-08 22:26:59,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:26:59,312 INFO L435 NwaCegarLoop]: 2219 mSDtfsCounter, 32 mSDsluCounter, 4424 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6643 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:26:59,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6643 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:26:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2025-03-08 22:26:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2025-03-08 22:26:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 733 states have (on average 1.7435197817189632) internal successors, (1278), 1235 states have internal predecessors, (1278), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 22:26:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 2286 transitions. [2025-03-08 22:26:59,405 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 2286 transitions. Word has length 90 [2025-03-08 22:26:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:26:59,405 INFO L471 AbstractCegarLoop]: Abstraction has 1242 states and 2286 transitions. [2025-03-08 22:26:59,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:26:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 2286 transitions. [2025-03-08 22:26:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 22:26:59,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:26:59,406 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, 1, 1, 1, 1] [2025-03-08 22:26:59,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:26:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:59,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:26:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:26:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1910435162, now seen corresponding path program 1 times [2025-03-08 22:26:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:26:59,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093624492] [2025-03-08 22:26:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:26:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:26:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:26:59,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:26:59,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:26:59,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 22:26:59,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 22:26:59,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:26:59,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:26:59,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 22:26:59,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:26:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:26:59,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:26:59,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:26:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093624492] [2025-03-08 22:26:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093624492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:26:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:26:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:26:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629721971] [2025-03-08 22:26:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:26:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:26:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:26:59,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:26:59,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:26:59,973 INFO L87 Difference]: Start difference. First operand 1242 states and 2286 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:04,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:27:08,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 22:27:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:11,237 INFO L93 Difference]: Finished difference Result 1244 states and 2288 transitions. [2025-03-08 22:27:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:27:11,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-08 22:27:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:11,241 INFO L225 Difference]: With dead ends: 1244 [2025-03-08 22:27:11,241 INFO L226 Difference]: Without dead ends: 1244 [2025-03-08 22:27:11,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:27:11,242 INFO L435 NwaCegarLoop]: 2210 mSDtfsCounter, 1209 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 4430 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:11,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 4430 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 579 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2025-03-08 22:27:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-03-08 22:27:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1243. [2025-03-08 22:27:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 734 states have (on average 1.7425068119891007) internal successors, (1279), 1236 states have internal predecessors, (1279), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-03-08 22:27:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2287 transitions. [2025-03-08 22:27:11,321 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2287 transitions. Word has length 90 [2025-03-08 22:27:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:11,321 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2287 transitions. [2025-03-08 22:27:11,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2287 transitions. [2025-03-08 22:27:11,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 22:27:11,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:11,322 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, 1, 1, 1, 1] [2025-03-08 22:27:11,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:27:11,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:11,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:11,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:11,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1910464953, now seen corresponding path program 1 times [2025-03-08 22:27:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:11,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352418709] [2025-03-08 22:27:11,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:11,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:11,526 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:11,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:27:11,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 22:27:11,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 22:27:11,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:11,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:11,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:27:11,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:27:11,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:27:11,845 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352418709] [2025-03-08 22:27:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352418709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:27:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:27:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:27:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409530641] [2025-03-08 22:27:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:27:11,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:27:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:11,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:27:11,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:27:11,850 INFO L87 Difference]: Start difference. First operand 1243 states and 2287 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:11,904 INFO L93 Difference]: Finished difference Result 1246 states and 2291 transitions. [2025-03-08 22:27:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:27:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2025-03-08 22:27:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:11,912 INFO L225 Difference]: With dead ends: 1246 [2025-03-08 22:27:11,912 INFO L226 Difference]: Without dead ends: 1246 [2025-03-08 22:27:11,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:27:11,912 INFO L435 NwaCegarLoop]: 2237 mSDtfsCounter, 0 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6707 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:11,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6707 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:27:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-08 22:27:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246. [2025-03-08 22:27:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 736 states have (on average 1.7418478260869565) internal successors, (1282), 1239 states have internal predecessors, (1282), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (504), 4 states have call predecessors, (504), 503 states have call successors, (504) [2025-03-08 22:27:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 2291 transitions. [2025-03-08 22:27:11,997 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 2291 transitions. Word has length 90 [2025-03-08 22:27:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:11,998 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 2291 transitions. [2025-03-08 22:27:11,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 2291 transitions. [2025-03-08 22:27:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 22:27:11,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:11,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:27:12,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:27:12,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:12,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash -831495459, now seen corresponding path program 1 times [2025-03-08 22:27:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:12,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [23076667] [2025-03-08 22:27:12,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:12,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:12,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:12,202 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:12,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:27:12,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 22:27:12,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 22:27:12,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:12,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:27:12,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:27:12,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:27:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:27:12,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23076667] [2025-03-08 22:27:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23076667] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:27:12,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:27:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-08 22:27:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170690914] [2025-03-08 22:27:12,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:27:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:27:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:12,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:27:12,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:27:12,622 INFO L87 Difference]: Start difference. First operand 1246 states and 2291 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:27:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:12,778 INFO L93 Difference]: Finished difference Result 1257 states and 2308 transitions. [2025-03-08 22:27:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:27:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 92 [2025-03-08 22:27:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:12,786 INFO L225 Difference]: With dead ends: 1257 [2025-03-08 22:27:12,786 INFO L226 Difference]: Without dead ends: 1257 [2025-03-08 22:27:12,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:27:12,788 INFO L435 NwaCegarLoop]: 2236 mSDtfsCounter, 5 mSDsluCounter, 8935 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 11171 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:12,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 11171 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:27:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-08 22:27:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1255. [2025-03-08 22:27:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 744 states have (on average 1.7419354838709677) internal successors, (1296), 1247 states have internal predecessors, (1296), 505 states have call successors, (505), 4 states have call predecessors, (505), 4 states have return successors, (505), 4 states have call predecessors, (505), 503 states have call successors, (505) [2025-03-08 22:27:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2306 transitions. [2025-03-08 22:27:12,881 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2306 transitions. Word has length 92 [2025-03-08 22:27:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:12,881 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 2306 transitions. [2025-03-08 22:27:12,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 22:27:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2306 transitions. [2025-03-08 22:27:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 22:27:12,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:12,882 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] [2025-03-08 22:27:12,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:27:13,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:13,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash 141918489, now seen corresponding path program 2 times [2025-03-08 22:27:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1337835106] [2025-03-08 22:27:13,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:27:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:13,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:13,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 22:27:13,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-08 22:27:13,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 96 statements. [2025-03-08 22:27:13,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:27:13,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:13,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:27:13,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:13,331 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:27:13,332 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:27:13,333 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 33 treesize of output 31 [2025-03-08 22:27:13,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:27:13,379 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 62 treesize of output 22 [2025-03-08 22:27:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 22:27:13,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:27:13,413 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:13,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337835106] [2025-03-08 22:27:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337835106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:27:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:27:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:27:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310825895] [2025-03-08 22:27:13,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:27:13,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:27:13,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:13,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:27:13,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:27:13,414 INFO L87 Difference]: Start difference. First operand 1255 states and 2306 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:15,079 INFO L93 Difference]: Finished difference Result 2354 states and 4437 transitions. [2025-03-08 22:27:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:27:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2025-03-08 22:27:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:15,089 INFO L225 Difference]: With dead ends: 2354 [2025-03-08 22:27:15,089 INFO L226 Difference]: Without dead ends: 2354 [2025-03-08 22:27:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:27:15,090 INFO L435 NwaCegarLoop]: 2299 mSDtfsCounter, 1171 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 6301 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:15,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 6301 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 22:27:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2025-03-08 22:27:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1257. [2025-03-08 22:27:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 746 states have (on average 1.739946380697051) internal successors, (1298), 1249 states have internal predecessors, (1298), 505 states have call successors, (505), 4 states have call predecessors, (505), 4 states have return successors, (505), 4 states have call predecessors, (505), 503 states have call successors, (505) [2025-03-08 22:27:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2308 transitions. [2025-03-08 22:27:15,259 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2308 transitions. Word has length 96 [2025-03-08 22:27:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:15,259 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 2308 transitions. [2025-03-08 22:27:15,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2308 transitions. [2025-03-08 22:27:15,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 22:27:15,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:15,263 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:27:15,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 22:27:15,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:15,464 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:15,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash -199019534, now seen corresponding path program 1 times [2025-03-08 22:27:15,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:15,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189611021] [2025-03-08 22:27:15,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:15,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:15,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:15,468 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 22:27:15,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:27:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:27:15,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:15,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:15,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 22:27:15,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 22:27:15,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:27:15,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189611021] [2025-03-08 22:27:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189611021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:27:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:27:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:27:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937493509] [2025-03-08 22:27:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:27:15,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:27:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:15,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:27:15,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:27:15,839 INFO L87 Difference]: Start difference. First operand 1257 states and 2308 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:15,921 INFO L93 Difference]: Finished difference Result 1260 states and 2303 transitions. [2025-03-08 22:27:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:27:15,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 129 [2025-03-08 22:27:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:15,931 INFO L225 Difference]: With dead ends: 1260 [2025-03-08 22:27:15,931 INFO L226 Difference]: Without dead ends: 1260 [2025-03-08 22:27:15,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:27:15,931 INFO L435 NwaCegarLoop]: 2211 mSDtfsCounter, 30 mSDsluCounter, 4403 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:15,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6614 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:27:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-08 22:27:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1260. [2025-03-08 22:27:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 749 states have (on average 1.72630173564753) internal successors, (1293), 1252 states have internal predecessors, (1293), 505 states have call successors, (505), 4 states have call predecessors, (505), 4 states have return successors, (505), 4 states have call predecessors, (505), 503 states have call successors, (505) [2025-03-08 22:27:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 2303 transitions. [2025-03-08 22:27:16,030 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 2303 transitions. Word has length 129 [2025-03-08 22:27:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 2303 transitions. [2025-03-08 22:27:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 22:27:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 2303 transitions. [2025-03-08 22:27:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 22:27:16,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:16,031 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:27:16,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 22:27:16,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:16,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:16,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1334535093, now seen corresponding path program 1 times [2025-03-08 22:27:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:16,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1153639262] [2025-03-08 22:27:16,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:27:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:16,236 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:16,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 22:27:16,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:27:16,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:27:16,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:27:16,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:16,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 22:27:16,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:27:16,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:27:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:27:16,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153639262] [2025-03-08 22:27:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153639262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:27:16,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 22:27:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 22:27:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699587731] [2025-03-08 22:27:16,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 22:27:16,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:27:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:16,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:27:16,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:27:16,793 INFO L87 Difference]: Start difference. First operand 1260 states and 2303 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:27:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:27:16,995 INFO L93 Difference]: Finished difference Result 1268 states and 2313 transitions. [2025-03-08 22:27:16,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:27:16,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 129 [2025-03-08 22:27:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:27:16,999 INFO L225 Difference]: With dead ends: 1268 [2025-03-08 22:27:16,999 INFO L226 Difference]: Without dead ends: 1266 [2025-03-08 22:27:16,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 248 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-03-08 22:27:16,999 INFO L435 NwaCegarLoop]: 2227 mSDtfsCounter, 6 mSDsluCounter, 8897 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11124 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:27:17,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11124 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:27:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2025-03-08 22:27:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2025-03-08 22:27:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 753 states have (on average 1.7250996015936255) internal successors, (1299), 1256 states have internal predecessors, (1299), 505 states have call successors, (505), 4 states have call predecessors, (505), 4 states have return successors, (504), 4 states have call predecessors, (504), 503 states have call successors, (504) [2025-03-08 22:27:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 2308 transitions. [2025-03-08 22:27:17,111 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 2308 transitions. Word has length 129 [2025-03-08 22:27:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:27:17,111 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 2308 transitions. [2025-03-08 22:27:17,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 22:27:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 2308 transitions. [2025-03-08 22:27:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 22:27:17,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:27:17,112 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:27:17,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 22:27:17,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:17,313 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:27:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:27:17,314 INFO L85 PathProgramCache]: Analyzing trace with hash -635897845, now seen corresponding path program 2 times [2025-03-08 22:27:17,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 22:27:17,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912643317] [2025-03-08 22:27:17,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:27:17,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:27:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:27:17,316 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:27:17,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 22:27:17,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-08 22:27:17,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 22:27:17,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:27:17,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:17,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 22:27:17,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:17,779 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:27:17,779 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:27:17,780 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:27:17,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2025-03-08 22:27:18,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:27:18,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 71 [2025-03-08 22:27:19,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:27:19,033 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 98 treesize of output 58 [2025-03-08 22:27:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 22:27:19,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:27:19,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 22:27:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912643317] [2025-03-08 22:27:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912643317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:27:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [537292305] [2025-03-08 22:27:19,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:27:19,262 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 22:27:19,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 22:27:19,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 22:27:19,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-08 22:27:19,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-08 22:27:20,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 22:27:20,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:27:20,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:27:20,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 22:27:20,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:27:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 40 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 22:27:20,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:27:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 22:27:20,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [537292305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:27:20,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:27:20,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2025-03-08 22:27:20,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872075425] [2025-03-08 22:27:20,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:27:20,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:27:20,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 22:27:20,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:27:20,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-03-08 22:27:20,678 INFO L87 Difference]: Start difference. First operand 1264 states and 2308 transitions. Second operand has 23 states, 23 states have (on average 8.869565217391305) internal successors, (204), 23 states have internal predecessors, (204), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 22:27:27,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:31,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:35,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:40,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:44,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:48,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:52,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:27:56,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 22:28:00,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]