./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:34:39,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:34:39,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:34:39,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:34:39,534 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:34:39,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:34:39,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:34:39,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:34:39,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:34:39,549 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:34:39,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:34:39,550 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:34:39,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:34:39,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:34:39,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:34:39,552 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:34:39,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:34:39,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:34:39,553 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eb0e4c4138981b5d0263d433279609e9b809291f20fa6c19565d53ef342ae2b [2025-03-17 11:34:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:34:39,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:34:39,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:34:39,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:34:39,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:34:39,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-03-17 11:34:40,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2135fe300/c44c75805c7548adba3176912bfe13ef/FLAGca1103b0b [2025-03-17 11:34:41,255 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:34:41,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test2-1.i [2025-03-17 11:34:41,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2135fe300/c44c75805c7548adba3176912bfe13ef/FLAGca1103b0b [2025-03-17 11:34:41,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2135fe300/c44c75805c7548adba3176912bfe13ef [2025-03-17 11:34:41,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:34:41,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:34:41,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:34:41,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:34:41,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:34:41,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5219024d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41, skipping insertion in model container [2025-03-17 11:34:41,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:34:41,578 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,608 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,611 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,614 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,620 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,642 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,643 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,644 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,644 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 11:34:41,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:34:41,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:34:41,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:34:41,789 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:34:41,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41 WrapperNode [2025-03-17 11:34:41,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:34:41,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:34:41,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:34:41,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:34:41,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,870 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-03-17 11:34:41,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:34:41,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:34:41,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:34:41,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:34:41,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,939 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 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, 4, 42]. [2025-03-17 11:34:41,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:41,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:34:41,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:34:41,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:34:41,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:34:42,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (1/1) ... [2025-03-17 11:34:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:34:42,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:42,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:34:42,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:34:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 11:34:42,049 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 11:34:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:34:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:34:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 11:34:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:34:42,050 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:34:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 11:34:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:34:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:34:42,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:34:42,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:34:42,199 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:34:43,897 INFO L1322 $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-03-17 11:34:43,970 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-03-17 11:34:43,970 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:34:44,011 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:34:44,012 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 11:34:44,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:34:44 BoogieIcfgContainer [2025-03-17 11:34:44,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:34:44,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:34:44,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:34:44,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:34:44,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:34:41" (1/3) ... [2025-03-17 11:34:44,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52348b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:34:44, skipping insertion in model container [2025-03-17 11:34:44,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:34:41" (2/3) ... [2025-03-17 11:34:44,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52348b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:34:44, skipping insertion in model container [2025-03-17 11:34:44,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:34:44" (3/3) ... [2025-03-17 11:34:44,018 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test2-1.i [2025-03-17 11:34:44,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:34:44,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test2-1.i that has 6 procedures, 386 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-17 11:34:44,072 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:34:44,080 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;@4322f095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:34:44,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:34:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 378 states, 362 states have (on average 1.6243093922651934) internal successors, (588), 371 states have internal predecessors, (588), 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-03-17 11:34:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:34:44,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:44,091 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:34:44,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:44,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:44,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1103112868, now seen corresponding path program 1 times [2025-03-17 11:34:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:44,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575768706] [2025-03-17 11:34:44,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:44,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:44,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:34:44,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:34:44,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:44,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575768706] [2025-03-17 11:34:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575768706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:44,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:44,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:34:44,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363242968] [2025-03-17 11:34:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:44,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:34:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:34:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:34:44,244 INFO L87 Difference]: Start difference. First operand has 378 states, 362 states have (on average 1.6243093922651934) internal successors, (588), 371 states have internal predecessors, (588), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:44,364 INFO L93 Difference]: Finished difference Result 376 states and 549 transitions. [2025-03-17 11:34:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:34:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-17 11:34:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:44,376 INFO L225 Difference]: With dead ends: 376 [2025-03-17 11:34:44,377 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 11:34:44,379 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-03-17 11:34:44,382 INFO L435 NwaCegarLoop]: 508 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, 508 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-03-17 11:34:44,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 11:34:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-03-17 11:34:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 360 states have (on average 1.4694444444444446) internal successors, (529), 367 states have internal predecessors, (529), 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-03-17 11:34:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 547 transitions. [2025-03-17 11:34:44,431 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 547 transitions. Word has length 6 [2025-03-17 11:34:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:44,431 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 547 transitions. [2025-03-17 11:34:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 547 transitions. [2025-03-17 11:34:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:34:44,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:44,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:34:44,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:34:44,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 803047535, now seen corresponding path program 1 times [2025-03-17 11:34:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:44,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292599004] [2025-03-17 11:34:44,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:44,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:44,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:34:44,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:34:44,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:44,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:44,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292599004] [2025-03-17 11:34:44,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292599004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:44,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:44,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:34:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267619296] [2025-03-17 11:34:44,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:44,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:44,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:44,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:44,594 INFO L87 Difference]: Start difference. First operand 374 states and 547 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:44,849 INFO L93 Difference]: Finished difference Result 732 states and 1079 transitions. [2025-03-17 11:34:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:34:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-17 11:34:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:44,853 INFO L225 Difference]: With dead ends: 732 [2025-03-17 11:34:44,855 INFO L226 Difference]: Without dead ends: 732 [2025-03-17 11:34:44,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:44,856 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 512 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1528 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-03-17 11:34:44,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1528 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-03-17 11:34:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 376. [2025-03-17 11:34:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 362 states have (on average 1.4668508287292819) internal successors, (531), 369 states have internal predecessors, (531), 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-03-17 11:34:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 549 transitions. [2025-03-17 11:34:44,886 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 549 transitions. Word has length 8 [2025-03-17 11:34:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 549 transitions. [2025-03-17 11:34:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 549 transitions. [2025-03-17 11:34:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:34:44,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:44,889 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] [2025-03-17 11:34:44,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:34:44,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:44,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 948561865, now seen corresponding path program 1 times [2025-03-17 11:34:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001889326] [2025-03-17 11:34:44,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:44,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:34:44,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:34:44,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:44,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:45,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:45,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001889326] [2025-03-17 11:34:45,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001889326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:45,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282118693] [2025-03-17 11:34:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:45,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:45,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:45,198 INFO L87 Difference]: Start difference. First operand 376 states and 549 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:45,324 INFO L93 Difference]: Finished difference Result 334 states and 472 transitions. [2025-03-17 11:34:45,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2025-03-17 11:34:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:45,326 INFO L225 Difference]: With dead ends: 334 [2025-03-17 11:34:45,328 INFO L226 Difference]: Without dead ends: 334 [2025-03-17 11:34:45,328 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-03-17 11:34:45,328 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 30 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1223 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-03-17 11:34:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1223 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-17 11:34:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-03-17 11:34:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 320 states have (on average 1.41875) internal successors, (454), 327 states have internal predecessors, (454), 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-03-17 11:34:45,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 472 transitions. [2025-03-17 11:34:45,344 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 472 transitions. Word has length 82 [2025-03-17 11:34:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 472 transitions. [2025-03-17 11:34:45,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 472 transitions. [2025-03-17 11:34:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 11:34:45,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:45,348 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] [2025-03-17 11:34:45,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:34:45,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:45,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1120704957, now seen corresponding path program 1 times [2025-03-17 11:34:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:45,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837999655] [2025-03-17 11:34:45,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:45,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:45,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:34:45,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:34:45,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:45,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:34:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837999655] [2025-03-17 11:34:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837999655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:45,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:34:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623708816] [2025-03-17 11:34:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:45,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:34:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:45,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:34:45,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:45,518 INFO L87 Difference]: Start difference. First operand 334 states and 472 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:45,640 INFO L93 Difference]: Finished difference Result 566 states and 812 transitions. [2025-03-17 11:34:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:34:45,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 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 82 [2025-03-17 11:34:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:45,643 INFO L225 Difference]: With dead ends: 566 [2025-03-17 11:34:45,643 INFO L226 Difference]: Without dead ends: 566 [2025-03-17 11:34:45,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:34:45,644 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 270 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1028 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-03-17 11:34:45,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1028 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-17 11:34:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 562. [2025-03-17 11:34:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 543 states have (on average 1.438305709023941) internal successors, (781), 555 states have internal predecessors, (781), 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-03-17 11:34:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 809 transitions. [2025-03-17 11:34:45,669 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 809 transitions. Word has length 82 [2025-03-17 11:34:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:45,669 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 809 transitions. [2025-03-17 11:34:45,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:34:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 809 transitions. [2025-03-17 11:34:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 11:34:45,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:45,672 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] [2025-03-17 11:34:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:34:45,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:45,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -244665357, now seen corresponding path program 1 times [2025-03-17 11:34:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120973770] [2025-03-17 11:34:45,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:45,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 11:34:45,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 11:34:45,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:45,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:34:46,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:46,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120973770] [2025-03-17 11:34:46,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120973770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023367793] [2025-03-17 11:34:46,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:46,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:46,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:46,041 INFO L87 Difference]: Start difference. First operand 562 states and 809 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:46,199 INFO L93 Difference]: Finished difference Result 804 states and 1168 transitions. [2025-03-17 11:34:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:34:46,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 97 [2025-03-17 11:34:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:46,203 INFO L225 Difference]: With dead ends: 804 [2025-03-17 11:34:46,203 INFO L226 Difference]: Without dead ends: 804 [2025-03-17 11:34:46,203 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-03-17 11:34:46,205 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 425 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:46,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1304 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-17 11:34:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 564. [2025-03-17 11:34:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 545 states have (on average 1.436697247706422) internal successors, (783), 557 states have internal predecessors, (783), 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-03-17 11:34:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 811 transitions. [2025-03-17 11:34:46,229 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 811 transitions. Word has length 97 [2025-03-17 11:34:46,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:46,229 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 811 transitions. [2025-03-17 11:34:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 811 transitions. [2025-03-17 11:34:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 11:34:46,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:46,234 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] [2025-03-17 11:34:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:34:46,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:46,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1304976826, now seen corresponding path program 1 times [2025-03-17 11:34:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:46,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241675269] [2025-03-17 11:34:46,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:46,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:34:46,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:34:46,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:46,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 11:34:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241675269] [2025-03-17 11:34:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241675269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:46,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:46,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:34:46,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190485424] [2025-03-17 11:34:46,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:46,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:34:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:46,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:34:46,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:34:46,496 INFO L87 Difference]: Start difference. First operand 564 states and 811 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:46,610 INFO L93 Difference]: Finished difference Result 480 states and 657 transitions. [2025-03-17 11:34:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:46,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 152 [2025-03-17 11:34:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:46,613 INFO L225 Difference]: With dead ends: 480 [2025-03-17 11:34:46,613 INFO L226 Difference]: Without dead ends: 480 [2025-03-17 11:34:46,613 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-03-17 11:34:46,614 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 30 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1001 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:34:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-17 11:34:46,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-17 11:34:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 461 states have (on average 1.3644251626898047) internal successors, (629), 473 states have internal predecessors, (629), 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-03-17 11:34:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 657 transitions. [2025-03-17 11:34:46,627 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 657 transitions. Word has length 152 [2025-03-17 11:34:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:46,628 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 657 transitions. [2025-03-17 11:34:46,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 657 transitions. [2025-03-17 11:34:46,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 11:34:46,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:46,630 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] [2025-03-17 11:34:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:34:46,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1157229267, now seen corresponding path program 1 times [2025-03-17 11:34:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930425704] [2025-03-17 11:34:46,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:46,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:46,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 11:34:46,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 11:34:46,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:46,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:46,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:46,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930425704] [2025-03-17 11:34:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930425704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:46,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:46,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:34:46,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499593124] [2025-03-17 11:34:46,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:34:46,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:46,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:34:46,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:34:46,867 INFO L87 Difference]: Start difference. First operand 480 states and 657 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:47,195 INFO L93 Difference]: Finished difference Result 562 states and 763 transitions. [2025-03-17 11:34:47,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:34:47,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 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 152 [2025-03-17 11:34:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:47,198 INFO L225 Difference]: With dead ends: 562 [2025-03-17 11:34:47,198 INFO L226 Difference]: Without dead ends: 562 [2025-03-17 11:34:47,198 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-03-17 11:34:47,200 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 1092 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:47,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 878 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-17 11:34:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 379. [2025-03-17 11:34:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 365 states have (on average 1.3506849315068492) internal successors, (493), 372 states have internal predecessors, (493), 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-03-17 11:34:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 511 transitions. [2025-03-17 11:34:47,214 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 511 transitions. Word has length 152 [2025-03-17 11:34:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 511 transitions. [2025-03-17 11:34:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 511 transitions. [2025-03-17 11:34:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 11:34:47,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:47,217 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] [2025-03-17 11:34:47,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:34:47,217 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:47,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:47,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1617856475, now seen corresponding path program 1 times [2025-03-17 11:34:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612378172] [2025-03-17 11:34:47,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:47,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:34:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:34:47,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:47,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612378172] [2025-03-17 11:34:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612378172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:34:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910339443] [2025-03-17 11:34:47,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:47,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:47,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:34:47,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:34:48,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 11:34:48,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 11:34:48,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:48,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:48,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 11:34:48,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:34:48,118 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-03-17 11:34:48,308 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 23 treesize of output 3 [2025-03-17 11:34:48,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-17 11:34:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:48,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:34:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910339443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:34:48,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:34:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2025-03-17 11:34:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069163839] [2025-03-17 11:34:48,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:34:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:34:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:34:48,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:34:48,477 INFO L87 Difference]: Start difference. First operand 379 states and 511 transitions. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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-03-17 11:34:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:48,849 INFO L93 Difference]: Finished difference Result 1111 states and 1508 transitions. [2025-03-17 11:34:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:34:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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 162 [2025-03-17 11:34:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:48,853 INFO L225 Difference]: With dead ends: 1111 [2025-03-17 11:34:48,853 INFO L226 Difference]: Without dead ends: 1111 [2025-03-17 11:34:48,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 317 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:34:48,854 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 1543 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:48,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 2753 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2025-03-17 11:34:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 719. [2025-03-17 11:34:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 701 states have (on average 1.3452211126961484) internal successors, (943), 708 states have internal predecessors, (943), 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-03-17 11:34:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 967 transitions. [2025-03-17 11:34:48,867 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 967 transitions. Word has length 162 [2025-03-17 11:34:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 967 transitions. [2025-03-17 11:34:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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-03-17 11:34:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 967 transitions. [2025-03-17 11:34:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2025-03-17 11:34:48,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:48,870 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, 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] [2025-03-17 11:34:48,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:34:49,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:49,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:49,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1508333609, now seen corresponding path program 1 times [2025-03-17 11:34:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:49,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702612973] [2025-03-17 11:34:49,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:49,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-17 11:34:49,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-17 11:34:49,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:49,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702612973] [2025-03-17 11:34:51,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702612973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:34:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954316673] [2025-03-17 11:34:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:34:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:34:51,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:34:51,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:34:51,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 384 statements into 1 equivalence classes. [2025-03-17 11:34:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 384 of 384 statements. [2025-03-17 11:34:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:52,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:34:52,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:34:52,222 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-03-17 11:34:52,408 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 23 treesize of output 3 [2025-03-17 11:34:52,496 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 36 treesize of output 13 [2025-03-17 11:34:52,587 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 36 treesize of output 13 [2025-03-17 11:34:52,676 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 36 treesize of output 13 [2025-03-17 11:34:52,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-03-17 11:34:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:52,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:34:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:34:53,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954316673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:34:53,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:34:53,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 20 [2025-03-17 11:34:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194934697] [2025-03-17 11:34:53,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:34:53,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:34:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:53,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:34:53,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:34:53,125 INFO L87 Difference]: Start difference. First operand 719 states and 967 transitions. Second operand has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-03-17 11:34:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:53,811 INFO L93 Difference]: Finished difference Result 2329 states and 3173 transitions. [2025-03-17 11:34:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:34:53,811 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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 384 [2025-03-17 11:34:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:53,818 INFO L225 Difference]: With dead ends: 2329 [2025-03-17 11:34:53,819 INFO L226 Difference]: Without dead ends: 2329 [2025-03-17 11:34:53,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 761 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=223, Invalid=427, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:34:53,820 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 4113 mSDsluCounter, 3465 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4148 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:53,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4148 Valid, 3841 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:34:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-03-17 11:34:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1565. [2025-03-17 11:34:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1541 states have (on average 1.3439325113562621) internal successors, (2071), 1548 states have internal predecessors, (2071), 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-03-17 11:34:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2107 transitions. [2025-03-17 11:34:53,848 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2107 transitions. Word has length 384 [2025-03-17 11:34:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2107 transitions. [2025-03-17 11:34:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 38.4) internal successors, (768), 20 states have internal predecessors, (768), 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-03-17 11:34:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2107 transitions. [2025-03-17 11:34:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-17 11:34:53,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:53,861 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, 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] [2025-03-17 11:34:53,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:34:54,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 11:34:54,062 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:54,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash 510237489, now seen corresponding path program 2 times [2025-03-17 11:34:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475080263] [2025-03-17 11:34:54,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:34:54,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:54,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 828 statements into 2 equivalence classes. [2025-03-17 11:34:54,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 828 statements. [2025-03-17 11:34:54,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:34:54,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:34:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475080263] [2025-03-17 11:34:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475080263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:34:54,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399133682] [2025-03-17 11:34:54,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:54,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:34:54,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:54,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:34:54,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:34:54,409 INFO L87 Difference]: Start difference. First operand 1565 states and 2107 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:54,732 INFO L93 Difference]: Finished difference Result 1605 states and 2162 transitions. [2025-03-17 11:34:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:34:54,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 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 828 [2025-03-17 11:34:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:54,738 INFO L225 Difference]: With dead ends: 1605 [2025-03-17 11:34:54,738 INFO L226 Difference]: Without dead ends: 1605 [2025-03-17 11:34:54,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:34:54,738 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 80 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1572 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:34:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-17 11:34:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1567. [2025-03-17 11:34:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1543 states have (on average 1.3434867141931304) internal successors, (2073), 1550 states have internal predecessors, (2073), 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-03-17 11:34:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2109 transitions. [2025-03-17 11:34:54,761 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2109 transitions. Word has length 828 [2025-03-17 11:34:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:54,762 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2109 transitions. [2025-03-17 11:34:54,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2109 transitions. [2025-03-17 11:34:54,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-17 11:34:54,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:54,775 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, 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] [2025-03-17 11:34:54,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:34:54,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:54,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:54,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1154272204, now seen corresponding path program 1 times [2025-03-17 11:34:54,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:54,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804992365] [2025-03-17 11:34:54,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:54,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:54,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 829 statements into 1 equivalence classes. [2025-03-17 11:34:55,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 829 of 829 statements. [2025-03-17 11:34:55,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:55,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:34:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804992365] [2025-03-17 11:34:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804992365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:56,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:56,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:34:56,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524299845] [2025-03-17 11:34:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:56,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:34:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:56,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:34:56,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:34:56,564 INFO L87 Difference]: Start difference. First operand 1567 states and 2109 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:56,836 INFO L93 Difference]: Finished difference Result 1572 states and 2115 transitions. [2025-03-17 11:34:56,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:34:56,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 829 [2025-03-17 11:34:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:56,844 INFO L225 Difference]: With dead ends: 1572 [2025-03-17 11:34:56,845 INFO L226 Difference]: Without dead ends: 1572 [2025-03-17 11:34:56,845 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-03-17 11:34:56,845 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 14 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:56,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1457 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:34:56,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-17 11:34:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1571. [2025-03-17 11:34:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1547 states have (on average 1.3432449903038137) internal successors, (2078), 1554 states have internal predecessors, (2078), 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-03-17 11:34:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2114 transitions. [2025-03-17 11:34:56,868 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2114 transitions. Word has length 829 [2025-03-17 11:34:56,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:56,869 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2114 transitions. [2025-03-17 11:34:56,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2114 transitions. [2025-03-17 11:34:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-17 11:34:56,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:56,876 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, 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-03-17 11:34:56,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:34:56,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:56,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:56,876 INFO L85 PathProgramCache]: Analyzing trace with hash -652535816, now seen corresponding path program 1 times [2025-03-17 11:34:56,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:56,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822830314] [2025-03-17 11:34:56,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:56,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:57,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-17 11:34:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-17 11:34:57,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:34:57,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:34:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-17 11:34:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:34:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822830314] [2025-03-17 11:34:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822830314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:34:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:34:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:34:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042905811] [2025-03-17 11:34:58,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:34:58,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:34:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:34:58,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:34:58,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:34:58,773 INFO L87 Difference]: Start difference. First operand 1571 states and 2114 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:34:59,216 INFO L93 Difference]: Finished difference Result 1582 states and 2127 transitions. [2025-03-17 11:34:59,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:34:59,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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 830 [2025-03-17 11:34:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:34:59,221 INFO L225 Difference]: With dead ends: 1582 [2025-03-17 11:34:59,222 INFO L226 Difference]: Without dead ends: 1582 [2025-03-17 11:34:59,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 11:34:59,222 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 31 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:34:59,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2392 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:34:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-17 11:34:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1579. [2025-03-17 11:34:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1555 states have (on average 1.342122186495177) internal successors, (2087), 1562 states have internal predecessors, (2087), 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-03-17 11:34:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2123 transitions. [2025-03-17 11:34:59,242 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2123 transitions. Word has length 830 [2025-03-17 11:34:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:34:59,243 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2123 transitions. [2025-03-17 11:34:59,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:34:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2123 transitions. [2025-03-17 11:34:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-17 11:34:59,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:34:59,248 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, 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-03-17 11:34:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:34:59,248 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:34:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:34:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1250355525, now seen corresponding path program 1 times [2025-03-17 11:34:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:34:59,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557898275] [2025-03-17 11:34:59,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:34:59,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:34:59,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes.