./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_remove_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/dll2c_remove_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 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:40:41,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:40:42,001 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:40:42,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:40:42,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:40:42,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:40:42,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:40:42,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:40:42,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:40:42,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:40:42,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:40:42,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:40:42,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:40:42,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:40:42,019 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:40:42,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:40:42,020 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:40:42,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:40:42,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:42,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:40:42,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:40:42,026 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 -> 6c2ed91303515fb47ae50633bb4ba0c83e07781b13d03a95e0e32251f9fc3016 [2025-02-08 06:40:42,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:40:42,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:40:42,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:40:42,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:40:42,248 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:40:42,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_remove_all.i [2025-02-08 06:40:43,400 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df6f49d6/d418df204b2147ee9b95ad3b55e37236/FLAGc600393ab [2025-02-08 06:40:43,707 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:40:43,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_remove_all.i [2025-02-08 06:40:43,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df6f49d6/d418df204b2147ee9b95ad3b55e37236/FLAGc600393ab [2025-02-08 06:40:43,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7df6f49d6/d418df204b2147ee9b95ad3b55e37236 [2025-02-08 06:40:43,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:40:43,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:40:43,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:43,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:40:43,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:40:43,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:43" (1/1) ... [2025-02-08 06:40:43,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4215dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:43, skipping insertion in model container [2025-02-08 06:40:43,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:40:43" (1/1) ... [2025-02-08 06:40:44,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:40:44,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:44,216 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:40:44,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:40:44,269 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:40:44,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44 WrapperNode [2025-02-08 06:40:44,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:40:44,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:44,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:40:44,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:40:44,277 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:40:44" (1/1) ... [2025-02-08 06:40:44,284 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:40:44" (1/1) ... [2025-02-08 06:40:44,299 INFO L138 Inliner]: procedures = 126, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2025-02-08 06:40:44,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:40:44,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:40:44,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:40:44,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:40:44,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,329 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 9, 11]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 11 writes are split as follows [0, 2, 9]. [2025-02-08 06:40:44,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,342 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:40:44,353 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:40:44,353 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:40:44,353 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:40:44,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (1/1) ... [2025-02-08 06:40:44,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:40:44,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:44,383 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:40:44,388 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:40:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:40:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:40:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:40:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:40:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:40:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:40:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:40:44,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:40:44,504 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:40:44,505 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:40:44,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: 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;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:40:44,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L627-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:40:44,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:40:44,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:40:44,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:40:44,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:40:44,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L617: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:40:44,751 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:40:44,765 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-02-08 06:40:44,765 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:40:44,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:40:44,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:40:44,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:44 BoogieIcfgContainer [2025-02-08 06:40:44,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:40:44,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:40:44,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:40:44,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:40:44,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:40:43" (1/3) ... [2025-02-08 06:40:44,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2ee791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:44, skipping insertion in model container [2025-02-08 06:40:44,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:40:44" (2/3) ... [2025-02-08 06:40:44,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2ee791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:40:44, skipping insertion in model container [2025-02-08 06:40:44,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:40:44" (3/3) ... [2025-02-08 06:40:44,779 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2c_remove_all.i [2025-02-08 06:40:44,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:40:44,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2c_remove_all.i that has 2 procedures, 96 locations, 1 initial locations, 2 loop locations, and 46 error locations. [2025-02-08 06:40:44,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:40:44,823 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;@55027240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:40:44,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 06:40:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 92 states have internal predecessors, (96), 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:40:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:40:44,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:44,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:40:44,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:44,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:44,834 INFO L85 PathProgramCache]: Analyzing trace with hash 118945492, now seen corresponding path program 1 times [2025-02-08 06:40:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735516470] [2025-02-08 06:40:44,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:44,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:44,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:40:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:40:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:44,970 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:40:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735516470] [2025-02-08 06:40:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735516470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:44,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:44,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:44,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674023006] [2025-02-08 06:40:44,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:44,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:44,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:44,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:44,992 INFO L87 Difference]: Start difference. First operand has 96 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 92 states have internal predecessors, (96), 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:40:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:45,088 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2025-02-08 06:40:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:45,090 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:40:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:45,095 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:40:45,095 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:40:45,097 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:40:45,098 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:45,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 135 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:40:45,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 06:40:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 44 states have (on average 2.022727272727273) internal successors, (89), 85 states have internal predecessors, (89), 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:40:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2025-02-08 06:40:45,132 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 5 [2025-02-08 06:40:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:45,132 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2025-02-08 06:40:45,133 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:40:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2025-02-08 06:40:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:40:45,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:45,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:40:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:40:45,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 118945493, now seen corresponding path program 1 times [2025-02-08 06:40:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648685442] [2025-02-08 06:40:45,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:40:45,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:40:45,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:45,207 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:40:45,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:45,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648685442] [2025-02-08 06:40:45,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648685442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:45,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:40:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348033634] [2025-02-08 06:40:45,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:45,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:45,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:45,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:45,209 INFO L87 Difference]: Start difference. First operand 89 states and 93 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:40:45,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:45,264 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-02-08 06:40:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:45,264 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:40:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:45,265 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:40:45,265 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:40:45,265 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:40:45,265 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:45,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:40:45,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 06:40:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 82 states have internal predecessors, (86), 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:40:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-02-08 06:40:45,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 5 [2025-02-08 06:40:45,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:45,270 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-02-08 06:40:45,270 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:40:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-02-08 06:40:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:40:45,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:45,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:40:45,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -780302726, now seen corresponding path program 1 times [2025-02-08 06:40:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343527543] [2025-02-08 06:40:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:40:45,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:40:45,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:45,399 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:40:45,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:45,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343527543] [2025-02-08 06:40:45,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343527543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:45,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:45,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:40:45,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841644563] [2025-02-08 06:40:45,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:45,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:45,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:45,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:45,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:45,402 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:40:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:45,567 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2025-02-08 06:40:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-02-08 06:40:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:45,570 INFO L225 Difference]: With dead ends: 89 [2025-02-08 06:40:45,570 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:40:45,570 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:40:45,570 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:45,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 236 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:40:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-02-08 06:40:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 84 states have internal predecessors, (90), 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:40:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-02-08 06:40:45,578 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 13 [2025-02-08 06:40:45,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:45,578 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-02-08 06:40:45,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:40:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-02-08 06:40:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:40:45,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:45,581 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:45,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:40:45,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash -780302725, now seen corresponding path program 1 times [2025-02-08 06:40:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:45,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101831662] [2025-02-08 06:40:45,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:40:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:40:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:45,663 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:40:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:45,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101831662] [2025-02-08 06:40:45,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101831662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:45,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:45,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:40:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962392609] [2025-02-08 06:40:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:40:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:45,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:40:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:40:45,667 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:40:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:45,675 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-02-08 06:40:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:40:45,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2025-02-08 06:40:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:45,676 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:40:45,676 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:40:45,676 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:40:45,677 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:45,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:40:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:40:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 83 states have internal predecessors, (87), 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:40:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2025-02-08 06:40:45,681 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 13 [2025-02-08 06:40:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:45,681 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2025-02-08 06:40:45,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:40:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2025-02-08 06:40:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:45,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:45,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:40:45,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:45,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:45,682 INFO L85 PathProgramCache]: Analyzing trace with hash 278601689, now seen corresponding path program 1 times [2025-02-08 06:40:45,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:45,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213722007] [2025-02-08 06:40:45,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:40:45,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:40:45,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:45,821 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:40:45,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:45,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213722007] [2025-02-08 06:40:45,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213722007] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:45,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:45,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:40:45,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432208478] [2025-02-08 06:40:45,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:45,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:45,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:45,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:45,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:45,823 INFO L87 Difference]: Start difference. First operand 87 states and 91 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:40:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:45,932 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2025-02-08 06:40:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:45,932 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 23 [2025-02-08 06:40:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:45,933 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:40:45,933 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:40:45,933 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:40:45,934 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:45,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 232 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:40:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 06:40:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.9111111111111112) internal successors, (86), 82 states have internal predecessors, (86), 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:40:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2025-02-08 06:40:45,937 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 23 [2025-02-08 06:40:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:45,938 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2025-02-08 06:40:45,938 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:40:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2025-02-08 06:40:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:40:45,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:45,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:45,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:40:45,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:45,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:45,939 INFO L85 PathProgramCache]: Analyzing trace with hash 278601690, now seen corresponding path program 1 times [2025-02-08 06:40:45,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:45,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168923309] [2025-02-08 06:40:45,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:45,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:45,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:40:45,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:40:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:46,175 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:40:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168923309] [2025-02-08 06:40:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168923309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:40:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237870796] [2025-02-08 06:40:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:46,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:46,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:46,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:46,176 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:40:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:46,279 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-02-08 06:40:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 23 [2025-02-08 06:40:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:46,280 INFO L225 Difference]: With dead ends: 85 [2025-02-08 06:40:46,280 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:40:46,280 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:40:46,281 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 6 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:46,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 256 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:40:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 06:40:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.8888888888888888) internal successors, (85), 81 states have internal predecessors, (85), 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:40:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2025-02-08 06:40:46,284 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 23 [2025-02-08 06:40:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:46,284 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2025-02-08 06:40:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:40:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2025-02-08 06:40:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:40:46,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:46,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:46,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:40:46,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1448252470, now seen corresponding path program 1 times [2025-02-08 06:40:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366948396] [2025-02-08 06:40:46,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:46,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:46,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:46,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:46,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366948396] [2025-02-08 06:40:46,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366948396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:46,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86832883] [2025-02-08 06:40:46,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:46,591 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:40:46,592 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:40:46,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:46,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:46,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:46,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:46,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 06:40:46,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:46,746 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:40:46,803 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:40:46,803 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:40:46,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:46,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:47,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86832883] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:40:47,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:40:47,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-02-08 06:40:47,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644236005] [2025-02-08 06:40:47,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:47,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:40:47,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:47,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:40:47,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:40:47,144 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:47,424 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-02-08 06:40:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-02-08 06:40:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:47,425 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:40:47,425 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:40:47,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:40:47,426 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:47,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 385 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:40:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:40:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 85 states have internal predecessors, (91), 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:40:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-02-08 06:40:47,434 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 25 [2025-02-08 06:40:47,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:47,434 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-02-08 06:40:47,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.176470588235294) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-02-08 06:40:47,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:40:47,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:47,435 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:47,450 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:40:47,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:47,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:47,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:47,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1448252471, now seen corresponding path program 1 times [2025-02-08 06:40:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:47,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107851501] [2025-02-08 06:40:47,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:47,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:47,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107851501] [2025-02-08 06:40:47,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107851501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986559094] [2025-02-08 06:40:47,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:47,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:47,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:47,980 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:40:47,986 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:40:48,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:40:48,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:40:48,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:48,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:48,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:40:48,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:48,075 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:40:48,082 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:40:48,137 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:40:48,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:48,193 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:40:48,200 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:40:48,201 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:40:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:40:48,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986559094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:48,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2025-02-08 06:40:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525532658] [2025-02-08 06:40:48,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:40:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:48,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:40:48,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=127, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:40:48,299 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:40:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:48,559 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2025-02-08 06:40:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:40:48,559 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-02-08 06:40:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:48,560 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:40:48,560 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:40:48,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2025-02-08 06:40:48,561 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:48,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 89 Unchecked, 0.2s Time] [2025-02-08 06:40:48,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:40:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:40:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.836734693877551) internal successors, (90), 85 states have internal predecessors, (90), 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:40:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2025-02-08 06:40:48,571 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 25 [2025-02-08 06:40:48,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:48,571 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2025-02-08 06:40:48,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:40:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2025-02-08 06:40:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:40:48,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:48,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:48,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:40:48,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:48,772 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 201250533, now seen corresponding path program 1 times [2025-02-08 06:40:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612158554] [2025-02-08 06:40:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:48,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:48,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:40:48,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:40:48,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:48,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612158554] [2025-02-08 06:40:48,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612158554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:48,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561633359] [2025-02-08 06:40:48,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:48,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:48,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:48,919 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:40:48,927 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:40:49,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:40:49,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:40:49,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:49,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:49,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:40:49,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:49,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:49,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561633359] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:40:49,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:40:49,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-08 06:40:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214168605] [2025-02-08 06:40:49,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:49,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:49,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:49,072 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:49,107 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2025-02-08 06:40:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:49,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-02-08 06:40:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:49,108 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:40:49,108 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:40:49,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:40:49,108 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:49,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:40:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:40:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.816326530612245) internal successors, (89), 85 states have internal predecessors, (89), 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:40:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2025-02-08 06:40:49,112 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 27 [2025-02-08 06:40:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:49,112 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2025-02-08 06:40:49,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:40:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2025-02-08 06:40:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:40:49,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:49,112 INFO L218 NwaCegarLoop]: trace histogram [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:40:49,119 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:40:49,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:49,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:49,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1942894476, now seen corresponding path program 1 times [2025-02-08 06:40:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514322154] [2025-02-08 06:40:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:49,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:49,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:49,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:49,389 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:40:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514322154] [2025-02-08 06:40:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514322154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:49,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169990029] [2025-02-08 06:40:49,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:49,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:49,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:49,393 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:40:49,394 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:40:49,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:49,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:49,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:49,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:49,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:40:49,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:49,488 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:40:49,528 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:40:49,565 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:40:49,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:40:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2025-02-08 06:40:49,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169990029] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:49,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2025-02-08 06:40:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268353905] [2025-02-08 06:40:49,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:49,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:40:49,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:49,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:40:49,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:40:49,615 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:49,791 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2025-02-08 06:40:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:40:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-02-08 06:40:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:49,792 INFO L225 Difference]: With dead ends: 89 [2025-02-08 06:40:49,792 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:40:49,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:40:49,793 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 9 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:49,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 283 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2025-02-08 06:40:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:40:49,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 06:40:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 84 states have internal predecessors, (88), 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:40:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2025-02-08 06:40:49,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 28 [2025-02-08 06:40:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:49,796 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2025-02-08 06:40:49,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2025-02-08 06:40:49,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:40:49,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:49,797 INFO L218 NwaCegarLoop]: trace histogram [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:40:49,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:40:49,997 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,SelfDestructingSolverStorable9 [2025-02-08 06:40:49,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:49,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1942894477, now seen corresponding path program 1 times [2025-02-08 06:40:49,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:49,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099372008] [2025-02-08 06:40:49,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:49,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:50,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:50,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:50,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:50,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099372008] [2025-02-08 06:40:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099372008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586606977] [2025-02-08 06:40:50,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:50,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:50,153 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:40:50,155 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:40:50,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:40:50,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:40:50,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:50,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:50,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:40:50,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:50,267 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:40:50,270 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:40:50,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:40:50,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:50,446 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:40:50,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:40:50,452 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:40:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-02-08 06:40:50,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586606977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:50,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:50,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2025-02-08 06:40:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876820660] [2025-02-08 06:40:50,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:50,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:40:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:50,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:40:50,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:40:50,577 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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:40:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:50,814 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2025-02-08 06:40:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:40:50,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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 28 [2025-02-08 06:40:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:50,815 INFO L225 Difference]: With dead ends: 106 [2025-02-08 06:40:50,815 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 06:40:50,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:40:50,816 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 16 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:50,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 523 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2025-02-08 06:40:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 06:40:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2025-02-08 06:40:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 93 states have internal predecessors, (102), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2025-02-08 06:40:50,818 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 28 [2025-02-08 06:40:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:50,818 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2025-02-08 06:40:50,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 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:40:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2025-02-08 06:40:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:40:50,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:50,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:50,828 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:40:51,023 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,SelfDestructingSolverStorable10 [2025-02-08 06:40:51,023 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:51,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:51,024 INFO L85 PathProgramCache]: Analyzing trace with hash 100186655, now seen corresponding path program 1 times [2025-02-08 06:40:51,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:51,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464155563] [2025-02-08 06:40:51,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:40:51,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:40:51,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:51,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:40:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464155563] [2025-02-08 06:40:51,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464155563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:51,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:40:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862941081] [2025-02-08 06:40:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:51,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:40:51,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:51,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:40:51,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:51,106 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:40:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:51,227 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2025-02-08 06:40:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:51,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 29 [2025-02-08 06:40:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:51,228 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:40:51,228 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:40:51,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:51,229 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:51,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 259 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:40:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:40:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 92 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2025-02-08 06:40:51,232 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 29 [2025-02-08 06:40:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:51,232 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2025-02-08 06:40:51,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:40:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2025-02-08 06:40:51,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:40:51,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:51,233 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:51,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:40:51,235 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash 100186656, now seen corresponding path program 1 times [2025-02-08 06:40:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324645770] [2025-02-08 06:40:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:51,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:51,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:40:51,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:40:51,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:51,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324645770] [2025-02-08 06:40:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324645770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:51,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:51,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:40:51,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143388154] [2025-02-08 06:40:51,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:51,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:40:51,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:51,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:40:51,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:51,366 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:40:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:51,485 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2025-02-08 06:40:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:51,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 29 [2025-02-08 06:40:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:51,486 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:40:51,486 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:40:51,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:40:51,487 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:51,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 284 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:40:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:40:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 91 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2025-02-08 06:40:51,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 29 [2025-02-08 06:40:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:51,489 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2025-02-08 06:40:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:40:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2025-02-08 06:40:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:40:51,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:51,490 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:40:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:40:51,490 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -341589976, now seen corresponding path program 1 times [2025-02-08 06:40:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796181540] [2025-02-08 06:40:51,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:51,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:40:51,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:40:51,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:51,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796181540] [2025-02-08 06:40:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796181540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366886238] [2025-02-08 06:40:51,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:51,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:51,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:51,742 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:40:51,745 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:40:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:40:51,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:40:51,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:51,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:51,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 06:40:51,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:51,857 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:40:51,873 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:40:51,906 WARN L851 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2025-02-08 06:40:51,908 WARN L873 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2025-02-08 06:40:51,920 WARN L851 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from false [2025-02-08 06:40:51,922 WARN L873 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from true [2025-02-08 06:40:51,942 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:40:51,948 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:40:51,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:51,976 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:40:52,002 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2025-02-08 06:40:52,004 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse0 (select |v_old(#valid)_AFTER_CALL_12| .cse0)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2025-02-08 06:40:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2025-02-08 06:40:52,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366886238] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:52,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2025-02-08 06:40:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950099075] [2025-02-08 06:40:52,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:52,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:40:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:52,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:40:52,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=191, Unknown=7, NotChecked=124, Total=380 [2025-02-08 06:40:52,224 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 18 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:52,299 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2025-02-08 06:40:52,301 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1))))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2025-02-08 06:40:52,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from false [2025-02-08 06:40:52,304 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_11| .cse1 (select |c_#valid| .cse1)))))) .cse0))) is different from true [2025-02-08 06:40:52,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2025-02-08 06:40:52,308 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2025-02-08 06:40:52,310 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0))) is different from false [2025-02-08 06:40:52,311 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) .cse0))) is different from true [2025-02-08 06:40:52,316 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2025-02-08 06:40:52,318 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_12| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_11| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_11| |v_old(#valid)_AFTER_CALL_12|))) (and (= (select |v_#valid_BEFORE_CALL_11| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (store |v_#valid_BEFORE_CALL_11| .cse1 (select |v_old(#valid)_AFTER_CALL_12| .cse1)) |v_old(#valid)_AFTER_CALL_12|)))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_12| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) (<= (+ |node_create_~temp~0#1.base| 2) |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or .cse0 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2025-02-08 06:40:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:52,555 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-02-08 06:40:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:40:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-02-08 06:40:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:52,557 INFO L225 Difference]: With dead ends: 135 [2025-02-08 06:40:52,557 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:40:52,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=275, Unknown=17, NotChecked=378, Total=756 [2025-02-08 06:40:52,558 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 178 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 671 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:52,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 307 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 474 Invalid, 0 Unknown, 671 Unchecked, 0.3s Time] [2025-02-08 06:40:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:40:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 99. [2025-02-08 06:40:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.640625) internal successors, (105), 93 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-02-08 06:40:52,563 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 32 [2025-02-08 06:40:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:52,564 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-02-08 06:40:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.875) internal successors, (46), 14 states have internal predecessors, (46), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:40:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-02-08 06:40:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:40:52,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:52,565 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:40:52,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:40:52,765 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,SelfDestructingSolverStorable13 [2025-02-08 06:40:52,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:52,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash -341589975, now seen corresponding path program 1 times [2025-02-08 06:40:52,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:52,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382382919] [2025-02-08 06:40:52,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:52,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:40:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:40:52,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,006 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:40:53,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382382919] [2025-02-08 06:40:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382382919] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:53,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572110774] [2025-02-08 06:40:53,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:53,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:53,008 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:40:53,011 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:40:53,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:40:53,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:40:53,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 06:40:53,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:53,126 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:40:53,141 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:40:53,147 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:40:53,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:53,175 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:40:53,191 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:40:53,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:40:53,220 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:40:53,258 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:40:53,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572110774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:53,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2025-02-08 06:40:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601363192] [2025-02-08 06:40:53,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:40:53,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:40:53,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=141, Unknown=1, NotChecked=24, Total=210 [2025-02-08 06:40:53,364 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:53,501 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2025-02-08 06:40:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:40:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-02-08 06:40:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:53,502 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:40:53,502 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:40:53,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=158, Unknown=1, NotChecked=26, Total=240 [2025-02-08 06:40:53,503 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 121 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:53,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 139 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2025-02-08 06:40:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:40:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:40:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.484375) internal successors, (95), 85 states have internal predecessors, (95), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2025-02-08 06:40:53,505 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 32 [2025-02-08 06:40:53,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:53,505 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2025-02-08 06:40:53,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:40:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2025-02-08 06:40:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:40:53,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:53,505 INFO L218 NwaCegarLoop]: trace histogram [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:40:53,512 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:40:53,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:53,710 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:53,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:53,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1999354630, now seen corresponding path program 1 times [2025-02-08 06:40:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:53,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425439801] [2025-02-08 06:40:53,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:40:53,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:40:53,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:53,791 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:40:53,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425439801] [2025-02-08 06:40:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425439801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:53,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:53,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:40:53,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159162740] [2025-02-08 06:40:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:53,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:40:53,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:53,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:40:53,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:40:53,793 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:40:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:53,903 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2025-02-08 06:40:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:40:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:40:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:53,904 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:40:53,904 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:40:53,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:40:53,905 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 63 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:53,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 183 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:40:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2025-02-08 06:40:53,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.507462686567164) internal successors, (101), 88 states have internal predecessors, (101), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2025-02-08 06:40:53,908 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 33 [2025-02-08 06:40:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:53,908 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2025-02-08 06:40:53,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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:40:53,908 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2025-02-08 06:40:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:40:53,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:53,910 INFO L218 NwaCegarLoop]: trace histogram [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:40:53,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:40:53,910 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1999354629, now seen corresponding path program 1 times [2025-02-08 06:40:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109069013] [2025-02-08 06:40:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:53,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:40:53,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:40:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109069013] [2025-02-08 06:40:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109069013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:40:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118896211] [2025-02-08 06:40:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:54,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:40:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:54,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:40:54,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:40:54,168 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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:40:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,371 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2025-02-08 06:40:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:40:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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 33 [2025-02-08 06:40:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,372 INFO L225 Difference]: With dead ends: 128 [2025-02-08 06:40:54,372 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 06:40:54,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:40:54,372 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:54,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 325 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:40:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 06:40:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2025-02-08 06:40:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 67 states have (on average 1.492537313432836) internal successors, (100), 88 states have internal predecessors, (100), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2025-02-08 06:40:54,376 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 33 [2025-02-08 06:40:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,376 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2025-02-08 06:40:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 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:40:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2025-02-08 06:40:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:40:54,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,378 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-08 06:40:54,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:40:54,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:54,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1850472155, now seen corresponding path program 1 times [2025-02-08 06:40:54,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848928135] [2025-02-08 06:40:54,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:40:54,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:40:54,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:54,421 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:40:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:54,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848928135] [2025-02-08 06:40:54,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848928135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:54,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:54,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:40:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819292572] [2025-02-08 06:40:54,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:54,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:40:54,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:54,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:40:54,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:40:54,423 INFO L87 Difference]: Start difference. First operand 94 states and 108 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:40:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,434 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2025-02-08 06:40:54,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:40:54,434 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 34 [2025-02-08 06:40:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,435 INFO L225 Difference]: With dead ends: 128 [2025-02-08 06:40:54,435 INFO L226 Difference]: Without dead ends: 128 [2025-02-08 06:40:54,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:40:54,435 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 84 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 150 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:40:54,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 150 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-08 06:40:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2025-02-08 06:40:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 87 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-02-08 06:40:54,438 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 34 [2025-02-08 06:40:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-02-08 06:40:54,438 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:40:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-02-08 06:40:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:40:54,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,439 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:40:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:40:54,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:54,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1850705559, now seen corresponding path program 1 times [2025-02-08 06:40:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378504115] [2025-02-08 06:40:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:40:54,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:40:54,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378504115] [2025-02-08 06:40:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378504115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:40:54,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17033021] [2025-02-08 06:40:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:54,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:40:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:54,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:40:54,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:40:54,556 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:40:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,698 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2025-02-08 06:40:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:40:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 38 [2025-02-08 06:40:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,698 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:40:54,698 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:40:54,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:40:54,699 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:54,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 415 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:40:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2025-02-08 06:40:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 99 states have internal predecessors, (117), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-02-08 06:40:54,701 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 38 [2025-02-08 06:40:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,702 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-02-08 06:40:54,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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:40:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-02-08 06:40:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:40:54,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,702 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:40:54,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:40:54,703 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:54,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1850678749, now seen corresponding path program 1 times [2025-02-08 06:40:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816333798] [2025-02-08 06:40:54,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:40:54,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:40:54,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:54,755 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:40:54,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816333798] [2025-02-08 06:40:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816333798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:54,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:40:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820269299] [2025-02-08 06:40:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:40:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:54,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:40:54,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:40:54,756 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:40:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:54,820 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-02-08 06:40:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:40:54,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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 38 [2025-02-08 06:40:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:54,821 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:40:54,822 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:40:54,822 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:40:54,823 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:54,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 149 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:40:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 06:40:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 98 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-02-08 06:40:54,830 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 38 [2025-02-08 06:40:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-02-08 06:40:54,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 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:40:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-02-08 06:40:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:40:54,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:54,831 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-08 06:40:54,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:40:54,831 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:54,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1850678748, now seen corresponding path program 1 times [2025-02-08 06:40:54,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:54,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944429540] [2025-02-08 06:40:54,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:54,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:40:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:40:54,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:54,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:55,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:55,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944429540] [2025-02-08 06:40:55,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944429540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:55,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:55,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:40:55,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4907330] [2025-02-08 06:40:55,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:55,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:40:55,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:55,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:40:55,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:40:55,155 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:40:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:55,471 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2025-02-08 06:40:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:40:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 38 [2025-02-08 06:40:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:55,472 INFO L225 Difference]: With dead ends: 134 [2025-02-08 06:40:55,472 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:40:55,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:40:55,473 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:55,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 352 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:40:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:40:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2025-02-08 06:40:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 103 states have internal predecessors, (122), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2025-02-08 06:40:55,476 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 38 [2025-02-08 06:40:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:55,476 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2025-02-08 06:40:55,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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:40:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2025-02-08 06:40:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:40:55,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:55,476 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:55,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:40:55,477 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:55,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1566063176, now seen corresponding path program 1 times [2025-02-08 06:40:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415595568] [2025-02-08 06:40:55,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:55,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:55,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:55,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 06:40:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415595568] [2025-02-08 06:40:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415595568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164444690] [2025-02-08 06:40:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:55,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:55,526 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:40:55,528 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:40:55,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:55,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:55,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:55,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:55,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:40:55,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:40:55,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:40:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164444690] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:55,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:40:55,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:40:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073870162] [2025-02-08 06:40:55,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:55,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:40:55,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:55,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:40:55,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:40:55,670 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:40:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:55,678 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2025-02-08 06:40:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:40:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 40 [2025-02-08 06:40:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:55,679 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:40:55,679 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:40:55,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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:40:55,680 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:55,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:40:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:40:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 06:40:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 82 states have internal predecessors, (93), 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:40:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2025-02-08 06:40:55,682 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 40 [2025-02-08 06:40:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2025-02-08 06:40:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:40:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2025-02-08 06:40:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:40:55,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:55,683 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:55,693 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:40:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:55,884 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1537297486, now seen corresponding path program 1 times [2025-02-08 06:40:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:55,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073305207] [2025-02-08 06:40:55,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:55,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:40:55,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:40:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:55,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:40:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073305207] [2025-02-08 06:40:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073305207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:40:56,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063601864] [2025-02-08 06:40:56,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:40:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:56,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:40:56,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:40:56,046 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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:40:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:56,192 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-02-08 06:40:56,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:40:56,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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 39 [2025-02-08 06:40:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:56,193 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:40:56,193 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:40:56,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:40:56,193 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:56,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 319 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:40:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2025-02-08 06:40:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.411764705882353) internal successors, (96), 85 states have internal predecessors, (96), 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:40:56,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2025-02-08 06:40:56,196 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 39 [2025-02-08 06:40:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:56,196 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2025-02-08 06:40:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 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:40:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2025-02-08 06:40:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:40:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:56,196 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:40:56,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -411581817, now seen corresponding path program 1 times [2025-02-08 06:40:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206820031] [2025-02-08 06:40:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:56,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:56,245 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:40:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206820031] [2025-02-08 06:40:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206820031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:40:56,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:40:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:40:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289095839] [2025-02-08 06:40:56,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:40:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:40:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:56,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:40:56,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:40:56,247 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:40:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:56,310 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2025-02-08 06:40:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:40:56,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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 40 [2025-02-08 06:40:56,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:56,310 INFO L225 Difference]: With dead ends: 88 [2025-02-08 06:40:56,310 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:40:56,311 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:40:56,311 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:56,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:40:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:40:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:40:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 84 states have internal predecessors, (94), 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:40:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2025-02-08 06:40:56,313 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 40 [2025-02-08 06:40:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:56,313 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2025-02-08 06:40:56,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 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:40:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2025-02-08 06:40:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:40:56,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:56,314 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:56,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:40:56,314 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:56,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -385816544, now seen corresponding path program 1 times [2025-02-08 06:40:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70995706] [2025-02-08 06:40:56,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:56,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:56,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:56,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:56,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70995706] [2025-02-08 06:40:56,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70995706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:56,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582246178] [2025-02-08 06:40:56,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:56,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:56,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:56,805 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:40:56,808 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:40:56,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:57,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:57,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:57,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:57,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-02-08 06:40:57,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:57,058 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:40:57,143 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:40:57,143 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:40:57,198 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:40:57,239 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 16 treesize of output 11 [2025-02-08 06:40:57,306 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 16 treesize of output 11 [2025-02-08 06:40:57,339 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 33 treesize of output 24 [2025-02-08 06:40:57,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:40:57,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 20 [2025-02-08 06:40:57,583 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 8 treesize of output 4 [2025-02-08 06:40:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:57,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:40:57,601 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 26 treesize of output 18 [2025-02-08 06:40:57,602 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 22 treesize of output 14 [2025-02-08 06:40:57,611 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-08 06:40:57,611 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:40:57,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1887) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2025-02-08 06:40:57,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:40:57,794 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 21 treesize of output 22 [2025-02-08 06:40:57,796 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 122 treesize of output 110 [2025-02-08 06:40:57,801 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 20 treesize of output 16 [2025-02-08 06:40:57,806 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:40:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582246178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:57,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:40:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2025-02-08 06:40:57,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125965930] [2025-02-08 06:40:57,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:40:57,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:40:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:40:57,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:40:57,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1492, Unknown=24, NotChecked=78, Total=1722 [2025-02-08 06:40:57,926 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:40:58,655 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-02-08 06:40:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:40:58,655 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2025-02-08 06:40:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:40:58,656 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:40:58,656 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:40:58,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=2233, Unknown=25, NotChecked=96, Total=2550 [2025-02-08 06:40:58,657 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 133 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:40:58,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 613 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:40:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:40:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-02-08 06:40:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 86 states have internal predecessors, (97), 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:40:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2025-02-08 06:40:58,660 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 40 [2025-02-08 06:40:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:40:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2025-02-08 06:40:58,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 31 states have internal predecessors, (58), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:40:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2025-02-08 06:40:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:40:58,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:40:58,660 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:40:58,669 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:40:58,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:58,865 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:40:58,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:40:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash -385816543, now seen corresponding path program 1 times [2025-02-08 06:40:58,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:40:58,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758421899] [2025-02-08 06:40:58,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:40:58,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:58,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:58,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:58,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:40:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:40:59,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758421899] [2025-02-08 06:40:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758421899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:40:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564617579] [2025-02-08 06:40:59,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:40:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:40:59,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:40:59,561 INFO L229 MonitoredProcess]: Starting monitored process 11 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:40:59,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:40:59,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:40:59,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:40:59,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:40:59,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:40:59,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 103 conjuncts are in the unsatisfiable core [2025-02-08 06:40:59,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:40:59,904 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:40:59,907 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:41:00,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:00,142 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 19 treesize of output 18 [2025-02-08 06:41:00,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-08 06:41:00,251 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:41:00,252 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:41:00,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:00,267 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:41:00,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-08 06:41:00,391 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:41:00,471 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 23 treesize of output 16 [2025-02-08 06:41:00,481 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 16 treesize of output 11 [2025-02-08 06:41:00,612 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 16 treesize of output 11 [2025-02-08 06:41:00,617 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 23 treesize of output 16 [2025-02-08 06:41:00,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-08 06:41:00,685 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 33 treesize of output 24 [2025-02-08 06:41:00,860 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 87 treesize of output 51 [2025-02-08 06:41:00,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-08 06:41:00,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:41:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:01,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:01,249 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 58 treesize of output 42 [2025-02-08 06:41:01,251 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 46 treesize of output 30 [2025-02-08 06:41:01,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:01,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 43 treesize of output 44 [2025-02-08 06:41:01,494 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 298 treesize of output 286 [2025-02-08 06:41:01,499 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 67 treesize of output 65 [2025-02-08 06:41:01,503 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 68 treesize of output 64 [2025-02-08 06:41:02,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 469 treesize of output 312 [2025-02-08 06:41:02,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1597 treesize of output 1513 [2025-02-08 06:41:02,076 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 558 treesize of output 554 [2025-02-08 06:41:02,084 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 554 treesize of output 550 [2025-02-08 06:41:02,092 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 550 treesize of output 548 [2025-02-08 06:41:02,126 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 548 treesize of output 544 [2025-02-08 06:41:02,132 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 544 treesize of output 542 [2025-02-08 06:41:02,138 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 542 treesize of output 530 [2025-02-08 06:41:02,147 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 530 treesize of output 524 [2025-02-08 06:41:02,153 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 524 treesize of output 520 [2025-02-08 06:41:02,160 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 520 treesize of output 516 [2025-02-08 06:41:02,167 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 516 treesize of output 512 [2025-02-08 06:41:02,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564617579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:02,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:02,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 41 [2025-02-08 06:41:02,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587628869] [2025-02-08 06:41:02,280 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:02,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:41:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:41:02,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2692, Unknown=3, NotChecked=0, Total=2862 [2025-02-08 06:41:02,283 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 42 states, 40 states have (on average 1.8) internal successors, (72), 37 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:03,672 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2025-02-08 06:41:03,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:41:03,672 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.8) internal successors, (72), 37 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 40 [2025-02-08 06:41:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:03,674 INFO L225 Difference]: With dead ends: 105 [2025-02-08 06:41:03,674 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:41:03,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=312, Invalid=4515, Unknown=3, NotChecked=0, Total=4830 [2025-02-08 06:41:03,675 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 159 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:03,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 721 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:41:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:41:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2025-02-08 06:41:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 86 states have internal predecessors, (96), 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:41:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-02-08 06:41:03,679 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 40 [2025-02-08 06:41:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-02-08 06:41:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.8) internal successors, (72), 37 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:41:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-02-08 06:41:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:41:03,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:03,679 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:03,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:41:03,884 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash 125865551, now seen corresponding path program 1 times [2025-02-08 06:41:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286294567] [2025-02-08 06:41:03,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:03,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:03,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:03,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:04,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:04,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286294567] [2025-02-08 06:41:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286294567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:04,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131129770] [2025-02-08 06:41:04,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:04,061 INFO L229 MonitoredProcess]: Starting monitored process 12 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:41:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:41:04,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:04,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:04,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:04,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:04,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:41:04,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:04,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:04,313 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:41:04,317 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:41:04,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131129770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-02-08 06:41:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571610903] [2025-02-08 06:41:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:04,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:04,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:04,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:41:04,318 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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:41:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:04,397 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2025-02-08 06:41:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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 41 [2025-02-08 06:41:04,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:04,397 INFO L225 Difference]: With dead ends: 89 [2025-02-08 06:41:04,397 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:41:04,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:41:04,398 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 107 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:04,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 91 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:41:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 06:41:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 85 states have internal predecessors, (94), 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:41:04,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-02-08 06:41:04,400 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2025-02-08 06:41:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:04,400 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-02-08 06:41:04,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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:41:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-02-08 06:41:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:41:04,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:04,400 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:04,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:41:04,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-08 06:41:04,602 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 924589041, now seen corresponding path program 1 times [2025-02-08 06:41:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079817671] [2025-02-08 06:41:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:04,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:04,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:04,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:04,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:05,239 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:41:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079817671] [2025-02-08 06:41:05,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079817671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:05,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80735660] [2025-02-08 06:41:05,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:05,241 INFO L229 MonitoredProcess]: Starting monitored process 13 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:41:05,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:41:05,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:05,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:05,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:05,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 06:41:05,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:05,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:05,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:41:05,816 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 32 treesize of output 20 [2025-02-08 06:41:05,847 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 17 treesize of output 9 [2025-02-08 06:41:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:41:05,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:06,013 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 62 treesize of output 46 [2025-02-08 06:41:06,015 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 50 treesize of output 34 [2025-02-08 06:41:06,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:06,106 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 15 treesize of output 19 [2025-02-08 06:41:06,175 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:41:06,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80735660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:06,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:06,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 10] total 37 [2025-02-08 06:41:06,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53407516] [2025-02-08 06:41:06,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:06,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 06:41:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:06,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 06:41:06,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2025-02-08 06:41:06,176 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 38 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:41:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:06,752 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-02-08 06:41:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:41:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2025-02-08 06:41:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:06,753 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:41:06,753 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:41:06,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1966, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 06:41:06,753 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 165 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:06,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 780 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:41:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:41:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2025-02-08 06:41:06,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.352112676056338) internal successors, (96), 86 states have internal predecessors, (96), 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:41:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2025-02-08 06:41:06,755 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 41 [2025-02-08 06:41:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:06,755 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2025-02-08 06:41:06,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.25) internal successors, (81), 34 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:41:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2025-02-08 06:41:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:41:06,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:06,756 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:06,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:06,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:41:06,960 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash 924589040, now seen corresponding path program 1 times [2025-02-08 06:41:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324719407] [2025-02-08 06:41:06,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:06,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:41:06,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:41:06,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:07,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324719407] [2025-02-08 06:41:07,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324719407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:07,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:07,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 06:41:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578381608] [2025-02-08 06:41:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:07,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:41:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:07,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:41:07,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:41:07,275 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:41:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:07,499 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2025-02-08 06:41:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:41:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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 41 [2025-02-08 06:41:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:07,500 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:41:07,500 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:41:07,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:41:07,500 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:07,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 428 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:41:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-08 06:41:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 86 states have internal predecessors, (95), 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:41:07,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-02-08 06:41:07,503 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 41 [2025-02-08 06:41:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:07,503 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-02-08 06:41:07,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 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:41:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-02-08 06:41:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:41:07,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:07,504 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:07,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 06:41:07,504 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -528162418, now seen corresponding path program 1 times [2025-02-08 06:41:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852512887] [2025-02-08 06:41:07,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:07,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:41:07,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:41:07,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:07,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852512887] [2025-02-08 06:41:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852512887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928923978] [2025-02-08 06:41:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:41:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:41:07,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:07,618 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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:41:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:07,719 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2025-02-08 06:41:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:41:07,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 43 [2025-02-08 06:41:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:07,720 INFO L225 Difference]: With dead ends: 113 [2025-02-08 06:41:07,720 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 06:41:07,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:41:07,721 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:07,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 357 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 06:41:07,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2025-02-08 06:41:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 93 states have internal predecessors, (107), 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:41:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2025-02-08 06:41:07,724 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 43 [2025-02-08 06:41:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:07,724 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2025-02-08 06:41:07,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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:41:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2025-02-08 06:41:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:41:07,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:07,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:07,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 06:41:07,725 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:07,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:07,727 INFO L85 PathProgramCache]: Analyzing trace with hash 154171139, now seen corresponding path program 1 times [2025-02-08 06:41:07,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:07,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222912611] [2025-02-08 06:41:07,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:07,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:07,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:07,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:07,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:07,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222912611] [2025-02-08 06:41:07,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222912611] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:07,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479728219] [2025-02-08 06:41:07,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:07,780 INFO L229 MonitoredProcess]: Starting monitored process 14 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:41:07,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:41:07,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:07,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:07,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:07,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 06:41:07,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:07,962 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:41:07,973 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:41:08,004 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:41:08,005 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:41:08,038 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:41:08,054 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:41:08,054 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 18 treesize of output 17 [2025-02-08 06:41:08,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:08,195 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:41:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:08,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479728219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:17,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13] total 15 [2025-02-08 06:41:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775418723] [2025-02-08 06:41:17,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:17,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:41:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:41:17,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=420, Unknown=2, NotChecked=0, Total=506 [2025-02-08 06:41:17,741 INFO L87 Difference]: Start difference. First operand 97 states and 111 transitions. Second operand has 16 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:17,976 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-02-08 06:41:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:41:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 44 [2025-02-08 06:41:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:17,977 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:41:17,977 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:41:17,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=130, Invalid=518, Unknown=2, NotChecked=0, Total=650 [2025-02-08 06:41:17,978 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 191 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:17,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 190 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:41:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2025-02-08 06:41:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 91 states have internal predecessors, (104), 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:41:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2025-02-08 06:41:17,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 44 [2025-02-08 06:41:17,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:17,980 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2025-02-08 06:41:17,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.2) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2025-02-08 06:41:17,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:41:17,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:17,980 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:17,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:18,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:18,185 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 806834235, now seen corresponding path program 1 times [2025-02-08 06:41:18,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:18,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672031186] [2025-02-08 06:41:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:18,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:18,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:18,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:18,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:18,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:18,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672031186] [2025-02-08 06:41:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672031186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:18,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:41:18,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576068716] [2025-02-08 06:41:18,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:18,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:41:18,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:18,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:41:18,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:41:18,309 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:41:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:18,449 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2025-02-08 06:41:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:41:18,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 44 [2025-02-08 06:41:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:18,449 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:41:18,450 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:41:18,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:41:18,450 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 33 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:18,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 294 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:41:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2025-02-08 06:41:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 94 states have internal predecessors, (107), 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:41:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-02-08 06:41:18,453 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 44 [2025-02-08 06:41:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:18,453 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-02-08 06:41:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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:41:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-02-08 06:41:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:41:18,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:18,454 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:18,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 06:41:18,454 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:18,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 484338047, now seen corresponding path program 1 times [2025-02-08 06:41:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430892137] [2025-02-08 06:41:18,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:18,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:41:18,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:41:18,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:18,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430892137] [2025-02-08 06:41:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430892137] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19079045] [2025-02-08 06:41:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:19,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:19,130 INFO L229 MonitoredProcess]: Starting monitored process 15 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:41:19,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:41:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:41:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:41:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:19,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-02-08 06:41:19,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:19,352 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:41:19,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:19,408 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:41:19,463 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:41:19,499 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 16 treesize of output 11 [2025-02-08 06:41:19,552 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 16 treesize of output 11 [2025-02-08 06:41:19,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:19,558 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 21 [2025-02-08 06:41:19,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:19,755 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-02-08 06:41:19,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 41 [2025-02-08 06:41:19,847 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 16 treesize of output 8 [2025-02-08 06:41:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:19,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:20,010 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 8 treesize of output 4 [2025-02-08 06:41:20,039 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:41:20,045 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2859 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2859) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2025-02-08 06:41:20,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2858 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_30| Int) (v_ArrVal_2859 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2858) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2859) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_30| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_30| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2025-02-08 06:41:20,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:20,133 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 27 treesize of output 28 [2025-02-08 06:41:20,135 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 85 treesize of output 81 [2025-02-08 06:41:20,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:20,143 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 94 treesize of output 98 [2025-02-08 06:41:20,148 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 98 treesize of output 94 [2025-02-08 06:41:20,152 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 85 treesize of output 83 [2025-02-08 06:41:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 06:41:20,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19079045] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:20,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:20,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 52 [2025-02-08 06:41:20,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009672313] [2025-02-08 06:41:20,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:20,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-08 06:41:20,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:20,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 06:41:20,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2279, Unknown=13, NotChecked=194, Total=2652 [2025-02-08 06:41:20,480 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 52 states, 52 states have (on average 1.75) internal successors, (91), 46 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:21,456 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-02-08 06:41:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:41:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.75) internal successors, (91), 46 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2025-02-08 06:41:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:21,457 INFO L225 Difference]: With dead ends: 81 [2025-02-08 06:41:21,457 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 06:41:21,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=278, Invalid=3377, Unknown=13, NotChecked=238, Total=3906 [2025-02-08 06:41:21,458 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:21,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 978 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1112 Invalid, 0 Unknown, 84 Unchecked, 0.7s Time] [2025-02-08 06:41:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 06:41:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-02-08 06:41:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 72 states have internal predecessors, (74), 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:41:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2025-02-08 06:41:21,469 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 45 [2025-02-08 06:41:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:21,469 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2025-02-08 06:41:21,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.75) internal successors, (91), 46 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:41:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2025-02-08 06:41:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:41:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:21,469 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:21,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:41:21,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-02-08 06:41:21,670 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:21,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -757942484, now seen corresponding path program 1 times [2025-02-08 06:41:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89952540] [2025-02-08 06:41:21,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:21,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:21,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:41:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:41:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:21,745 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:41:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89952540] [2025-02-08 06:41:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89952540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:21,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:41:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600587891] [2025-02-08 06:41:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:41:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:41:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:21,747 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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:41:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:21,825 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2025-02-08 06:41:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:41:21,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 45 [2025-02-08 06:41:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:21,826 INFO L225 Difference]: With dead ends: 75 [2025-02-08 06:41:21,826 INFO L226 Difference]: Without dead ends: 75 [2025-02-08 06:41:21,826 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:41:21,827 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:21,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:21,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-08 06:41:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-08 06:41:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 71 states have internal predecessors, (73), 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:41:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2025-02-08 06:41:21,830 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 45 [2025-02-08 06:41:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:21,830 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2025-02-08 06:41:21,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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:41:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2025-02-08 06:41:21,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:41:21,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:21,831 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:21,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 06:41:21,831 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:21,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2021380520, now seen corresponding path program 1 times [2025-02-08 06:41:21,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:21,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899522741] [2025-02-08 06:41:21,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:21,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:21,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:21,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:21,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:21,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899522741] [2025-02-08 06:41:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899522741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860293594] [2025-02-08 06:41:21,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:22,001 INFO L229 MonitoredProcess]: Starting monitored process 16 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:41:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:41:22,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:41:22,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:41:22,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:22,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:22,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:41:22,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:22,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:22,287 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:41:22,288 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:41:22,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860293594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15 [2025-02-08 06:41:22,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446773034] [2025-02-08 06:41:22,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:22,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:22,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:41:22,290 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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:41:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:22,371 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2025-02-08 06:41:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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 46 [2025-02-08 06:41:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:22,372 INFO L225 Difference]: With dead ends: 74 [2025-02-08 06:41:22,372 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 06:41:22,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:41:22,373 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 86 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:22,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 91 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:22,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 06:41:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 06:41:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 70 states have internal predecessors, (72), 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:41:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2025-02-08 06:41:22,375 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 46 [2025-02-08 06:41:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:22,375 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2025-02-08 06:41:22,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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:41:22,375 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2025-02-08 06:41:22,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:41:22,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:22,375 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:22,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-08 06:41:22,580 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1606882853, now seen corresponding path program 1 times [2025-02-08 06:41:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550223997] [2025-02-08 06:41:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:22,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:22,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:22,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:22,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550223997] [2025-02-08 06:41:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550223997] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419889968] [2025-02-08 06:41:23,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:23,301 INFO L229 MonitoredProcess]: Starting monitored process 17 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:41:23,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:41:23,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:23,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:23,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:23,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:23,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-08 06:41:23,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:23,517 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:41:23,570 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:23,570 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:41:23,625 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:41:23,659 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 16 treesize of output 11 [2025-02-08 06:41:23,720 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 16 treesize of output 11 [2025-02-08 06:41:23,750 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 33 treesize of output 24 [2025-02-08 06:41:24,132 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:24,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 73 [2025-02-08 06:41:24,390 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 89 treesize of output 69 [2025-02-08 06:41:24,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:24,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 9 [2025-02-08 06:41:24,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2025-02-08 06:41:24,580 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 17 treesize of output 9 [2025-02-08 06:41:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:24,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:24,902 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 8 treesize of output 4 [2025-02-08 06:41:25,016 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 29 treesize of output 17 [2025-02-08 06:41:25,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:25,126 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 60 treesize of output 64 [2025-02-08 06:41:25,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:25,345 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 26 treesize of output 27 [2025-02-08 06:41:25,346 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 80 treesize of output 76 [2025-02-08 06:41:25,350 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 42 treesize of output 40 [2025-02-08 06:41:25,352 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 85 treesize of output 81 [2025-02-08 06:41:25,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:25,362 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 49 treesize of output 53 [2025-02-08 06:41:25,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:25,406 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 27 treesize of output 28 [2025-02-08 06:41:25,410 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 85 treesize of output 81 [2025-02-08 06:41:25,417 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 100 treesize of output 96 [2025-02-08 06:41:25,423 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 87 treesize of output 85 [2025-02-08 06:41:25,434 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 06:41:25,435 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 92 treesize of output 91 [2025-02-08 06:41:25,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419889968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:25,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:25,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 46 [2025-02-08 06:41:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507213917] [2025-02-08 06:41:25,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:25,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-08 06:41:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:25,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-08 06:41:25,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=3649, Unknown=17, NotChecked=0, Total=3906 [2025-02-08 06:41:25,605 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:41:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:26,607 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2025-02-08 06:41:26,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:41:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2025-02-08 06:41:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:26,608 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:41:26,608 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:41:26,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=373, Invalid=5159, Unknown=18, NotChecked=0, Total=5550 [2025-02-08 06:41:26,609 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 84 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:26,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 592 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:41:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:41:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 81. [2025-02-08 06:41:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 77 states have internal predecessors, (81), 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:41:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-02-08 06:41:26,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 51 [2025-02-08 06:41:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-02-08 06:41:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 43 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:41:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-02-08 06:41:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:41:26,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:26,613 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:26,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:26,817 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1606882852, now seen corresponding path program 1 times [2025-02-08 06:41:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477257943] [2025-02-08 06:41:26,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:26,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:27,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477257943] [2025-02-08 06:41:27,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477257943] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:27,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176404378] [2025-02-08 06:41:27,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:27,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:27,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:27,578 INFO L229 MonitoredProcess]: Starting monitored process 18 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:41:27,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:41:27,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:41:27,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:41:27,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:27,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:27,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-02-08 06:41:27,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:27,824 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:41:27,825 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:41:28,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:28,077 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:41:28,082 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:41:28,155 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:41:28,158 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:41:28,215 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:41:28,215 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 57 treesize of output 50 [2025-02-08 06:41:28,218 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:41:28,315 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-02-08 06:41:28,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-02-08 06:41:28,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:28,321 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 16 treesize of output 11 [2025-02-08 06:41:28,326 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 23 treesize of output 11 [2025-02-08 06:41:28,328 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 33 treesize of output 24 [2025-02-08 06:41:28,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:28,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:28,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 19 [2025-02-08 06:41:28,788 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:28,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 73 [2025-02-08 06:41:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2025-02-08 06:41:29,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-08 06:41:29,367 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 17 treesize of output 9 [2025-02-08 06:41:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:29,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:29,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:29,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 130 treesize of output 129 [2025-02-08 06:41:30,023 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 44 treesize of output 28 [2025-02-08 06:41:30,167 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_3457 (Array Int Int)) (v_ArrVal_3458 (Array Int Int))) (<= (+ 4 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3458) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3457) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((|ULTIMATE.start_dll_circular_create_~last~0#1.offset| Int) (v_ArrVal_3458 (Array Int Int))) (<= 0 (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3458) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0))))) is different from false [2025-02-08 06:41:30,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:30,449 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 26 treesize of output 27 [2025-02-08 06:41:30,452 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 88 treesize of output 84 [2025-02-08 06:41:30,459 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 46 treesize of output 44 [2025-02-08 06:41:30,464 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 104 treesize of output 100 [2025-02-08 06:41:30,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:30,474 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 64 treesize of output 68 [2025-02-08 06:41:30,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:30,546 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2025-02-08 06:41:30,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:30,550 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-02-08 06:41:30,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:30,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:30,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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:41:30,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:30,555 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:30,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-08 06:41:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176404378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:30,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:30,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2025-02-08 06:41:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216009467] [2025-02-08 06:41:30,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:30,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-08 06:41:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:30,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-08 06:41:30,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4663, Unknown=73, NotChecked=138, Total=5112 [2025-02-08 06:41:30,766 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 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:41:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:31,953 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2025-02-08 06:41:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:41:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 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 51 [2025-02-08 06:41:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:31,953 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:41:31,953 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:41:31,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=356, Invalid=6378, Unknown=76, NotChecked=162, Total=6972 [2025-02-08 06:41:31,955 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:31,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 820 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 06:41:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:41:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 81. [2025-02-08 06:41:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 77 states have internal predecessors, (80), 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:41:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2025-02-08 06:41:31,957 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 51 [2025-02-08 06:41:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:31,957 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2025-02-08 06:41:31,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 48 states have internal predecessors, (93), 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:41:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2025-02-08 06:41:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:41:31,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:31,958 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:31,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 06:41:32,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:32,158 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:32,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:32,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1726218340, now seen corresponding path program 1 times [2025-02-08 06:41:32,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:32,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710851275] [2025-02-08 06:41:32,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:32,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:32,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:41:32,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:41:32,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:32,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710851275] [2025-02-08 06:41:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710851275] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037302218] [2025-02-08 06:41:32,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:32,211 INFO L229 MonitoredProcess]: Starting monitored process 19 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:41:32,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:41:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:41:32,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:41:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:32,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:32,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:41:32,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:32,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:32,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037302218] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:32,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-08 06:41:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44120900] [2025-02-08 06:41:32,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:41:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:32,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:41:32,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:41:32,530 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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:41:32,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:32,549 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2025-02-08 06:41:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:32,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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 52 [2025-02-08 06:41:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:32,550 INFO L225 Difference]: With dead ends: 110 [2025-02-08 06:41:32,550 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 06:41:32,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:32,551 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 133 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:32,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 223 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 06:41:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2025-02-08 06:41:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.196969696969697) internal successors, (79), 77 states have internal predecessors, (79), 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:41:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2025-02-08 06:41:32,552 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 52 [2025-02-08 06:41:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:32,552 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2025-02-08 06:41:32,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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:41:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2025-02-08 06:41:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:41:32,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:32,553 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:32,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:32,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 06:41:32,753 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -746276568, now seen corresponding path program 1 times [2025-02-08 06:41:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892568830] [2025-02-08 06:41:32,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:32,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:41:32,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:41:32,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:32,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892568830] [2025-02-08 06:41:33,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892568830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518390479] [2025-02-08 06:41:33,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:33,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:33,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:33,427 INFO L229 MonitoredProcess]: Starting monitored process 20 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:41:33,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 06:41:33,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:41:33,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:41:33,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:33,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:33,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-08 06:41:33,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:33,658 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:41:33,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:33,784 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:41:33,846 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 15 treesize of output 1 [2025-02-08 06:41:33,884 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 16 treesize of output 11 [2025-02-08 06:41:33,950 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 16 treesize of output 11 [2025-02-08 06:41:33,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:33,982 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:41:34,119 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-02-08 06:41:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 19 [2025-02-08 06:41:34,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-08 06:41:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:34,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:34,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:34,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 39 [2025-02-08 06:41:34,867 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 20 treesize of output 12 [2025-02-08 06:41:35,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:35,229 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 26 treesize of output 27 [2025-02-08 06:41:35,231 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 161 treesize of output 155 [2025-02-08 06:41:35,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:35,240 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 53 treesize of output 57 [2025-02-08 06:41:35,245 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 57 treesize of output 55 [2025-02-08 06:41:35,250 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 58 treesize of output 54 [2025-02-08 06:41:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518390479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:35,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2025-02-08 06:41:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528139700] [2025-02-08 06:41:35,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:35,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-08 06:41:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:35,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-08 06:41:35,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3404, Unknown=62, NotChecked=0, Total=3660 [2025-02-08 06:41:35,500 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 43 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:36,632 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2025-02-08 06:41:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:41:36,632 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 43 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-02-08 06:41:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:36,633 INFO L225 Difference]: With dead ends: 114 [2025-02-08 06:41:36,633 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 06:41:36,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=327, Invalid=5459, Unknown=66, NotChecked=0, Total=5852 [2025-02-08 06:41:36,635 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 109 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:36,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1032 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:41:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 06:41:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2025-02-08 06:41:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 89 states have internal predecessors, (96), 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:41:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-02-08 06:41:36,637 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 56 [2025-02-08 06:41:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:36,637 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-02-08 06:41:36,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 43 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-02-08 06:41:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-08 06:41:36,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:36,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:36,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 06:41:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:36,844 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:36,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -746249757, now seen corresponding path program 1 times [2025-02-08 06:41:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163060941] [2025-02-08 06:41:36,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:36,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:41:36,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:41:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163060941] [2025-02-08 06:41:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163060941] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:37,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334421894] [2025-02-08 06:41:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:37,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:37,058 INFO L229 MonitoredProcess]: Starting monitored process 21 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:41:37,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 06:41:37,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 06:41:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 06:41:37,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:37,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:37,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 148 conjuncts are in the unsatisfiable core [2025-02-08 06:41:37,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:37,337 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:41:37,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:37,486 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:41:37,574 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 15 treesize of output 1 [2025-02-08 06:41:37,581 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:41:37,624 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 16 treesize of output 11 [2025-02-08 06:41:37,628 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 16 treesize of output 11 [2025-02-08 06:41:37,704 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 16 treesize of output 11 [2025-02-08 06:41:37,711 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 16 treesize of output 11 [2025-02-08 06:41:37,718 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 19 treesize of output 18 [2025-02-08 06:41:37,724 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 19 [2025-02-08 06:41:38,142 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:38,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-02-08 06:41:38,199 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:38,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 68 [2025-02-08 06:41:38,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:38,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:39,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-08 06:41:39,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2025-02-08 06:41:39,436 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2025-02-08 06:41:39,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 17 [2025-02-08 06:41:39,442 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 27 treesize of output 11 [2025-02-08 06:41:39,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:41:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:39,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:40,021 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 124 treesize of output 96 [2025-02-08 06:41:40,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:40,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:40,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:40,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 192 treesize of output 187 [2025-02-08 06:41:40,793 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 59 treesize of output 35 [2025-02-08 06:41:41,077 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_3996 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0)))) (forall ((v_ArrVal_3995 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3995) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0) 0))) (forall ((v_ArrVal_3995 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3995) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse2 (select .cse3 0))) (or (= .cse2 (select .cse3 4)) (< .cse2 0))))))) is different from false [2025-02-08 06:41:41,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_3994 (Array Int Int)) (v_ArrVal_3996 (Array Int Int))) (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3994) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4)))) (forall ((v_ArrVal_3993 (Array Int Int)) (v_ArrVal_3995 (Array Int Int))) (< (select (store (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3993) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3995) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|) 0) 0))) (forall ((v_ArrVal_3993 (Array Int Int)) (v_ArrVal_3995 (Array Int Int))) (let ((.cse3 (store (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3993) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3995) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (let ((.cse2 (select .cse3 0))) (or (= .cse2 (select .cse3 4)) (< .cse2 0))))))) is different from false [2025-02-08 06:41:41,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:41,113 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 153 treesize of output 130 [2025-02-08 06:41:41,115 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 385 treesize of output 373 [2025-02-08 06:41:41,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:41,125 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 303 treesize of output 296 [2025-02-08 06:41:41,128 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 364 treesize of output 358 [2025-02-08 06:41:41,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:41,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 418 treesize of output 420 [2025-02-08 06:41:41,159 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 405 treesize of output 403 [2025-02-08 06:41:41,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:41,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 443 treesize of output 449 [2025-02-08 06:41:41,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 452 treesize of output 444 [2025-02-08 06:41:41,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 509 treesize of output 493 [2025-02-08 06:41:41,261 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 495 treesize of output 491 [2025-02-08 06:41:41,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 585 treesize of output 565 [2025-02-08 06:41:41,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 588 [2025-02-08 06:41:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334421894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:42,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 33] total 40 [2025-02-08 06:41:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643723970] [2025-02-08 06:41:42,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:42,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:41:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:42,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:41:42,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3675, Unknown=24, NotChecked=246, Total=4160 [2025-02-08 06:41:42,316 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 37 states have internal predecessors, (97), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:44,794 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2025-02-08 06:41:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-08 06:41:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 37 states have internal predecessors, (97), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-02-08 06:41:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:44,795 INFO L225 Difference]: With dead ends: 135 [2025-02-08 06:41:44,795 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:41:44,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=535, Invalid=6930, Unknown=25, NotChecked=342, Total=7832 [2025-02-08 06:41:44,796 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 222 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:44,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 839 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:41:44,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:41:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2025-02-08 06:41:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 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:41:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-02-08 06:41:44,802 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2025-02-08 06:41:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:44,803 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-02-08 06:41:44,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 37 states have internal predecessors, (97), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-02-08 06:41:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:41:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:44,804 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:44,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 06:41:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-08 06:41:45,005 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:45,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1659737133, now seen corresponding path program 1 times [2025-02-08 06:41:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909769266] [2025-02-08 06:41:45,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:45,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:45,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:41:45,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:41:45,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909769266] [2025-02-08 06:41:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909769266] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100634299] [2025-02-08 06:41:46,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:46,627 INFO L229 MonitoredProcess]: Starting monitored process 22 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:41:46,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 06:41:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:41:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:41:46,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:46,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:46,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-08 06:41:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:46,940 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:41:46,992 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:41:47,016 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:47,016 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:41:47,081 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 15 treesize of output 1 [2025-02-08 06:41:47,130 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 16 treesize of output 11 [2025-02-08 06:41:47,270 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 16 treesize of output 11 [2025-02-08 06:41:47,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:41:47,721 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:47,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 73 [2025-02-08 06:41:48,066 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 56 treesize of output 44 [2025-02-08 06:41:48,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-02-08 06:41:48,234 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 17 treesize of output 9 [2025-02-08 06:41:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:48,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:48,564 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 8 treesize of output 4 [2025-02-08 06:41:48,642 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 20 treesize of output 12 [2025-02-08 06:41:48,650 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4180 (Array Int Int))) (< (select (store (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4180) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_#StackHeapBarrier|)) is different from false [2025-02-08 06:41:48,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:48,804 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 26 treesize of output 27 [2025-02-08 06:41:48,805 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 161 treesize of output 155 [2025-02-08 06:41:48,809 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 62 treesize of output 58 [2025-02-08 06:41:48,822 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 53 treesize of output 51 [2025-02-08 06:41:48,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:48,829 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 71 treesize of output 75 [2025-02-08 06:41:49,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100634299] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:49,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 43 [2025-02-08 06:41:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537666788] [2025-02-08 06:41:49,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:49,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-08 06:41:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:49,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-08 06:41:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2736, Unknown=35, NotChecked=106, Total=3080 [2025-02-08 06:41:49,045 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:41:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:49,853 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2025-02-08 06:41:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:41:49,853 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-02-08 06:41:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:49,854 INFO L225 Difference]: With dead ends: 110 [2025-02-08 06:41:49,854 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 06:41:49,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=248, Invalid=3501, Unknown=37, NotChecked=120, Total=3906 [2025-02-08 06:41:49,855 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:49,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 582 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 06:41:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 06:41:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2025-02-08 06:41:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 104 states have internal predecessors, (115), 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:41:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-02-08 06:41:49,858 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 57 [2025-02-08 06:41:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:49,859 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-02-08 06:41:49,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:41:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-02-08 06:41:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:41:49,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:49,860 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, 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:41:49,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:50,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-02-08 06:41:50,064 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:50,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -812268320, now seen corresponding path program 1 times [2025-02-08 06:41:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:50,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687690185] [2025-02-08 06:41:50,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:41:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:41:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687690185] [2025-02-08 06:41:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687690185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156511202] [2025-02-08 06:41:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:50,167 INFO L229 MonitoredProcess]: Starting monitored process 23 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:41:50,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-08 06:41:50,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:41:50,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:41:50,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:50,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:50,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:41:50,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:41:50,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156511202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-08 06:41:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677694270] [2025-02-08 06:41:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:50,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:50,550 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:41:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:50,564 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2025-02-08 06:41:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 63 [2025-02-08 06:41:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:50,565 INFO L225 Difference]: With dead ends: 57 [2025-02-08 06:41:50,565 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 06:41:50,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:50,565 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:50,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 06:41:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-08 06:41:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.0) internal successors, (53), 53 states have internal predecessors, (53), 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:41:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2025-02-08 06:41:50,568 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 63 [2025-02-08 06:41:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2025-02-08 06:41:50,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:41:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2025-02-08 06:41:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-08 06:41:50,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:50,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:50,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:50,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-02-08 06:41:50,773 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 06:41:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash 589465087, now seen corresponding path program 1 times [2025-02-08 06:41:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251883378] [2025-02-08 06:41:50,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:50,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:41:50,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:41:50,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:50,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251883378] [2025-02-08 06:41:53,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251883378] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:53,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016998090] [2025-02-08 06:41:53,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:53,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:53,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:53,053 INFO L229 MonitoredProcess]: Starting monitored process 24 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:41:53,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-08 06:41:53,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 06:41:53,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 06:41:53,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:53,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:53,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-02-08 06:41:53,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:53,417 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:41:53,569 INFO L349 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2025-02-08 06:41:53,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2025-02-08 06:41:53,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 38 [2025-02-08 06:41:53,591 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:41:53,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:41:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:53,812 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 16 treesize of output 11 [2025-02-08 06:41:53,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:53,945 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 16 treesize of output 11 [2025-02-08 06:41:53,955 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 56 treesize of output 43 [2025-02-08 06:41:54,694 INFO L349 Elim1Store]: treesize reduction 48, result has 51.5 percent of original size [2025-02-08 06:41:54,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 116 treesize of output 100 [2025-02-08 06:41:55,222 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 219 treesize of output 195 [2025-02-08 06:41:55,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:55,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:55,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:55,547 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:55,561 INFO L349 Elim1Store]: treesize reduction 75, result has 16.7 percent of original size [2025-02-08 06:41:55,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 101 [2025-02-08 06:41:55,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 34 [2025-02-08 06:41:56,096 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:41:56,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2025-02-08 06:41:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:56,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:57,854 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 8 treesize of output 4 [2025-02-08 06:41:58,073 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 73 treesize of output 59 [2025-02-08 06:41:58,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:58,086 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 94 treesize of output 86 [2025-02-08 06:41:59,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:59,764 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 68 treesize of output 60 [2025-02-08 06:41:59,766 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 211 treesize of output 205 [2025-02-08 06:41:59,772 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 132 treesize of output 128 [2025-02-08 06:41:59,776 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 298 treesize of output 290 [2025-02-08 06:41:59,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:41:59,788 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 173 treesize of output 175 [2025-02-08 06:42:00,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:00,681 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 68 treesize of output 60 [2025-02-08 06:42:00,685 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 435 treesize of output 425 [2025-02-08 06:42:00,692 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 134 treesize of output 130 [2025-02-08 06:42:00,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:00,702 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 173 treesize of output 175 [2025-02-08 06:42:00,711 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 169 treesize of output 161 [2025-02-08 06:42:01,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:01,414 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 39 treesize of output 40 [2025-02-08 06:42:01,417 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 132 treesize of output 128 [2025-02-08 06:42:01,423 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 85 treesize of output 83 [2025-02-08 06:42:01,427 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 195 treesize of output 191 [2025-02-08 06:42:01,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:01,438 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 116 treesize of output 120 [2025-02-08 06:42:01,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:01,978 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 39 treesize of output 40 [2025-02-08 06:42:01,981 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 266 treesize of output 260 [2025-02-08 06:42:01,986 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 86 treesize of output 84 [2025-02-08 06:42:01,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:01,995 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 116 treesize of output 120 [2025-02-08 06:42:02,001 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 110 treesize of output 106 [2025-02-08 06:42:02,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:02,282 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 68 treesize of output 60 [2025-02-08 06:42:02,286 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 435 treesize of output 425 [2025-02-08 06:42:02,293 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 134 treesize of output 130 [2025-02-08 06:42:02,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:02,307 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 173 treesize of output 175 [2025-02-08 06:42:02,317 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 169 treesize of output 161