./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc 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_test2-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 dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:57:17,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:57:17,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:57:17,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:57:17,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:57:17,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:57:17,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:57:17,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:57:17,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:57:17,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:57:17,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:57:17,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:57:17,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:57:17,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:57:17,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:57:17,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:57:17,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:57:17,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:57:17,904 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 -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2025-02-06 09:57:18,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:57:18,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:57:18,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:57:18,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:57:18,147 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:57:18,147 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_test2-1.i [2025-02-06 09:57:19,314 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0256d0a8/b8d349e3d6ef4ccdb821ad6a12adf918/FLAG78ff7d9eb [2025-02-06 09:57:19,597 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:57:19,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2025-02-06 09:57:19,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0256d0a8/b8d349e3d6ef4ccdb821ad6a12adf918/FLAG78ff7d9eb [2025-02-06 09:57:19,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0256d0a8/b8d349e3d6ef4ccdb821ad6a12adf918 [2025-02-06 09:57:19,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:57:19,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:57:19,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:57:19,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:57:19,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:57:19,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:57:19" (1/1) ... [2025-02-06 09:57:19,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5837b54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:19, skipping insertion in model container [2025-02-06 09:57:19,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:57:19" (1/1) ... [2025-02-06 09:57:19,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:57:20,232 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-06 09:57:20,261 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-06 09:57:20,265 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-06 09:57:20,267 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-06 09:57:20,271 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-06 09:57:20,297 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-06 09:57:20,297 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-06 09:57:20,298 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-06 09:57:20,298 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-06 09:57:20,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:57:20,317 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:57:20,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:57:20,432 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:57:20,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20 WrapperNode [2025-02-06 09:57:20,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:57:20,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:57:20,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:57:20,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:57:20,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,516 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-02-06 09:57:20,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:57:20,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:57:20,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:57:20,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:57:20,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,598 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-02-06 09:57:20,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:57:20,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:57:20,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:57:20,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:57:20,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (1/1) ... [2025-02-06 09:57:20,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:57:20,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:57:20,677 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-06 09:57:20,679 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-06 09:57:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 09:57:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 09:57:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 09:57:20,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 09:57:20,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 09:57:20,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 09:57:20,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 09:57:20,698 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 09:57:20,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:57:20,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:57:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:57:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:57:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:57:20,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:57:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:57:20,866 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:57:20,867 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:57:21,809 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 09:57:21,871 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-02-06 09:57:21,871 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:57:21,902 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:57:21,903 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 09:57:21,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:57:21 BoogieIcfgContainer [2025-02-06 09:57:21,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:57:21,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:57:21,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:57:21,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:57:21,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:57:19" (1/3) ... [2025-02-06 09:57:21,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c41efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:57:21, skipping insertion in model container [2025-02-06 09:57:21,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:57:20" (2/3) ... [2025-02-06 09:57:21,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c41efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:57:21, skipping insertion in model container [2025-02-06 09:57:21,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:57:21" (3/3) ... [2025-02-06 09:57:21,909 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2025-02-06 09:57:21,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:57:21,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test2-1.i that has 6 procedures, 390 locations, 1 initial locations, 33 loop locations, and 2 error locations. [2025-02-06 09:57:21,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:57:21,963 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;@4747354a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:57:21,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:57:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 366 states have (on average 1.6174863387978142) internal successors, (592), 375 states have internal predecessors, (592), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 09:57:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 09:57:21,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:21,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:21,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -154665743, now seen corresponding path program 1 times [2025-02-06 09:57:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401668335] [2025-02-06 09:57:21,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:21,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 09:57:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 09:57:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:22,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:22,154 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-06 09:57:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401668335] [2025-02-06 09:57:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401668335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:22,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:57:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932165391] [2025-02-06 09:57:22,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:22,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 09:57:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:22,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 09:57:22,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:57:22,182 INFO L87 Difference]: Start difference. First operand has 382 states, 366 states have (on average 1.6174863387978142) internal successors, (592), 375 states have internal predecessors, (592), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 09:57:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:22,311 INFO L93 Difference]: Finished difference Result 380 states and 553 transitions. [2025-02-06 09:57:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 09:57:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-02-06 09:57:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:22,321 INFO L225 Difference]: With dead ends: 380 [2025-02-06 09:57:22,321 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 09:57:22,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 09:57:22,326 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:22,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 512 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 09:57:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-02-06 09:57:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 364 states have (on average 1.4642857142857142) internal successors, (533), 371 states have internal predecessors, (533), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:57:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 551 transitions. [2025-02-06 09:57:22,380 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 551 transitions. Word has length 7 [2025-02-06 09:57:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:22,380 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 551 transitions. [2025-02-06 09:57:22,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-06 09:57:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 551 transitions. [2025-02-06 09:57:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 09:57:22,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:22,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:22,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:57:22,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:22,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1756358563, now seen corresponding path program 1 times [2025-02-06 09:57:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065941751] [2025-02-06 09:57:22,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:22,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 09:57:22,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 09:57:22,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:22,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:22,509 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-06 09:57:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065941751] [2025-02-06 09:57:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065941751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:57:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012189714] [2025-02-06 09:57:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:22,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:57:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:57:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:57:22,510 INFO L87 Difference]: Start difference. First operand 378 states and 551 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-06 09:57:22,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:22,759 INFO L93 Difference]: Finished difference Result 739 states and 1086 transitions. [2025-02-06 09:57:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:57:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-02-06 09:57:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:22,763 INFO L225 Difference]: With dead ends: 739 [2025-02-06 09:57:22,763 INFO L226 Difference]: Without dead ends: 739 [2025-02-06 09:57:22,763 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-06 09:57:22,764 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 515 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:22,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1540 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:57:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-02-06 09:57:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 380. [2025-02-06 09:57:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 366 states have (on average 1.4617486338797814) internal successors, (535), 373 states have internal predecessors, (535), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:57:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 553 transitions. [2025-02-06 09:57:22,786 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 553 transitions. Word has length 9 [2025-02-06 09:57:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:22,786 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 553 transitions. [2025-02-06 09:57:22,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-06 09:57:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 553 transitions. [2025-02-06 09:57:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:57:22,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:22,789 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:22,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:57:22,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:22,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:22,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1211138795, now seen corresponding path program 1 times [2025-02-06 09:57:22,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:22,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633917834] [2025-02-06 09:57:22,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:22,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:22,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:57:22,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:57:22,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:22,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:57:23,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633917834] [2025-02-06 09:57:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633917834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:57:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128400267] [2025-02-06 09:57:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:23,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:57:23,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:23,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:57:23,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:57:23,180 INFO L87 Difference]: Start difference. First operand 380 states and 553 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-06 09:57:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:23,310 INFO L93 Difference]: Finished difference Result 338 states and 476 transitions. [2025-02-06 09:57:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:57:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-02-06 09:57:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:23,312 INFO L225 Difference]: With dead ends: 338 [2025-02-06 09:57:23,313 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 09:57:23,313 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-06 09:57:23,314 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:23,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1235 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 09:57:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 09:57:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 324 states have (on average 1.4135802469135803) internal successors, (458), 331 states have internal predecessors, (458), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:57:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 476 transitions. [2025-02-06 09:57:23,330 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 476 transitions. Word has length 84 [2025-02-06 09:57:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:23,330 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 476 transitions. [2025-02-06 09:57:23,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-06 09:57:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 476 transitions. [2025-02-06 09:57:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:57:23,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:23,334 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:23,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:57:23,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:23,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 923371908, now seen corresponding path program 1 times [2025-02-06 09:57:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989209888] [2025-02-06 09:57:23,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:23,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:57:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:57:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:23,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:57:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989209888] [2025-02-06 09:57:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989209888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:23,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:23,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:57:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212741261] [2025-02-06 09:57:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:23,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:57:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:23,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:57:23,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:57:23,479 INFO L87 Difference]: Start difference. First operand 338 states and 476 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06 09:57:23,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:23,552 INFO L93 Difference]: Finished difference Result 338 states and 473 transitions. [2025-02-06 09:57:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:57:23,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-02-06 09:57:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:23,554 INFO L225 Difference]: With dead ends: 338 [2025-02-06 09:57:23,554 INFO L226 Difference]: Without dead ends: 338 [2025-02-06 09:57:23,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 09:57:23,556 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:23,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:23,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-06 09:57:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-06 09:57:23,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 324 states have (on average 1.404320987654321) internal successors, (455), 331 states have internal predecessors, (455), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:57:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 473 transitions. [2025-02-06 09:57:23,566 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 473 transitions. Word has length 84 [2025-02-06 09:57:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:23,567 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 473 transitions. [2025-02-06 09:57:23,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06 09:57:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 473 transitions. [2025-02-06 09:57:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-06 09:57:23,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:23,570 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:23,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:57:23,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:23,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash 485362405, now seen corresponding path program 1 times [2025-02-06 09:57:23,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:23,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723241248] [2025-02-06 09:57:23,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:23,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:23,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-06 09:57:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-06 09:57:23,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:23,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:57:23,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:23,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723241248] [2025-02-06 09:57:23,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723241248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:23,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:57:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406716052] [2025-02-06 09:57:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:23,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:57:23,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:23,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:57:23,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:57:23,735 INFO L87 Difference]: Start difference. First operand 338 states and 473 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06 09:57:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:23,868 INFO L93 Difference]: Finished difference Result 573 states and 813 transitions. [2025-02-06 09:57:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:57:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 84 [2025-02-06 09:57:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:23,871 INFO L225 Difference]: With dead ends: 573 [2025-02-06 09:57:23,871 INFO L226 Difference]: Without dead ends: 573 [2025-02-06 09:57:23,871 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-06 09:57:23,872 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 272 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:23,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1036 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-06 09:57:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 569. [2025-02-06 09:57:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 550 states have (on average 1.4218181818181819) internal successors, (782), 562 states have internal predecessors, (782), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:57:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 810 transitions. [2025-02-06 09:57:23,883 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 810 transitions. Word has length 84 [2025-02-06 09:57:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:23,883 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 810 transitions. [2025-02-06 09:57:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-06 09:57:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 810 transitions. [2025-02-06 09:57:23,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 09:57:23,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:23,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:57:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:57:23,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1244323027, now seen corresponding path program 1 times [2025-02-06 09:57:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730889711] [2025-02-06 09:57:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:23,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 09:57:23,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 09:57:23,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:23,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:57:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:24,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730889711] [2025-02-06 09:57:24,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730889711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:24,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:24,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:57:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168131801] [2025-02-06 09:57:24,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:57:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:24,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:57:24,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:57:24,273 INFO L87 Difference]: Start difference. First operand 569 states and 810 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 09:57:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:24,426 INFO L93 Difference]: Finished difference Result 814 states and 1172 transitions. [2025-02-06 09:57:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:57:24,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 99 [2025-02-06 09:57:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:24,430 INFO L225 Difference]: With dead ends: 814 [2025-02-06 09:57:24,431 INFO L226 Difference]: Without dead ends: 814 [2025-02-06 09:57:24,431 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-06 09:57:24,432 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 428 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:24,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1238 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-06 09:57:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 571. [2025-02-06 09:57:24,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 552 states have (on average 1.4202898550724639) internal successors, (784), 564 states have internal predecessors, (784), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:57:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 812 transitions. [2025-02-06 09:57:24,453 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 812 transitions. Word has length 99 [2025-02-06 09:57:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 812 transitions. [2025-02-06 09:57:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-06 09:57:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 812 transitions. [2025-02-06 09:57:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:57:24,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:24,456 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:57:24,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:57:24,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:24,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2134202937, now seen corresponding path program 1 times [2025-02-06 09:57:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:24,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398763475] [2025-02-06 09:57:24,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:24,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:57:24,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:57:24,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:24,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:57:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:24,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398763475] [2025-02-06 09:57:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398763475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:24,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:24,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:57:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005068429] [2025-02-06 09:57:24,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:24,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:57:24,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:24,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:57:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:57:24,657 INFO L87 Difference]: Start difference. First operand 571 states and 812 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:24,752 INFO L93 Difference]: Finished difference Result 611 states and 852 transitions. [2025-02-06 09:57:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:57:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2025-02-06 09:57:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:24,755 INFO L225 Difference]: With dead ends: 611 [2025-02-06 09:57:24,755 INFO L226 Difference]: Without dead ends: 611 [2025-02-06 09:57:24,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 09:57:24,756 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 8 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:24,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 817 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:24,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-06 09:57:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-02-06 09:57:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 592 states have (on average 1.3918918918918919) internal successors, (824), 604 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:57:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 852 transitions. [2025-02-06 09:57:24,767 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 852 transitions. Word has length 155 [2025-02-06 09:57:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 852 transitions. [2025-02-06 09:57:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 852 transitions. [2025-02-06 09:57:24,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:57:24,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:24,769 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:57:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:57:24,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2036691112, now seen corresponding path program 1 times [2025-02-06 09:57:24,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:24,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191269931] [2025-02-06 09:57:24,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:24,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:24,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:57:24,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:57:24,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:24,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:57:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191269931] [2025-02-06 09:57:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191269931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:57:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940610733] [2025-02-06 09:57:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:57:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:24,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:57:24,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:57:24,974 INFO L87 Difference]: Start difference. First operand 611 states and 852 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:25,058 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2025-02-06 09:57:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:57:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2025-02-06 09:57:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:25,060 INFO L225 Difference]: With dead ends: 487 [2025-02-06 09:57:25,060 INFO L226 Difference]: Without dead ends: 487 [2025-02-06 09:57:25,060 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-06 09:57:25,061 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 32 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:25,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1009 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:57:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-02-06 09:57:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2025-02-06 09:57:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 468 states have (on average 1.3333333333333333) internal successors, (624), 480 states have internal predecessors, (624), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 09:57:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 652 transitions. [2025-02-06 09:57:25,070 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 652 transitions. Word has length 155 [2025-02-06 09:57:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:25,070 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 652 transitions. [2025-02-06 09:57:25,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 652 transitions. [2025-02-06 09:57:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-06 09:57:25,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:25,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:57:25,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:57:25,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:25,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1888943553, now seen corresponding path program 1 times [2025-02-06 09:57:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540522699] [2025-02-06 09:57:25,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:25,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-06 09:57:25,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-06 09:57:25,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:25,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540522699] [2025-02-06 09:57:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540522699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:25,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:57:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030969888] [2025-02-06 09:57:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:57:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:25,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:57:25,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:57:25,263 INFO L87 Difference]: Start difference. First operand 487 states and 652 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:25,787 INFO L93 Difference]: Finished difference Result 569 states and 758 transitions. [2025-02-06 09:57:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:57:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 155 [2025-02-06 09:57:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:25,789 INFO L225 Difference]: With dead ends: 569 [2025-02-06 09:57:25,789 INFO L226 Difference]: Without dead ends: 569 [2025-02-06 09:57:25,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:57:25,790 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1024 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:25,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 962 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 09:57:25,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-06 09:57:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 384. [2025-02-06 09:57:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 370 states have (on average 1.3216216216216217) internal successors, (489), 377 states have internal predecessors, (489), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 09:57:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 507 transitions. [2025-02-06 09:57:25,797 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 507 transitions. Word has length 155 [2025-02-06 09:57:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 507 transitions. [2025-02-06 09:57:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 507 transitions. [2025-02-06 09:57:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 09:57:25,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:25,799 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:57:25,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:57:25,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:25,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:25,800 INFO L85 PathProgramCache]: Analyzing trace with hash 608451059, now seen corresponding path program 1 times [2025-02-06 09:57:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817233478] [2025-02-06 09:57:25,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:25,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:57:25,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:57:25,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:25,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:26,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817233478] [2025-02-06 09:57:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817233478] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:57:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170703785] [2025-02-06 09:57:26,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:26,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:57:26,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:57:26,351 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-06 09:57:26,353 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-06 09:57:26,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:57:26,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:57:26,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:26,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:26,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:57:26,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:57:26,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:57:26,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:57:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:26,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:57:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170703785] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:57:27,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:57:27,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-06 09:57:27,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458440139] [2025-02-06 09:57:27,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:57:27,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 09:57:27,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:27,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 09:57:27,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 09:57:27,092 INFO L87 Difference]: Start difference. First operand 384 states and 507 transitions. Second operand has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 09:57:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:27,472 INFO L93 Difference]: Finished difference Result 1123 states and 1496 transitions. [2025-02-06 09:57:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:57:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 165 [2025-02-06 09:57:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:27,477 INFO L225 Difference]: With dead ends: 1123 [2025-02-06 09:57:27,477 INFO L226 Difference]: Without dead ends: 1123 [2025-02-06 09:57:27,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 322 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:57:27,478 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1733 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:27,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 2771 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:57:27,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-02-06 09:57:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 726. [2025-02-06 09:57:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 708 states have (on average 1.3206214689265536) internal successors, (935), 715 states have internal predecessors, (935), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 09:57:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 959 transitions. [2025-02-06 09:57:27,492 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 959 transitions. Word has length 165 [2025-02-06 09:57:27,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:27,493 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 959 transitions. [2025-02-06 09:57:27,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 27.0) internal successors, (324), 12 states have internal predecessors, (324), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 09:57:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 959 transitions. [2025-02-06 09:57:27,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-06 09:57:27,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:27,496 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 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] [2025-02-06 09:57:27,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:57:27,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 09:57:27,697 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -153961067, now seen corresponding path program 1 times [2025-02-06 09:57:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651495328] [2025-02-06 09:57:27,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:27,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 09:57:27,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 09:57:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:29,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651495328] [2025-02-06 09:57:29,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651495328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:57:29,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917553782] [2025-02-06 09:57:29,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:57:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:57:29,956 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-06 09:57:29,961 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-06 09:57:30,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-06 09:57:30,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-06 09:57:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:30,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:30,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 09:57:30,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:57:30,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:57:30,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:57:30,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:57:30,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:57:31,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:57:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:31,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:57:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:57:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917553782] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:57:31,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:57:31,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-02-06 09:57:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872351455] [2025-02-06 09:57:31,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:57:31,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:57:31,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:31,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:57:31,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:57:31,438 INFO L87 Difference]: Start difference. First operand 726 states and 959 transitions. Second operand has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 09:57:32,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:32,496 INFO L93 Difference]: Finished difference Result 2353 states and 3146 transitions. [2025-02-06 09:57:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 09:57:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 390 [2025-02-06 09:57:32,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:32,503 INFO L225 Difference]: With dead ends: 2353 [2025-02-06 09:57:32,504 INFO L226 Difference]: Without dead ends: 2353 [2025-02-06 09:57:32,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 768 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-06 09:57:32,504 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 5037 mSDsluCounter, 9540 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 10855 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:32,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 10855 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 09:57:32,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-02-06 09:57:32,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 1578. [2025-02-06 09:57:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1554 states have (on average 1.3198198198198199) internal successors, (2051), 1561 states have internal predecessors, (2051), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:57:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2087 transitions. [2025-02-06 09:57:32,536 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2087 transitions. Word has length 390 [2025-02-06 09:57:32,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:32,536 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2087 transitions. [2025-02-06 09:57:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.43478260869565) internal successors, (999), 23 states have internal predecessors, (999), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 09:57:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2087 transitions. [2025-02-06 09:57:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2025-02-06 09:57:32,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:32,552 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-02-06 09:57:32,562 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-06 09:57:32,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:57:32,753 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 915708245, now seen corresponding path program 2 times [2025-02-06 09:57:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111296484] [2025-02-06 09:57:32,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:57:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:33,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 840 statements into 2 equivalence classes. [2025-02-06 09:57:33,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 840 statements. [2025-02-06 09:57:33,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:57:33,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 09:57:33,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:33,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111296484] [2025-02-06 09:57:33,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111296484] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:33,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:33,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 09:57:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293514247] [2025-02-06 09:57:33,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:33,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:57:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:33,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:57:33,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:57:33,204 INFO L87 Difference]: Start difference. First operand 1578 states and 2087 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:33,479 INFO L93 Difference]: Finished difference Result 1583 states and 2094 transitions. [2025-02-06 09:57:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:57:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 840 [2025-02-06 09:57:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:33,485 INFO L225 Difference]: With dead ends: 1583 [2025-02-06 09:57:33,485 INFO L226 Difference]: Without dead ends: 1583 [2025-02-06 09:57:33,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:57:33,486 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 14 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:33,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1476 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:57:33,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-02-06 09:57:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1580. [2025-02-06 09:57:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1556 states have (on average 1.319408740359897) internal successors, (2053), 1563 states have internal predecessors, (2053), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:57:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2089 transitions. [2025-02-06 09:57:33,507 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2089 transitions. Word has length 840 [2025-02-06 09:57:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:33,508 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2089 transitions. [2025-02-06 09:57:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2089 transitions. [2025-02-06 09:57:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 09:57:33,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:33,519 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-02-06 09:57:33,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:57:33,519 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:33,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:33,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1937674696, now seen corresponding path program 1 times [2025-02-06 09:57:33,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:33,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603253579] [2025-02-06 09:57:33,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:33,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:33,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:57:34,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:57:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:57:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:57:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 09:57:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:57:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603253579] [2025-02-06 09:57:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603253579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:57:35,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:57:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:57:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478363450] [2025-02-06 09:57:35,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:57:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:57:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:57:35,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:57:35,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:57:35,035 INFO L87 Difference]: Start difference. First operand 1580 states and 2089 transitions. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:57:35,288 INFO L93 Difference]: Finished difference Result 1585 states and 2095 transitions. [2025-02-06 09:57:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:57:35,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 841 [2025-02-06 09:57:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:57:35,301 INFO L225 Difference]: With dead ends: 1585 [2025-02-06 09:57:35,305 INFO L226 Difference]: Without dead ends: 1585 [2025-02-06 09:57:35,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:57:35,306 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 15 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:57:35,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1772 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:57:35,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-06 09:57:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1584. [2025-02-06 09:57:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1560 states have (on average 1.3192307692307692) internal successors, (2058), 1567 states have internal predecessors, (2058), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-06 09:57:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2094 transitions. [2025-02-06 09:57:35,348 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2094 transitions. Word has length 841 [2025-02-06 09:57:35,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:57:35,349 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2094 transitions. [2025-02-06 09:57:35,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 09:57:35,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2094 transitions. [2025-02-06 09:57:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-02-06 09:57:35,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:57:35,360 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-02-06 09:57:35,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:57:35,360 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:57:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:57:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1319130433, now seen corresponding path program 1 times [2025-02-06 09:57:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:57:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739644926] [2025-02-06 09:57:35,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:57:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:57:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:58:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:58:41,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:58:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:58:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 497 proven. 3 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2025-02-06 09:58:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:58:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739644926] [2025-02-06 09:58:41,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739644926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:58:41,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630971261] [2025-02-06 09:58:41,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:58:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:58:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:58:41,674 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:58:41,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 09:58:42,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes. [2025-02-06 09:58:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements. [2025-02-06 09:58:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:58:50,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:58:50,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 09:58:50,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:58:50,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 09:58:50,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:58:51,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 09:58:51,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-06 09:58:51,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:58:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2025-02-06 09:58:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 1350 proven. 137 refuted. 0 times theorem prover too weak. 1894 trivial. 0 not checked. [2025-02-06 09:58:51,750 INFO L312 TraceCheckSpWp]: Computing backward predicates...