./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:43:34,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:43:34,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:43:34,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:43:34,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:43:34,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:43:34,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:43:34,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:43:34,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:43:34,342 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:43:34,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:43:34,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:43:34,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:43:34,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:43:34,343 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:43:34,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:43:34,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:34,345 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:43:34,345 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2025-02-08 06:43:34,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:43:34,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:43:34,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:43:34,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:43:34,531 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:43:34,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2025-02-08 06:43:35,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35f92ccb0/0b1e2895241041a785ba1906ccfa54b6/FLAG7c96e0988 [2025-02-08 06:43:36,014 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:43:36,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2025-02-08 06:43:36,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35f92ccb0/0b1e2895241041a785ba1906ccfa54b6/FLAG7c96e0988 [2025-02-08 06:43:36,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35f92ccb0/0b1e2895241041a785ba1906ccfa54b6 [2025-02-08 06:43:36,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:43:36,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:43:36,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:36,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:43:36,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:43:36,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36afc31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36, skipping insertion in model container [2025-02-08 06:43:36,038 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:43:36,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:36,252 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:43:36,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:36,294 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:43:36,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36 WrapperNode [2025-02-08 06:43:36,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:36,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:36,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:43:36,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:43:36,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,344 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-02-08 06:43:36,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:36,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:43:36,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:43:36,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:43:36,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,377 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-02-08 06:43:36,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,384 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:43:36,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:43:36,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:43:36,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:43:36,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (1/1) ... [2025-02-08 06:43:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:36,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:36,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:43:36,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:43:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:43:36,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:43:36,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:43:36,557 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:43:36,563 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:43:36,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: assume main_~expected~0#1 != main_#t~ret16#1;havoc main_#t~ret16#1; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: assume !(main_~expected~0#1 != main_#t~ret16#1);havoc main_#t~ret16#1;havoc main_~expected~0#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc sll_circular_get_data_at_#t~mem11#1;main_#t~ret16#1 := sll_circular_get_data_at_#res#1;havoc sll_circular_get_data_at_#t~mem9#1.base, sll_circular_get_data_at_#t~mem9#1.offset, sll_circular_get_data_at_#t~post10#1, sll_circular_get_data_at_#t~mem11#1, sll_circular_get_data_at_~head#1.base, sll_circular_get_data_at_~head#1.offset, sll_circular_get_data_at_~index#1;havoc sll_circular_get_data_at_#in~head#1.base, sll_circular_get_data_at_#in~head#1.offset, sll_circular_get_data_at_#in~index#1;assume { :end_inline_sll_circular_get_data_at } true;assume -2147483648 <= main_#t~ret16#1 && main_#t~ret16#1 <= 2147483647; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L637: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1; [2025-02-08 06:43:36,765 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L637-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:43:36,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:43:36,806 INFO L? ?]: Removed 95 outVars from TransFormulas that were not future-live. [2025-02-08 06:43:36,806 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:43:36,814 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:43:36,814 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:43:36,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:36 BoogieIcfgContainer [2025-02-08 06:43:36,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:43:36,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:43:36,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:43:36,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:43:36,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:43:36" (1/3) ... [2025-02-08 06:43:36,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fd6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:36, skipping insertion in model container [2025-02-08 06:43:36,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:36" (2/3) ... [2025-02-08 06:43:36,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fd6a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:36, skipping insertion in model container [2025-02-08 06:43:36,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:36" (3/3) ... [2025-02-08 06:43:36,822 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2025-02-08 06:43:36,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:43:36,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_update_all.i that has 2 procedures, 74 locations, 1 initial locations, 6 loop locations, and 28 error locations. [2025-02-08 06:43:36,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:43:36,874 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;@6a3b8561, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:43:36,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-08 06:43:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 41 states have (on average 1.853658536585366) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:43:36,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:36,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:43:36,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:36,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:36,888 INFO L85 PathProgramCache]: Analyzing trace with hash 105492870, now seen corresponding path program 1 times [2025-02-08 06:43:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472776049] [2025-02-08 06:43:36,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:36,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:36,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:43:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:43:36,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:36,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:37,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472776049] [2025-02-08 06:43:37,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472776049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:37,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:37,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526765919] [2025-02-08 06:43:37,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:37,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:37,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:37,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,071 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.853658536585366) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:37,131 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2025-02-08 06:43:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:37,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:43:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:37,137 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:43:37,137 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:43:37,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,141 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:37,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:43:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-08 06:43:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 63 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2025-02-08 06:43:37,175 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 5 [2025-02-08 06:43:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2025-02-08 06:43:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2025-02-08 06:43:37,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:43:37,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:37,176 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:43:37,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:43:37,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:37,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash 105492871, now seen corresponding path program 1 times [2025-02-08 06:43:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382666873] [2025-02-08 06:43:37,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:37,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:43:37,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:43:37,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382666873] [2025-02-08 06:43:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382666873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:37,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132718002] [2025-02-08 06:43:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:37,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:37,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,312 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:37,346 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2025-02-08 06:43:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:37,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:43:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:37,347 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:43:37,347 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 06:43:37,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,347 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:37,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 06:43:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 06:43:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-02-08 06:43:37,351 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 5 [2025-02-08 06:43:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:37,351 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-02-08 06:43:37,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-02-08 06:43:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:43:37,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:37,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:37,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:43:37,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1703310333, now seen corresponding path program 1 times [2025-02-08 06:43:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-02-08 06:43:37,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:37,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:43:37,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:43:37,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672135632] [2025-02-08 06:43:37,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672135632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:37,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:37,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:43:37,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780069766] [2025-02-08 06:43:37,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:37,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:37,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:37,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,440 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:37,450 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-02-08 06:43:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:37,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:43:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:37,451 INFO L225 Difference]: With dead ends: 72 [2025-02-08 06:43:37,451 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 06:43:37,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:37,452 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 5 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:37,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:37,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 06:43:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-02-08 06:43:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.7) internal successors, (68), 62 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-02-08 06:43:37,457 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 12 [2025-02-08 06:43:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:37,457 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-02-08 06:43:37,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-02-08 06:43:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:43:37,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:37,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:37,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:43:37,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:37,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1813233955, now seen corresponding path program 1 times [2025-02-08 06:43:37,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:37,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-02-08 06:43:37,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:37,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:43:37,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:43:37,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934224374] [2025-02-08 06:43:37,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934224374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:37,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:37,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:37,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470126611] [2025-02-08 06:43:37,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:37,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:37,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:37,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:37,567 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:37,642 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2025-02-08 06:43:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-08 06:43:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:37,643 INFO L225 Difference]: With dead ends: 65 [2025-02-08 06:43:37,643 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 06:43:37,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:37,644 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:37,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 219 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 06:43:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-08 06:43:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.675) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2025-02-08 06:43:37,651 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 21 [2025-02-08 06:43:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:37,651 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2025-02-08 06:43:37,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2025-02-08 06:43:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:43:37,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:37,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:43:37,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:37,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1813233954, now seen corresponding path program 1 times [2025-02-08 06:43:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 06:43:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:37,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:43:37,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:43:37,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582901109] [2025-02-08 06:43:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582901109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201652749] [2025-02-08 06:43:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:37,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:37,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:37,882 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:37,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:37,950 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-02-08 06:43:37,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:37,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-08 06:43:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:37,951 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:43:37,952 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:43:37,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:37,953 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:37,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 239 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:43:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-02-08 06:43:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.65) internal successors, (66), 60 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2025-02-08 06:43:37,958 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 21 [2025-02-08 06:43:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2025-02-08 06:43:37,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2025-02-08 06:43:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:43:37,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:37,959 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:37,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:43:37,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:37,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:37,960 INFO L85 PathProgramCache]: Analyzing trace with hash -249031679, now seen corresponding path program 1 times [2025-02-08 06:43:37,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:37,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443377090] [2025-02-08 06:43:37,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:37,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:37,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:38,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443377090] [2025-02-08 06:43:38,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443377090] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:38,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967868610] [2025-02-08 06:43:38,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:38,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:43:38,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:38,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:38,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:38,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:43:38,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:38,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 06:43:38,347 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:43:38,370 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:43:38,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:43:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:43:38,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967868610] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:38,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2025-02-08 06:43:38,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700621824] [2025-02-08 06:43:38,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:43:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:38,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:43:38,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:43:38,533 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:38,666 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2025-02-08 06:43:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:43:38,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2025-02-08 06:43:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:38,667 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:43:38,667 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:43:38,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2025-02-08 06:43:38,667 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:38,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2025-02-08 06:43:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:43:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-02-08 06:43:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.625) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2025-02-08 06:43:38,670 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2025-02-08 06:43:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:38,670 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2025-02-08 06:43:38,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2025-02-08 06:43:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:43:38,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:38,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:38,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:43:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:38,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:38,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash -249031678, now seen corresponding path program 1 times [2025-02-08 06:43:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-02-08 06:43:38,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:38,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:38,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:39,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247230793] [2025-02-08 06:43:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247230793] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:39,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340098748] [2025-02-08 06:43:39,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:39,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:39,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:39,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:43:39,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:39,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:39,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:39,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:39,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:43:39,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:39,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-02-08 06:43:39,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 06:43:39,413 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:43:39,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:39,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:39,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:39,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:43:39,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340098748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:39,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-02-08 06:43:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672067917] [2025-02-08 06:43:39,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:39,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:43:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:39,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:43:39,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2025-02-08 06:43:39,606 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:39,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:39,837 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2025-02-08 06:43:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:43:39,838 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-02-08 06:43:39,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:39,841 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:43:39,842 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:43:39,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:43:39,842 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:39,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2025-02-08 06:43:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:43:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-02-08 06:43:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-02-08 06:43:39,848 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2025-02-08 06:43:39,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:39,848 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-02-08 06:43:39,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 12 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-02-08 06:43:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:43:39,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:39,848 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:39,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:43:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:40,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 924651640, now seen corresponding path program 1 times [2025-02-08 06:43:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-08 06:43:40,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:43:40,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:43:40,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739129655] [2025-02-08 06:43:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739129655] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:43:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384817318] [2025-02-08 06:43:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:43:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:43:40,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:43:40,214 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,339 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-02-08 06:43:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:43:40,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 06:43:40,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,340 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:43:40,340 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:43:40,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:40,341 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 279 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:43:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-08 06:43:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.627906976744186) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-02-08 06:43:40,344 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 28 [2025-02-08 06:43:40,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,344 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-02-08 06:43:40,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,344 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-02-08 06:43:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:43:40,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,345 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:43:40,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 924651641, now seen corresponding path program 1 times [2025-02-08 06:43:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280296098] [2025-02-08 06:43:40,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:43:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:43:40,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280296098] [2025-02-08 06:43:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280296098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:43:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066207746] [2025-02-08 06:43:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:43:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:43:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:43:40,531 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,645 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-02-08 06:43:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:43:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-08 06:43:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,646 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:43:40,646 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:43:40,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:40,647 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 326 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:43:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-08 06:43:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 61 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-02-08 06:43:40,649 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 28 [2025-02-08 06:43:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,650 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-02-08 06:43:40,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,650 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-02-08 06:43:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:43:40,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:43:40,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1400926514, now seen corresponding path program 1 times [2025-02-08 06:43:40,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-08 06:43:40,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:43:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:43:40,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730467196] [2025-02-08 06:43:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730467196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:43:40,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096981904] [2025-02-08 06:43:40,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:43:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:43:40,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:43:40,697 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,710 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-02-08 06:43:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:43:40,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2025-02-08 06:43:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,711 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:43:40,711 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 06:43:40,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:43:40,711 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 06:43:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2025-02-08 06:43:40,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.4) internal successors, (42), 37 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-08 06:43:40,713 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2025-02-08 06:43:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,714 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-08 06:43:40,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-08 06:43:40,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:43:40,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:43:40,715 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1624004712, now seen corresponding path program 1 times [2025-02-08 06:43:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140975786] [2025-02-08 06:43:40,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:43:40,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:43:40,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:40,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140975786] [2025-02-08 06:43:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140975786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:43:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937570924] [2025-02-08 06:43:40,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:43:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:43:40,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:43:40,762 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,775 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-02-08 06:43:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:43:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 31 [2025-02-08 06:43:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,776 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:43:40,776 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:43:40,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:43:40,777 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 104 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:43:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-08 06:43:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-02-08 06:43:40,783 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2025-02-08 06:43:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,783 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-02-08 06:43:40,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-02-08 06:43:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:43:40,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:43:40,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -826406915, now seen corresponding path program 1 times [2025-02-08 06:43:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-02-08 06:43:40,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:43:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:43:40,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:43:40,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703300574] [2025-02-08 06:43:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703300574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:43:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733483572] [2025-02-08 06:43:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:43:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:43:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:43:40,855 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,864 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-02-08 06:43:40,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:43:40,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 33 [2025-02-08 06:43:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,865 INFO L225 Difference]: With dead ends: 40 [2025-02-08 06:43:40,865 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 06:43:40,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:43:40,866 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 06:43:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-02-08 06:43:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-02-08 06:43:40,869 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 33 [2025-02-08 06:43:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,870 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-02-08 06:43:40,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-02-08 06:43:40,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:43:40,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,871 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:43:40,871 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash -826406888, now seen corresponding path program 1 times [2025-02-08 06:43:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-02-08 06:43:40,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:43:40,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:43:40,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-02-08 06:43:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875330879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:40,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:40,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:43:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571637744] [2025-02-08 06:43:40,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:40,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:43:40,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:40,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:43:40,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:43:40,940 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,974 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2025-02-08 06:43:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:40,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 33 [2025-02-08 06:43:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,974 INFO L225 Difference]: With dead ends: 38 [2025-02-08 06:43:40,975 INFO L226 Difference]: Without dead ends: 38 [2025-02-08 06:43:40,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:40,975 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-02-08 06:43:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2025-02-08 06:43:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-02-08 06:43:40,979 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 33 [2025-02-08 06:43:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,979 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-02-08 06:43:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-02-08 06:43:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:43:40,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:40,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:43:40,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:40,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash -826406887, now seen corresponding path program 1 times [2025-02-08 06:43:40,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414773904] [2025-02-08 06:43:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:43:41,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:43:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:41,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414773904] [2025-02-08 06:43:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414773904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70095627] [2025-02-08 06:43:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:41,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:41,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:41,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:41,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:43:41,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:43:41,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:43:41,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:41,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:41,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:43:41,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:41,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:43:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70095627] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:41,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 06:43:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890939036] [2025-02-08 06:43:41,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:43:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:41,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:43:41,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:41,227 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:41,261 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2025-02-08 06:43:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:43:41,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-08 06:43:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:41,262 INFO L225 Difference]: With dead ends: 40 [2025-02-08 06:43:41,262 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 06:43:41,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:41,262 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:41,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:41,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 06:43:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 06:43:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:43:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-02-08 06:43:41,264 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 33 [2025-02-08 06:43:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:41,264 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-02-08 06:43:41,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-02-08 06:43:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:43:41,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:41,264 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:41,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:41,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:41,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:41,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 716340086, now seen corresponding path program 1 times [2025-02-08 06:43:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-02-08 06:43:41,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:41,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:41,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:41,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:41,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063668488] [2025-02-08 06:43:41,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063668488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:41,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369938071] [2025-02-08 06:43:41,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:41,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:41,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:41,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:41,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:43:41,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:42,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:42,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:42,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:42,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 06:43:42,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:42,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 06:43:42,091 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:42,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:42,203 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:42,204 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:43:42,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:42,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-08 06:43:42,331 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 25 treesize of output 13 [2025-02-08 06:43:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:42,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:42,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_660 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_660 .cse0))))))) is different from false [2025-02-08 06:43:42,417 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-08 06:43:42,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-08 06:43:42,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:42,492 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 06:43:42,499 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 30 treesize of output 22 [2025-02-08 06:43:42,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-08 06:43:42,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369938071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:42,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:42,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2025-02-08 06:43:42,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553357204] [2025-02-08 06:43:42,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:42,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:43:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:42,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:43:42,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1021, Unknown=18, NotChecked=64, Total=1190 [2025-02-08 06:43:42,579 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:43,004 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-02-08 06:43:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:43:43,005 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-08 06:43:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:43,006 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:43:43,006 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:43:43,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=1495, Unknown=18, NotChecked=78, Total=1722 [2025-02-08 06:43:43,008 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:43,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 318 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:43:43,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:43:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-02-08 06:43:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 56 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-02-08 06:43:43,012 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 35 [2025-02-08 06:43:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:43,013 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-02-08 06:43:43,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2025-02-08 06:43:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:43:43,013 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:43,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:43,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:43:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:43:43,214 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:43,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:43,215 INFO L85 PathProgramCache]: Analyzing trace with hash 716340087, now seen corresponding path program 1 times [2025-02-08 06:43:43,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:43,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352233517] [2025-02-08 06:43:43,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:43,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352233517] [2025-02-08 06:43:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352233517] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130342628] [2025-02-08 06:43:44,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:44,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:44,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:44,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:43:44,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:44,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:44,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:44,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:44,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 06:43:44,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:44,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2025-02-08 06:43:44,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 06:43:44,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:43:44,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:43:44,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:44,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:44,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:44,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:44,640 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:44,641 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 06:43:44,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:43:44,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:44,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:43:44,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:44,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-08 06:43:44,855 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 25 treesize of output 13 [2025-02-08 06:43:44,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:43:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:44,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:45,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_762 (Array Int Int))) (or (not (= v_ArrVal_762 (store .cse0 .cse1 (select v_ArrVal_762 .cse1)))) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_761 (Array Int Int))) (or (forall ((v_ArrVal_762 (Array Int Int))) (or (not (= v_ArrVal_762 (store .cse0 .cse1 (select v_ArrVal_762 .cse1)))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_762) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_761) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= v_ArrVal_761 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_761 .cse1)))))))) is different from false [2025-02-08 06:43:45,259 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_759 (Array Int Int)) (v_ArrVal_760 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_759) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_760 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_760) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2025-02-08 06:43:45,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:45,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-02-08 06:43:45,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:45,354 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-08 06:43:45,357 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 52 treesize of output 44 [2025-02-08 06:43:45,359 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 82 treesize of output 70 [2025-02-08 06:43:45,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 9 [2025-02-08 06:43:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2025-02-08 06:43:45,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:45,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-02-08 06:43:45,373 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:43:45,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 06:43:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130342628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:45,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2025-02-08 06:43:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477711095] [2025-02-08 06:43:45,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:45,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-08 06:43:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:45,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-08 06:43:45,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1914, Unknown=29, NotChecked=178, Total=2256 [2025-02-08 06:43:45,550 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 37 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:46,147 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2025-02-08 06:43:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:43:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2025-02-08 06:43:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:46,149 INFO L225 Difference]: With dead ends: 80 [2025-02-08 06:43:46,149 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 06:43:46,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=2543, Unknown=29, NotChecked=206, Total=2970 [2025-02-08 06:43:46,150 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 361 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:43:46,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 06:43:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-02-08 06:43:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 63 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-02-08 06:43:46,153 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 35 [2025-02-08 06:43:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:46,153 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-02-08 06:43:46,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 32 states have internal predecessors, (61), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-02-08 06:43:46,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:43:46,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:46,154 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:46,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:43:46,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 06:43:46,358 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:46,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1977048183, now seen corresponding path program 2 times [2025-02-08 06:43:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-02-08 06:43:46,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:46,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-08 06:43:46,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 37 statements. [2025-02-08 06:43:46,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 06:43:46,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:43:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249493946] [2025-02-08 06:43:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249493946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:43:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468824238] [2025-02-08 06:43:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:46,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:43:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:46,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:43:46,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:43:46,505 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:46,581 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-02-08 06:43:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:43:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-02-08 06:43:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:46,582 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:43:46,582 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:43:46,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:43:46,582 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:46,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:43:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-02-08 06:43:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2025-02-08 06:43:46,584 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 37 [2025-02-08 06:43:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:46,584 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2025-02-08 06:43:46,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2025-02-08 06:43:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:43:46,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:46,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:46,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:43:46,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:46,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1205767206, now seen corresponding path program 2 times [2025-02-08 06:43:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:46,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-02-08 06:43:46,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:46,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 06:43:46,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:43:46,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:46,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:43:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148206422] [2025-02-08 06:43:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148206422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428168890] [2025-02-08 06:43:46,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:46,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:46,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:43:46,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 06:43:46,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:43:46,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:46,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:46,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:43:46,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:43:46,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:43:46,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428168890] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:43:46,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:43:46,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-02-08 06:43:46,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166412789] [2025-02-08 06:43:46,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:46,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:46,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:46,855 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:46,897 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2025-02-08 06:43:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:43:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-02-08 06:43:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:46,901 INFO L225 Difference]: With dead ends: 54 [2025-02-08 06:43:46,901 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:43:46,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:43:46,901 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:46,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:43:46,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 06:43:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-02-08 06:43:46,903 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 38 [2025-02-08 06:43:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:46,903 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-08 06:43:46,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:43:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-02-08 06:43:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:43:46,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:46,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:46,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:47,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:43:47,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:47,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1132222136, now seen corresponding path program 3 times [2025-02-08 06:43:47,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:47,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-02-08 06:43:47,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:43:47,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:47,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-02-08 06:43:47,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:43:47,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:43:47,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:43:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-02-08 06:43:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790998] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903930728] [2025-02-08 06:43:47,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:43:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:47,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:47,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:43:47,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-02-08 06:43:47,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:43:47,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:43:47,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:47,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:43:47,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:43:47,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:43:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903930728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:43:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-08 06:43:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631882211] [2025-02-08 06:43:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:47,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:47,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:47,451 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:47,463 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2025-02-08 06:43:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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 42 [2025-02-08 06:43:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:47,463 INFO L225 Difference]: With dead ends: 55 [2025-02-08 06:43:47,463 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 06:43:47,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:43:47,464 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:47,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 06:43:47,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 06:43:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-02-08 06:43:47,465 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 42 [2025-02-08 06:43:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:47,465 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-02-08 06:43:47,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-02-08 06:43:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:43:47,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:47,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:47,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:47,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:47,666 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 54728434, now seen corresponding path program 4 times [2025-02-08 06:43:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-02-08 06:43:47,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:43:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:47,681 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:43:47,691 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 47 statements. [2025-02-08 06:43:47,691 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:43:47,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:48,302 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:48,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:48,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826684702] [2025-02-08 06:43:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826684702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:48,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920237821] [2025-02-08 06:43:48,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 06:43:48,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:48,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:48,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:48,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:43:48,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:43:48,427 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 46 of 47 statements. [2025-02-08 06:43:48,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 06:43:48,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:48,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-08 06:43:48,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:48,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 06:43:48,524 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:43:48,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:43:48,699 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2025-02-08 06:43:48,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2025-02-08 06:43:48,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:43:48,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-02-08 06:43:49,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:49,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-08 06:43:49,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 06:43:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:43:49,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:49,200 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_1151 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1151 .cse0))))))) is different from false [2025-02-08 06:43:49,299 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1150 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1150) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2025-02-08 06:43:49,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:49,304 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-02-08 06:43:49,306 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 34 treesize of output 26 [2025-02-08 06:43:49,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2025-02-08 06:43:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920237821] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:49,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2025-02-08 06:43:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751915232] [2025-02-08 06:43:49,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 06:43:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:49,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 06:43:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2367, Unknown=14, NotChecked=198, Total=2756 [2025-02-08 06:43:49,504 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 39 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:43:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:50,144 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-02-08 06:43:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:43:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 39 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 47 [2025-02-08 06:43:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:50,145 INFO L225 Difference]: With dead ends: 34 [2025-02-08 06:43:50,145 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 06:43:50,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=299, Invalid=3726, Unknown=15, NotChecked=250, Total=4290 [2025-02-08 06:43:50,146 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:50,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 201 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:43:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 06:43:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-08 06:43:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2025-02-08 06:43:50,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 47 [2025-02-08 06:43:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:50,148 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2025-02-08 06:43:50,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 39 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:43:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2025-02-08 06:43:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:43:50,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:50,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:50,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:50,352 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-08 06:43:50,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 54728435, now seen corresponding path program 2 times [2025-02-08 06:43:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:50,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-02-08 06:43:50,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:50,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:43:50,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:43:50,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:50,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 06:43:50,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:50,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-02-08 06:43:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599633567] [2025-02-08 06:43:50,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:50,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:50,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:50,411 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:43:50,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:43:50,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:43:50,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:50,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:43:50,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:43:50,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:43:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599633567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:43:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:43:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765975068] [2025-02-08 06:43:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:43:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:50,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:43:50,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:43:50,563 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:50,570 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-08 06:43:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:43:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-08 06:43:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:50,570 INFO L225 Difference]: With dead ends: 16 [2025-02-08 06:43:50,570 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:43:50,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:43:50,571 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:50,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:43:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:43:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:43:50,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-02-08 06:43:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:50,572 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:43:50,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:43:50,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:43:50,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (27 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (26 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (25 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (24 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (23 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (22 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (21 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (20 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2025-02-08 06:43:50,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2025-02-08 06:43:50,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2025-02-08 06:43:50,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:50,781 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:50,783 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:43:50,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:43:50 BoogieIcfgContainer [2025-02-08 06:43:50,786 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:43:50,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:43:50,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:43:50,786 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:43:50,787 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:36" (3/4) ... [2025-02-08 06:43:50,789 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:43:50,793 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure node_create [2025-02-08 06:43:50,797 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 06:43:50,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-08 06:43:50,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 06:43:50,798 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:43:50,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:43:50,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:43:50,861 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:43:50,862 INFO L158 Benchmark]: Toolchain (without parser) took 14827.73ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.5MB in the beginning and 188.5MB in the end (delta: -77.0MB). Peak memory consumption was 72.1MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,862 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:43:50,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.45ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.26ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:43:50,862 INFO L158 Benchmark]: Boogie Preprocessor took 45.75ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,863 INFO L158 Benchmark]: IcfgBuilder took 419.15ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 69.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,864 INFO L158 Benchmark]: TraceAbstraction took 13968.89ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 68.8MB in the beginning and 196.3MB in the end (delta: -127.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,864 INFO L158 Benchmark]: Witness Printer took 74.92ms. Allocated memory is still 293.6MB. Free memory was 196.3MB in the beginning and 188.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:43:50,865 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.45ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.0MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.26ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.75ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 90.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 419.15ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 69.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13968.89ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 68.8MB in the beginning and 196.3MB in the end (delta: -127.5MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 74.92ms. Allocated memory is still 293.6MB. Free memory was 196.3MB in the beginning and 188.5MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 603]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 600]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 3827 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 126 IncrementalHoareTripleChecker+Unchecked, 2976 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3428 IncrementalHoareTripleChecker+Invalid, 3595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 851 mSDtfsCounter, 3428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 400 SyntacticMatches, 11 SemanticMatches, 258 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 54 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 933 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 995 ConstructedInterpolants, 30 QuantifiedInterpolants, 5454 SizeOfPredicates, 22 NumberOfNonLiveVariables, 2734 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 322/438 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:43:50,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE