./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 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_SFH_test7-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 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:42:38,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:42:38,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:42:38,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:42:38,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:42:38,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:42:38,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:42:38,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:42:38,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:42:38,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:42:38,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:42:38,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:42:38,555 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:42:38,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:42:38,555 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:42:38,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:42:38,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:42:38,557 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:42:38,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:42:38,557 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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2025-03-17 11:42:38,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:42:38,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:42:38,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:42:38,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:42:38,779 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:42:38,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-17 11:42:39,949 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932ae4ac0/2e54a798369d426da6734fb059782ad4/FLAGa58c1f83c [2025-03-17 11:42:40,246 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:42:40,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-17 11:42:40,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932ae4ac0/2e54a798369d426da6734fb059782ad4/FLAGa58c1f83c [2025-03-17 11:42:40,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932ae4ac0/2e54a798369d426da6734fb059782ad4 [2025-03-17 11:42:40,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:42:40,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:42:40,284 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:42:40,284 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:42:40,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:42:40,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:42:40" (1/1) ... [2025-03-17 11:42:40,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8f2de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:40, skipping insertion in model container [2025-03-17 11:42:40,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:42:40" (1/1) ... [2025-03-17 11:42:40,323 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:42:40,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-17 11:42:40,566 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-17 11:42:40,571 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-17 11:42:40,573 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-17 11:42:40,576 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-17 11:42:40,598 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-17 11:42:40,598 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-17 11:42:40,600 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-17 11:42:40,600 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-17 11:42:40,602 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-17 11:42:40,603 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-17 11:42:40,603 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-17 11:42:40,606 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-17 11:42:40,609 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-17 11:42:40,610 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-17 11:42:40,611 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-17 11:42:40,611 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-17 11:42:40,612 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-17 11:42:40,612 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-17 11:42:40,614 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-17 11:42:40,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:42:40,631 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-17 11:42:40,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4b943de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:40, skipping insertion in model container [2025-03-17 11:42:40,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:42:40,632 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2025-03-17 11:42:40,635 INFO L158 Benchmark]: Toolchain (without parser) took 349.82ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 102.6MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:42:40,635 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:42:40,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.24ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 102.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:42:40,636 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 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.24ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 102.6MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: 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_SFH_test7-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 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:42:42,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:42:42,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-03-17 11:42:42,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:42:42,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:42:42,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:42:42,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:42:42,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:42:42,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:42:42,365 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:42:42,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:42:42,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:42:42,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:42:42,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:42:42,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:42:42,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:42:42,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:42:42,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:42:42,370 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:42:42,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:42:42,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:42:42,370 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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2025-03-17 11:42:42,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:42:42,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:42:42,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:42:42,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:42:42,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:42:42,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-17 11:42:43,796 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c356ea471/24fd93c8d81f480c99e92c69306ff3ec/FLAG201f03819 [2025-03-17 11:42:44,053 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:42:44,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2025-03-17 11:42:44,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c356ea471/24fd93c8d81f480c99e92c69306ff3ec/FLAG201f03819 [2025-03-17 11:42:44,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c356ea471/24fd93c8d81f480c99e92c69306ff3ec [2025-03-17 11:42:44,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:42:44,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:42:44,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:42:44,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:42:44,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:42:44,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599abae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44, skipping insertion in model container [2025-03-17 11:42:44,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:42:44,450 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-17 11:42:44,483 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-17 11:42:44,489 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-17 11:42:44,491 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,500 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-17 11:42:44,528 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,530 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-17 11:42:44,532 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-17 11:42:44,532 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-17 11:42:44,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-17 11:42:44,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-17 11:42:44,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-17 11:42:44,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-17 11:42:44,541 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,543 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,545 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,546 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-17 11:42:44,546 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-17 11:42:44,547 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,550 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:42:44,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:42:44,565 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2025-03-17 11:42:44,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:42:44,605 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-17 11:42:44,623 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-17 11:42:44,626 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-17 11:42:44,628 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-17 11:42:44,631 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-17 11:42:44,652 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-17 11:42:44,656 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-17 11:42:44,658 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-17 11:42:44,658 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-17 11:42:44,661 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-17 11:42:44,662 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-17 11:42:44,663 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-17 11:42:44,663 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-17 11:42:44,668 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-17 11:42:44,670 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-17 11:42:44,671 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-17 11:42:44,672 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-17 11:42:44,672 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-17 11:42:44,672 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-17 11:42:44,674 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-17 11:42:44,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:42:44,682 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:42:44,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:42:44,784 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:42:44,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44 WrapperNode [2025-03-17 11:42:44,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:42:44,785 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:42:44,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:42:44,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:42:44,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,851 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1124 [2025-03-17 11:42:44,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:42:44,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:42:44,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:42:44,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:42:44,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,940 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-03-17 11:42:44,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:44,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:42:45,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:42:45,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:42:45,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:42:45,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (1/1) ... [2025-03-17 11:42:45,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:42:45,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:42:45,028 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-17 11:42:45,032 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-17 11:42:45,047 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 11:42:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:42:45,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 11:42:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:42:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:42:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 11:42:45,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:42:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:42:45,209 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:42:45,211 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:42:52,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: 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-17 11:42:52,567 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-17 11:42:52,567 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:42:52,579 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:42:52,580 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:42:52,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:42:52 BoogieIcfgContainer [2025-03-17 11:42:52,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:42:52,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:42:52,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:42:52,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:42:52,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:42:44" (1/3) ... [2025-03-17 11:42:52,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a97ae53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:42:52, skipping insertion in model container [2025-03-17 11:42:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:42:44" (2/3) ... [2025-03-17 11:42:52,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a97ae53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:42:52, skipping insertion in model container [2025-03-17 11:42:52,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:42:52" (3/3) ... [2025-03-17 11:42:52,588 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-2.i [2025-03-17 11:42:52,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:42:52,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test7-2.i that has 5 procedures, 227 locations, 1 initial locations, 41 loop locations, and 2 error locations. [2025-03-17 11:42:52,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:42:52,648 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;@311d1af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:42:52,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:42:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 209 states have (on average 1.6650717703349283) internal successors, (348), 212 states have internal predecessors, (348), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 11:42:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:42:52,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:42:52,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:42:52,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:42:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:42:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1508987759, now seen corresponding path program 1 times [2025-03-17 11:42:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:42:52,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1189951773] [2025-03-17 11:42:52,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:42:52,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:42:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:42:52,670 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-17 11:42:52,671 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-17 11:42:52,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:42:52,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:42:52,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:42:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:42:52,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 11:42:52,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:42:52,832 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-17 11:42:52,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:42:52,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:42:52,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189951773] [2025-03-17 11:42:52,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189951773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:42:52,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:42:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:42:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014850073] [2025-03-17 11:42:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:42:52,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:42:52,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:42:52,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:42:52,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:42:52,852 INFO L87 Difference]: Start difference. First operand has 219 states, 209 states have (on average 1.6650717703349283) internal successors, (348), 212 states have internal predecessors, (348), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-17 11:42:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:42:52,879 INFO L93 Difference]: Finished difference Result 216 states and 282 transitions. [2025-03-17 11:42:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:42:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2025-03-17 11:42:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:42:52,885 INFO L225 Difference]: With dead ends: 216 [2025-03-17 11:42:52,885 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 11:42:52,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-17 11:42:52,888 INFO L435 NwaCegarLoop]: 282 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, 282 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-17 11:42:52,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:42:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 11:42:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-03-17 11:42:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 208 states have internal predecessors, (272), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:42:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2025-03-17 11:42:52,922 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 9 [2025-03-17 11:42:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:42:52,923 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2025-03-17 11:42:52,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-17 11:42:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2025-03-17 11:42:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:42:52,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:42:52,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:42:52,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:42:53,128 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-17 11:42:53,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:42:53,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:42:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1225055232, now seen corresponding path program 1 times [2025-03-17 11:42:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:42:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384458022] [2025-03-17 11:42:53,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:42:53,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:42:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:42:53,136 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-17 11:42:53,137 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-17 11:42:53,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:42:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:42:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:42:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:42:53,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 11:42:53,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:42:53,379 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-17 11:42:53,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:42:53,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:42:53,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384458022] [2025-03-17 11:42:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384458022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:42:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:42:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:42:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983755463] [2025-03-17 11:42:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:42:53,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:42:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:42:53,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:42:53,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:42:53,380 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-17 11:42:57,731 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-17 11:42:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:42:59,660 INFO L93 Difference]: Finished difference Result 354 states and 464 transitions. [2025-03-17 11:42:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:42:59,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-17 11:42:59,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:42:59,665 INFO L225 Difference]: With dead ends: 354 [2025-03-17 11:42:59,665 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 11:42:59,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-17 11:42:59,666 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 175 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:42:59,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 785 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 109 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-03-17 11:42:59,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 11:42:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 323. [2025-03-17 11:42:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 315 states have (on average 1.3206349206349206) internal successors, (416), 317 states have internal predecessors, (416), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:42:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 424 transitions. [2025-03-17 11:42:59,680 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 424 transitions. Word has length 11 [2025-03-17 11:42:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:42:59,680 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 424 transitions. [2025-03-17 11:42:59,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-17 11:42:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 424 transitions. [2025-03-17 11:42:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:42:59,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:42:59,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:42:59,688 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-17 11:42:59,881 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-17 11:42:59,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:42:59,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:42:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash 666376581, now seen corresponding path program 1 times [2025-03-17 11:42:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:42:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369166312] [2025-03-17 11:42:59,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:42:59,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:42:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:42:59,887 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-17 11:42:59,888 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-17 11:43:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:43:00,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:43:00,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:00,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:00,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:43:00,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:00,062 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:00,063 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:00,063 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:00,073 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-17 11:43:00,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:00,155 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-17 11:43:00,176 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-17 11:43:00,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:00,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:00,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369166312] [2025-03-17 11:43:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369166312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:00,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:00,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:43:00,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565815441] [2025-03-17 11:43:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:00,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:00,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:00,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:00,178 INFO L87 Difference]: Start difference. First operand 323 states and 424 transitions. Second operand has 4 states, 4 states have (on average 3.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-17 11:43:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:00,602 INFO L93 Difference]: Finished difference Result 511 states and 674 transitions. [2025-03-17 11:43:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:43:00,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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-17 11:43:00,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:00,605 INFO L225 Difference]: With dead ends: 511 [2025-03-17 11:43:00,605 INFO L226 Difference]: Without dead ends: 511 [2025-03-17 11:43:00,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-17 11:43:00,606 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 256 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:43:00,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 772 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:43:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-17 11:43:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 322. [2025-03-17 11:43:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 314 states have (on average 1.3184713375796178) internal successors, (414), 316 states have internal predecessors, (414), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:43:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 422 transitions. [2025-03-17 11:43:00,620 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 422 transitions. Word has length 12 [2025-03-17 11:43:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:00,620 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 422 transitions. [2025-03-17 11:43:00,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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-17 11:43:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 422 transitions. [2025-03-17 11:43:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 11:43:00,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:00,622 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] [2025-03-17 11:43:00,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:43:00,822 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-17 11:43:00,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:00,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash 360309666, now seen corresponding path program 1 times [2025-03-17 11:43:00,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:00,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1350103442] [2025-03-17 11:43:00,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:00,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:00,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:00,827 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-17 11:43:00,828 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-17 11:43:01,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:43:01,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:43:01,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:01,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:01,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:43:01,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:01,168 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-17 11:43:01,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:01,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:01,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350103442] [2025-03-17 11:43:01,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350103442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:01,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:01,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:43:01,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118413439] [2025-03-17 11:43:01,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:01,170 INFO L87 Difference]: Start difference. First operand 322 states and 422 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:01,297 INFO L93 Difference]: Finished difference Result 328 states and 412 transitions. [2025-03-17 11:43:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:43:01,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2025-03-17 11:43:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:01,299 INFO L225 Difference]: With dead ends: 328 [2025-03-17 11:43:01,299 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 11:43:01,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-17 11:43:01,300 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 30 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 734 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-17 11:43:01,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 734 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:43:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 11:43:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-17 11:43:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 320 states have (on average 1.2625) internal successors, (404), 322 states have internal predecessors, (404), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:43:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 412 transitions. [2025-03-17 11:43:01,311 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 412 transitions. Word has length 80 [2025-03-17 11:43:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 412 transitions. [2025-03-17 11:43:01,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 412 transitions. [2025-03-17 11:43:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 11:43:01,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:01,314 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] [2025-03-17 11:43:01,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:43:01,514 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-17 11:43:01,514 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash -270156677, now seen corresponding path program 1 times [2025-03-17 11:43:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113041813] [2025-03-17 11:43:01,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:01,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:01,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:01,518 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-17 11:43:01,518 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-17 11:43:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 11:43:01,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 11:43:01,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:01,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:43:01,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:43:01,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:01,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:01,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113041813] [2025-03-17 11:43:01,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113041813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:01,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:01,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:43:01,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354967621] [2025-03-17 11:43:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:01,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:01,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:01,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:01,855 INFO L87 Difference]: Start difference. First operand 328 states and 412 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:01,904 INFO L93 Difference]: Finished difference Result 331 states and 416 transitions. [2025-03-17 11:43:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:43:01,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 80 [2025-03-17 11:43:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:01,908 INFO L225 Difference]: With dead ends: 331 [2025-03-17 11:43:01,908 INFO L226 Difference]: Without dead ends: 331 [2025-03-17 11:43:01,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 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-17 11:43:01,909 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 794 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-17 11:43:01,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:43:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-17 11:43:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2025-03-17 11:43:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 322 states have (on average 1.263975155279503) internal successors, (407), 325 states have internal predecessors, (407), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 416 transitions. [2025-03-17 11:43:01,920 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 416 transitions. Word has length 80 [2025-03-17 11:43:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:01,921 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 416 transitions. [2025-03-17 11:43:01,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 416 transitions. [2025-03-17 11:43:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:43:01,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:01,923 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] [2025-03-17 11:43:01,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 11:43:02,127 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-17 11:43:02,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:02,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1369509847, now seen corresponding path program 1 times [2025-03-17 11:43:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [253620598] [2025-03-17 11:43:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:02,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:02,132 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-17 11:43:02,134 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-17 11:43:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:43:02,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:43:02,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:02,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:02,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:43:02,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:02,495 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:02,495 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:02,495 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:02,497 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-17 11:43:02,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:02,556 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-17 11:43:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:43:02,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:02,569 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253620598] [2025-03-17 11:43:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253620598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:43:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350339841] [2025-03-17 11:43:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:02,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:02,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:02,571 INFO L87 Difference]: Start difference. First operand 331 states and 416 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 11:43:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:03,013 INFO L93 Difference]: Finished difference Result 488 states and 624 transitions. [2025-03-17 11:43:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:43:03,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 82 [2025-03-17 11:43:03,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:03,015 INFO L225 Difference]: With dead ends: 488 [2025-03-17 11:43:03,016 INFO L226 Difference]: Without dead ends: 488 [2025-03-17 11:43:03,016 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-17 11:43:03,016 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 202 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:43:03,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 794 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:43:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-17 11:43:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 333. [2025-03-17 11:43:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 324 states have (on average 1.2623456790123457) internal successors, (409), 327 states have internal predecessors, (409), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 418 transitions. [2025-03-17 11:43:03,025 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 418 transitions. Word has length 82 [2025-03-17 11:43:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:03,027 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 418 transitions. [2025-03-17 11:43:03,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 11:43:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 418 transitions. [2025-03-17 11:43:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:43:03,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:03,029 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:43:03,042 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-17 11:43:03,230 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-17 11:43:03,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:03,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash -211558212, now seen corresponding path program 1 times [2025-03-17 11:43:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:03,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829203841] [2025-03-17 11:43:03,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:03,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:03,234 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-17 11:43:03,235 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-17 11:43:03,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:43:03,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:43:03,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:03,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:03,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:43:03,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:43:03,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:03,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829203841] [2025-03-17 11:43:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829203841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:43:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709239236] [2025-03-17 11:43:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:43:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:43:03,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:43:03,614 INFO L87 Difference]: Start difference. First operand 333 states and 418 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-17 11:43:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:03,711 INFO L93 Difference]: Finished difference Result 373 states and 458 transitions. [2025-03-17 11:43:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:43:03,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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 116 [2025-03-17 11:43:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:03,713 INFO L225 Difference]: With dead ends: 373 [2025-03-17 11:43:03,713 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 11:43:03,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-17 11:43:03,713 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 8 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 483 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-17 11:43:03,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 483 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:43:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 11:43:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-17 11:43:03,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 364 states have (on average 1.2335164835164836) internal successors, (449), 367 states have internal predecessors, (449), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 458 transitions. [2025-03-17 11:43:03,721 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 458 transitions. Word has length 116 [2025-03-17 11:43:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:03,721 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 458 transitions. [2025-03-17 11:43:03,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 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-17 11:43:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 458 transitions. [2025-03-17 11:43:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 11:43:03,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:03,723 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:43:03,737 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-17 11:43:03,923 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-17 11:43:03,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:03,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash 197266013, now seen corresponding path program 1 times [2025-03-17 11:43:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:03,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218480967] [2025-03-17 11:43:03,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:03,928 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-17 11:43:03,928 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-17 11:43:04,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:43:04,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:43:04,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:04,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:04,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:43:04,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 11:43:04,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:04,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:04,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218480967] [2025-03-17 11:43:04,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218480967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:04,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:04,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:43:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039255231] [2025-03-17 11:43:04,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:04,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:04,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:04,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:04,587 INFO L87 Difference]: Start difference. First operand 373 states and 458 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 11:43:08,999 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-17 11:43:13,005 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-17 11:43:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:14,888 INFO L93 Difference]: Finished difference Result 479 states and 591 transitions. [2025-03-17 11:43:14,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:43:14,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 116 [2025-03-17 11:43:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:14,892 INFO L225 Difference]: With dead ends: 479 [2025-03-17 11:43:14,892 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 11:43:14,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-17 11:43:14,892 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 423 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:43:14,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 492 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2025-03-17 11:43:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 11:43:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2025-03-17 11:43:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 467 states have (on average 1.23982869379015) internal successors, (579), 470 states have internal predecessors, (579), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 588 transitions. [2025-03-17 11:43:14,910 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 588 transitions. Word has length 116 [2025-03-17 11:43:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:14,911 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 588 transitions. [2025-03-17 11:43:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-17 11:43:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 588 transitions. [2025-03-17 11:43:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 11:43:14,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:14,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:43:14,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:43:15,112 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-17 11:43:15,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:15,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1802819063, now seen corresponding path program 1 times [2025-03-17 11:43:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:15,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570091685] [2025-03-17 11:43:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:15,116 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-17 11:43:15,116 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-17 11:43:15,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:43:15,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:43:15,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:15,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:15,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:43:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 11:43:15,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 11:43:15,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570091685] [2025-03-17 11:43:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570091685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:43:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:43:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:43:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886255914] [2025-03-17 11:43:15,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:43:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:43:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:15,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:43:15,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:43:15,511 INFO L87 Difference]: Start difference. First operand 476 states and 588 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:15,593 INFO L93 Difference]: Finished difference Result 425 states and 504 transitions. [2025-03-17 11:43:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:43:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 124 [2025-03-17 11:43:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:15,596 INFO L225 Difference]: With dead ends: 425 [2025-03-17 11:43:15,596 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 11:43:15,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 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-17 11:43:15,598 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 32 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 697 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-17 11:43:15,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 697 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:43:15,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 11:43:15,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-03-17 11:43:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 416 states have (on average 1.1899038461538463) internal successors, (495), 419 states have internal predecessors, (495), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 504 transitions. [2025-03-17 11:43:15,607 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 504 transitions. Word has length 124 [2025-03-17 11:43:15,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:15,607 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 504 transitions. [2025-03-17 11:43:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:43:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 504 transitions. [2025-03-17 11:43:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 11:43:15,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:15,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:43:15,622 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-17 11:43:15,808 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-17 11:43:15,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1356632674, now seen corresponding path program 1 times [2025-03-17 11:43:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234093071] [2025-03-17 11:43:15,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:43:15,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:15,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:15,812 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-17 11:43:15,813 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-17 11:43:16,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:43:16,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:43:16,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:43:16,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:16,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:43:16,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:43:16,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:43:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:43:16,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234093071] [2025-03-17 11:43:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234093071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:43:16,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:43:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-17 11:43:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511572298] [2025-03-17 11:43:16,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:43:16,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 11:43:16,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:16,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 11:43:16,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:43:16,317 INFO L87 Difference]: Start difference. First operand 425 states and 504 transitions. Second operand has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 11:43:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:16,428 INFO L93 Difference]: Finished difference Result 436 states and 521 transitions. [2025-03-17 11:43:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:43:16,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2025-03-17 11:43:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:16,430 INFO L225 Difference]: With dead ends: 436 [2025-03-17 11:43:16,430 INFO L226 Difference]: Without dead ends: 436 [2025-03-17 11:43:16,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 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-17 11:43:16,431 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 5 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:43:16,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1012 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:43:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-17 11:43:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-17 11:43:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 424 states have (on average 1.2004716981132075) internal successors, (509), 427 states have internal predecessors, (509), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 11:43:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 519 transitions. [2025-03-17 11:43:16,441 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 519 transitions. Word has length 124 [2025-03-17 11:43:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 519 transitions. [2025-03-17 11:43:16,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 11:43:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 519 transitions. [2025-03-17 11:43:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 11:43:16,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:16,443 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] [2025-03-17 11:43:16,457 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-17 11:43:16,643 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-17 11:43:16,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:16,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2014523738, now seen corresponding path program 2 times [2025-03-17 11:43:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314916549] [2025-03-17 11:43:16,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:43:16,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:16,646 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-17 11:43:16,648 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-17 11:43:16,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-17 11:43:17,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:43:17,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:43:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:17,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:43:17,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:17,158 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-17 11:43:17,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:43:17,281 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-17 11:43:17,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314916549] [2025-03-17 11:43:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314916549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:43:17,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:43:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-17 11:43:17,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765454067] [2025-03-17 11:43:17,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:43:17,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:43:17,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:17,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:43:17,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:43:17,283 INFO L87 Difference]: Start difference. First operand 434 states and 519 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 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-17 11:43:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:43:17,545 INFO L93 Difference]: Finished difference Result 442 states and 529 transitions. [2025-03-17 11:43:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:43:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 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 128 [2025-03-17 11:43:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:43:17,547 INFO L225 Difference]: With dead ends: 442 [2025-03-17 11:43:17,547 INFO L226 Difference]: Without dead ends: 440 [2025-03-17 11:43:17,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:43:17,547 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 6 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:43:17,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1520 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:43:17,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-17 11:43:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2025-03-17 11:43:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 428 states have (on average 1.2032710280373833) internal successors, (515), 431 states have internal predecessors, (515), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:43:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 524 transitions. [2025-03-17 11:43:17,556 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 524 transitions. Word has length 128 [2025-03-17 11:43:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:43:17,557 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 524 transitions. [2025-03-17 11:43:17,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 10 states have internal predecessors, (129), 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-17 11:43:17,557 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 524 transitions. [2025-03-17 11:43:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 11:43:17,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:43:17,558 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] [2025-03-17 11:43:17,574 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-17 11:43:17,758 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-17 11:43:17,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:43:17,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:43:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 90737254, now seen corresponding path program 3 times [2025-03-17 11:43:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 11:43:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596149039] [2025-03-17 11:43:17,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:43:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:43:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:43:17,761 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-17 11:43:17,762 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-17 11:43:18,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 132 statements into 6 equivalence classes. [2025-03-17 11:43:18,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 115 of 132 statements. [2025-03-17 11:43:18,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:43:18,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:18,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 11:43:18,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:18,213 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:18,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:18,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:18,215 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-17 11:43:19,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:19,484 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-17 11:43:19,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:19,549 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-17 11:43:19,569 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-17 11:43:19,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:43:19,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 11:43:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596149039] [2025-03-17 11:43:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596149039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:43:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1415643543] [2025-03-17 11:43:19,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:43:19,753 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 11:43:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 11:43:19,755 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 11:43:19,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-03-17 11:43:20,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 132 statements into 6 equivalence classes. [2025-03-17 11:43:20,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 115 of 132 statements. [2025-03-17 11:43:20,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:43:20,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:43:20,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:43:20,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:43:20,511 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:20,512 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:20,512 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:43:20,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2025-03-17 11:43:21,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:21,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 65 [2025-03-17 11:43:21,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:43:21,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 58 [2025-03-17 11:43:21,751 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-17 11:43:21,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:43:21,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1415643543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:43:21,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:43:21,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2025-03-17 11:43:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690230301] [2025-03-17 11:43:21,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:43:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:43:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 11:43:21,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:43:21,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:43:21,904 INFO L87 Difference]: Start difference. First operand 438 states and 524 transitions. Second operand has 10 states, 10 states have (on average 18.0) internal successors, (180), 9 states have internal predecessors, (180), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:43:26,267 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-17 11:43:30,287 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-17 11:43:34,383 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-17 11:43:38,391 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-17 11:43:42,403 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-17 11:43:46,459 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-17 11:43:50,535 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-17 11:43:54,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:43:58,710 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-17 11:44:02,770 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-17 11:44:06,848 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-17 11:44:10,855 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-17 11:44:14,882 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-17 11:44:18,915 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]