./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:05:09,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:05:09,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 06:05:09,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:05:09,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:05:09,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:05:09,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:05:09,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:05:09,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:05:09,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:05:09,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:05:09,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:05:09,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:05:09,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:05:09,215 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:05:09,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:05:09,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 06:05:09,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:05:09,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:05:09,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:05:09,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:05:09,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:05:09,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:05:09,219 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2025-02-08 06:05:09,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:05:09,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:05:09,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:05:09,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:05:09,477 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:05:09,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2025-02-08 06:05:10,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dfdb47d4/e2f95074f70a48b886f5333550c87653/FLAG2981b0492 [2025-02-08 06:05:11,106 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:05:11,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2025-02-08 06:05:11,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dfdb47d4/e2f95074f70a48b886f5333550c87653/FLAG2981b0492 [2025-02-08 06:05:11,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dfdb47d4/e2f95074f70a48b886f5333550c87653 [2025-02-08 06:05:11,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:05:11,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:05:11,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:11,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:05:11,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:05:11,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b8f2c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11, skipping insertion in model container [2025-02-08 06:05:11,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:05:11,597 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,615 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,617 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,619 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,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-02-08 06:05:11,645 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,646 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,653 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,657 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,664 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 06:05:11,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:11,690 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:05:11,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:05:11,802 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:05:11,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11 WrapperNode [2025-02-08 06:05:11,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:05:11,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:05:11,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:05:11,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:05:11,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,875 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1545 [2025-02-08 06:05:11,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:05:11,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:05:11,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:05:11,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:05:11,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,941 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-02-08 06:05:11,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:05:11,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:05:11,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:05:11,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:05:11,990 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (1/1) ... [2025-02-08 06:05:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:05:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:12,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:05:12,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 06:05:12,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 06:05:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 06:05:12,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 06:05:12,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:05:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:05:12,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:05:12,212 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:05:12,213 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:05:13,384 INFO L? ?]: Removed 388 outVars from TransFormulas that were not future-live. [2025-02-08 06:05:13,384 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:05:13,432 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:05:13,432 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 06:05:13,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:05:13 BoogieIcfgContainer [2025-02-08 06:05:13,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:05:13,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:05:13,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:05:13,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:05:13,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:05:11" (1/3) ... [2025-02-08 06:05:13,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2ae070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:05:13, skipping insertion in model container [2025-02-08 06:05:13,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:05:11" (2/3) ... [2025-02-08 06:05:13,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2ae070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:05:13, skipping insertion in model container [2025-02-08 06:05:13,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:05:13" (3/3) ... [2025-02-08 06:05:13,445 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2025-02-08 06:05:13,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:05:13,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-1.i that has 4 procedures, 423 locations, 1 initial locations, 36 loop locations, and 2 error locations. [2025-02-08 06:05:13,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:05:13,499 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;@30c980f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:05:13,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 06:05:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 419 states, 397 states have (on average 1.619647355163728) internal successors, (643), 409 states have internal predecessors, (643), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 06:05:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:05:13,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:13,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:05:13,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:13,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 22740462, now seen corresponding path program 1 times [2025-02-08 06:05:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156852273] [2025-02-08 06:05:13,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:13,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:05:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:05:13,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:13,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156852273] [2025-02-08 06:05:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156852273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:05:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202344688] [2025-02-08 06:05:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:13,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:05:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:13,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:05:13,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:05:13,661 INFO L87 Difference]: Start difference. First operand has 419 states, 397 states have (on average 1.619647355163728) internal successors, (643), 409 states have internal predecessors, (643), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:13,866 INFO L93 Difference]: Finished difference Result 798 states and 1165 transitions. [2025-02-08 06:05:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:05:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:05:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:13,877 INFO L225 Difference]: With dead ends: 798 [2025-02-08 06:05:13,877 INFO L226 Difference]: Without dead ends: 793 [2025-02-08 06:05:13,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:05:13,880 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 541 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:13,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1129 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:05:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-02-08 06:05:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 414. [2025-02-08 06:05:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 395 states have (on average 1.4582278481012658) internal successors, (576), 405 states have internal predecessors, (576), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:05:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 598 transitions. [2025-02-08 06:05:13,925 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 598 transitions. Word has length 4 [2025-02-08 06:05:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:13,925 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 598 transitions. [2025-02-08 06:05:13,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:05:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 598 transitions. [2025-02-08 06:05:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 06:05:13,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:13,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:13,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:05:13,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:13,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1753778368, now seen corresponding path program 1 times [2025-02-08 06:05:13,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:13,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613725520] [2025-02-08 06:05:13,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:13,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 06:05:14,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 06:05:14,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:14,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613725520] [2025-02-08 06:05:14,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613725520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:14,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:14,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:05:14,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357311059] [2025-02-08 06:05:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:14,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:05:14,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:14,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:05:14,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:14,472 INFO L87 Difference]: Start difference. First operand 414 states and 598 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-08 06:05:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:14,641 INFO L93 Difference]: Finished difference Result 417 states and 594 transitions. [2025-02-08 06:05:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:05:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 148 [2025-02-08 06:05:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:14,644 INFO L225 Difference]: With dead ends: 417 [2025-02-08 06:05:14,646 INFO L226 Difference]: Without dead ends: 417 [2025-02-08 06:05:14,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-08 06:05:14,647 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 105 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:14,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1494 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:05:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-02-08 06:05:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-02-08 06:05:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 395 states have (on average 1.440506329113924) internal successors, (569), 405 states have internal predecessors, (569), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:05:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 591 transitions. [2025-02-08 06:05:14,661 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 591 transitions. Word has length 148 [2025-02-08 06:05:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:14,661 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 591 transitions. [2025-02-08 06:05:14,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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-02-08 06:05:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 591 transitions. [2025-02-08 06:05:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-08 06:05:14,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:14,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:14,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:05:14,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1666513639, now seen corresponding path program 1 times [2025-02-08 06:05:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457564054] [2025-02-08 06:05:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:14,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 06:05:14,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 06:05:14,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:14,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:05:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457564054] [2025-02-08 06:05:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457564054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:05:14,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334134687] [2025-02-08 06:05:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:14,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:05:14,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:14,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:05:14,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:05:14,940 INFO L87 Difference]: Start difference. First operand 414 states and 591 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-02-08 06:05:15,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:15,088 INFO L93 Difference]: Finished difference Result 542 states and 778 transitions. [2025-02-08 06:05:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:05:15,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 148 [2025-02-08 06:05:15,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:15,091 INFO L225 Difference]: With dead ends: 542 [2025-02-08 06:05:15,091 INFO L226 Difference]: Without dead ends: 542 [2025-02-08 06:05:15,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:05:15,092 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 134 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:15,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1083 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:05:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-02-08 06:05:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-02-08 06:05:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 523 states have (on average 1.445506692160612) internal successors, (756), 533 states have internal predecessors, (756), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:05:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 778 transitions. [2025-02-08 06:05:15,123 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 778 transitions. Word has length 148 [2025-02-08 06:05:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 778 transitions. [2025-02-08 06:05:15,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-02-08 06:05:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 778 transitions. [2025-02-08 06:05:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 06:05:15,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:15,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:15,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:05:15,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2049502094, now seen corresponding path program 1 times [2025-02-08 06:05:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282239854] [2025-02-08 06:05:15,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:15,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 06:05:15,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 06:05:15,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:15,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:05:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282239854] [2025-02-08 06:05:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282239854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:15,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:05:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968164338] [2025-02-08 06:05:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:05:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:15,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:05:15,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:15,503 INFO L87 Difference]: Start difference. First operand 542 states and 778 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:05:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:15,657 INFO L93 Difference]: Finished difference Result 500 states and 701 transitions. [2025-02-08 06:05:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:05:15,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-02-08 06:05:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:15,661 INFO L225 Difference]: With dead ends: 500 [2025-02-08 06:05:15,661 INFO L226 Difference]: Without dead ends: 500 [2025-02-08 06:05:15,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-08 06:05:15,662 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 30 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:15,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1343 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:05:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-02-08 06:05:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-02-08 06:05:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 481 states have (on average 1.4116424116424116) internal successors, (679), 491 states have internal predecessors, (679), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:05:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 701 transitions. [2025-02-08 06:05:15,680 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 701 transitions. Word has length 163 [2025-02-08 06:05:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:15,681 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 701 transitions. [2025-02-08 06:05:15,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:05:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 701 transitions. [2025-02-08 06:05:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 06:05:15,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:15,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:15,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:05:15,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:15,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1597449895, now seen corresponding path program 1 times [2025-02-08 06:05:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:15,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685728209] [2025-02-08 06:05:15,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:15,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 06:05:15,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 06:05:15,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:15,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:05:15,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:15,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685728209] [2025-02-08 06:05:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685728209] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:15,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:15,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:05:15,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881538124] [2025-02-08 06:05:15,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:15,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:05:15,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:15,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:05:15,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:05:15,923 INFO L87 Difference]: Start difference. First operand 500 states and 701 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:05:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:16,038 INFO L93 Difference]: Finished difference Result 644 states and 896 transitions. [2025-02-08 06:05:16,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:05:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2025-02-08 06:05:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:16,041 INFO L225 Difference]: With dead ends: 644 [2025-02-08 06:05:16,043 INFO L226 Difference]: Without dead ends: 644 [2025-02-08 06:05:16,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:05:16,044 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 242 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:16,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 934 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:05:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-08 06:05:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2025-02-08 06:05:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 622 states have (on average 1.3954983922829582) internal successors, (868), 632 states have internal predecessors, (868), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:05:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 896 transitions. [2025-02-08 06:05:16,069 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 896 transitions. Word has length 163 [2025-02-08 06:05:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:16,070 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 896 transitions. [2025-02-08 06:05:16,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:05:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 896 transitions. [2025-02-08 06:05:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-02-08 06:05:16,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:16,071 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:05:16,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1805107818, now seen corresponding path program 1 times [2025-02-08 06:05:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137924125] [2025-02-08 06:05:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:16,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 06:05:16,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 06:05:16,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:16,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137924125] [2025-02-08 06:05:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137924125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:05:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:05:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:05:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879922892] [2025-02-08 06:05:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:05:16,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:05:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:16,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:05:16,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:05:16,414 INFO L87 Difference]: Start difference. First operand 644 states and 896 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:05:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:16,987 INFO L93 Difference]: Finished difference Result 665 states and 926 transitions. [2025-02-08 06:05:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:05:16,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2025-02-08 06:05:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:16,991 INFO L225 Difference]: With dead ends: 665 [2025-02-08 06:05:16,991 INFO L226 Difference]: Without dead ends: 665 [2025-02-08 06:05:16,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-08 06:05:16,992 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 763 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:16,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1135 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:05:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-02-08 06:05:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 645. [2025-02-08 06:05:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 623 states have (on average 1.3932584269662922) internal successors, (868), 633 states have internal predecessors, (868), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 06:05:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 896 transitions. [2025-02-08 06:05:17,014 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 896 transitions. Word has length 178 [2025-02-08 06:05:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 896 transitions. [2025-02-08 06:05:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 06:05:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 896 transitions. [2025-02-08 06:05:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 06:05:17,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:17,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:17,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:05:17,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash 786015135, now seen corresponding path program 1 times [2025-02-08 06:05:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:17,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496533065] [2025-02-08 06:05:17,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 06:05:17,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 06:05:17,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:17,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496533065] [2025-02-08 06:05:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496533065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:05:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50237187] [2025-02-08 06:05:17,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:17,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:17,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:17,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:05:17,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:05:17,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 06:05:17,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 06:05:17,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:17,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:17,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 06:05:17,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:05:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:17,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:05:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50237187] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:05:18,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:05:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 06:05:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608856307] [2025-02-08 06:05:18,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:05:18,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:05:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:18,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:05:18,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:05:18,175 INFO L87 Difference]: Start difference. First operand 645 states and 896 transitions. Second operand has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 06:05:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:18,411 INFO L93 Difference]: Finished difference Result 1356 states and 1883 transitions. [2025-02-08 06:05:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:05:18,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 183 [2025-02-08 06:05:18,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:18,417 INFO L225 Difference]: With dead ends: 1356 [2025-02-08 06:05:18,417 INFO L226 Difference]: Without dead ends: 1356 [2025-02-08 06:05:18,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:05:18,418 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2194 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2206 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:18,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2206 Valid, 1859 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:05:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2025-02-08 06:05:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2025-02-08 06:05:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1325 states have (on average 1.3864150943396227) internal successors, (1837), 1335 states have internal predecessors, (1837), 28 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 06:05:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1883 transitions. [2025-02-08 06:05:18,445 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1883 transitions. Word has length 183 [2025-02-08 06:05:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:18,446 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1883 transitions. [2025-02-08 06:05:18,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 06:05:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1883 transitions. [2025-02-08 06:05:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-02-08 06:05:18,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:18,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-08 06:05:18,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:05:18,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:18,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:18,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -947485613, now seen corresponding path program 1 times [2025-02-08 06:05:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:18,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764229261] [2025-02-08 06:05:18,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:18,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-02-08 06:05:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-02-08 06:05:19,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:19,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:05:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764229261] [2025-02-08 06:05:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764229261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:05:19,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121728612] [2025-02-08 06:05:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:05:19,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:05:19,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:05:19,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:05:20,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-02-08 06:05:20,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-02-08 06:05:20,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:05:20,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:05:20,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 3114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:05:20,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:05:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:21,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:05:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:05:22,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121728612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:05:22,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:05:22,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-08 06:05:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827652298] [2025-02-08 06:05:22,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:05:22,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:05:22,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:05:22,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:05:22,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:05:22,069 INFO L87 Difference]: Start difference. First operand 1356 states and 1883 transitions. Second operand has 12 states, 12 states have (on average 98.75) internal successors, (1185), 12 states have internal predecessors, (1185), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 06:05:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:05:22,778 INFO L93 Difference]: Finished difference Result 3330 states and 4631 transitions. [2025-02-08 06:05:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:05:22,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 98.75) internal successors, (1185), 12 states have internal predecessors, (1185), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 615 [2025-02-08 06:05:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:05:22,792 INFO L225 Difference]: With dead ends: 3330 [2025-02-08 06:05:22,792 INFO L226 Difference]: Without dead ends: 3330 [2025-02-08 06:05:22,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1225 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:05:22,793 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 4961 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4997 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:05:22,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4997 Valid, 4614 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:05:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2025-02-08 06:05:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3330. [2025-02-08 06:05:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 3275 states have (on average 1.3853435114503816) internal successors, (4537), 3285 states have internal predecessors, (4537), 52 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-02-08 06:05:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 4631 transitions. [2025-02-08 06:05:22,871 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 4631 transitions. Word has length 615 [2025-02-08 06:05:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:05:22,873 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 4631 transitions. [2025-02-08 06:05:22,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.75) internal successors, (1185), 12 states have internal predecessors, (1185), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 06:05:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 4631 transitions. [2025-02-08 06:05:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2025-02-08 06:05:22,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:05:22,922 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:05:22,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:05:23,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:05:23,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 06:05:23,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:05:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1854415429, now seen corresponding path program 2 times [2025-02-08 06:05:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:05:23,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088423511] [2025-02-08 06:05:23,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:05:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:05:23,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1479 statements into 2 equivalence classes.