./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:49:08,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:49:08,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:49:08,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:49:08,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:49:08,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:49:08,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:49:08,230 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:49:08,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:49:08,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:49:08,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:49:08,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:49:08,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:49:08,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:49:08,233 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:49:08,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:49:08,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:49:08,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:49:08,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:49:08,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:08,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:49:08,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:49:08,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:49:08,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2025-02-08 05:49:08,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:49:08,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:49:08,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:49:08,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:49:08,521 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:49:08,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2025-02-08 05:49:09,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bff7c257/78db6f185bec4febbf5a0ce7812d5591/FLAG08da2ce02 [2025-02-08 05:49:10,162 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:49:10,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2025-02-08 05:49:10,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bff7c257/78db6f185bec4febbf5a0ce7812d5591/FLAG08da2ce02 [2025-02-08 05:49:10,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bff7c257/78db6f185bec4febbf5a0ce7812d5591 [2025-02-08 05:49:10,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:49:10,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:49:10,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:10,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:49:10,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:49:10,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10, skipping insertion in model container [2025-02-08 05:49:10,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:49:10,535 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 05:49:10,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:10,556 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:49:10,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:10,651 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:49:10,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10 WrapperNode [2025-02-08 05:49:10,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:10,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:10,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:49:10,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:49:10,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,704 INFO L138 Inliner]: procedures = 226, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-02-08 05:49:10,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:10,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:49:10,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:49:10,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:49:10,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,739 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-02-08 05:49:10,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:49:10,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:49:10,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:49:10,759 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:49:10,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (1/1) ... [2025-02-08 05:49:10,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:10,787 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 05:49:10,790 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 05:49:10,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:49:10,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2025-02-08 05:49:10,812 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:49:10,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:49:10,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:49:10,947 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:49:10,950 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:49:11,156 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-08 05:49:11,157 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:49:11,168 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:49:11,169 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:49:11,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:11 BoogieIcfgContainer [2025-02-08 05:49:11,169 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:49:11,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:49:11,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:49:11,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:49:11,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:49:10" (1/3) ... [2025-02-08 05:49:11,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38978d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:11, skipping insertion in model container [2025-02-08 05:49:11,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:10" (2/3) ... [2025-02-08 05:49:11,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38978d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:11, skipping insertion in model container [2025-02-08 05:49:11,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:11" (3/3) ... [2025-02-08 05:49:11,182 INFO L128 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2025-02-08 05:49:11,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:49:11,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_search-2.i that has 2 procedures, 34 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-02-08 05:49:11,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:49:11,235 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;@5a9b9ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:49:11,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:49:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 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 05:49:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 05:49:11,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:11,247 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:11,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:11,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:11,253 INFO L85 PathProgramCache]: Analyzing trace with hash -145503421, now seen corresponding path program 1 times [2025-02-08 05:49:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633134458] [2025-02-08 05:49:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:11,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:49:11,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:49:11,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:11,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633134458] [2025-02-08 05:49:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633134458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913904592] [2025-02-08 05:49:11,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:11,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:11,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:11,839 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 05:49:11,841 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 05:49:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:49:12,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:49:12,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:12,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 05:49:12,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 05:49:12,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913904592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:12,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:12,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2025-02-08 05:49:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214596877] [2025-02-08 05:49:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:12,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:49:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:12,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:49:12,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:12,105 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.5) internal successors, (39), 28 states have internal predecessors, (39), 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) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:12,115 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-02-08 05:49:12,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:49:12,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2025-02-08 05:49:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:12,120 INFO L225 Difference]: With dead ends: 33 [2025-02-08 05:49:12,120 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 05:49:12,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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 05:49:12,123 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:12,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 05:49:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 05:49:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 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 05:49:12,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-02-08 05:49:12,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 35 [2025-02-08 05:49:12,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:12,159 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-02-08 05:49:12,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:12,159 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-02-08 05:49:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 05:49:12,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:12,161 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:12,170 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 05:49:12,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 05:49:12,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1194115007, now seen corresponding path program 1 times [2025-02-08 05:49:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:12,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-02-08 05:49:12,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:12,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:49:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:49:12,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:12,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434297073] [2025-02-08 05:49:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434297073] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059137269] [2025-02-08 05:49:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:12,589 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 05:49:12,591 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 05:49:12,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:49:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:49:12,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:12,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 05:49:12,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:12,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 05:49:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059137269] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:12,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-02-08 05:49:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197224616] [2025-02-08 05:49:12,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:49:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:12,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:49:12,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:12,944 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:13,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:13,063 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-02-08 05:49:13,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:49:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 37 [2025-02-08 05:49:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:13,065 INFO L225 Difference]: With dead ends: 41 [2025-02-08 05:49:13,065 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 05:49:13,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:49:13,066 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 57 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:13,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 128 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:13,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 05:49:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-02-08 05:49:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2025-02-08 05:49:13,078 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 37 [2025-02-08 05:49:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:13,078 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-02-08 05:49:13,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2025-02-08 05:49:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 05:49:13,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:13,080 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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 05:49:13,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:49:13,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:13,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1453501792, now seen corresponding path program 1 times [2025-02-08 05:49:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051809259] [2025-02-08 05:49:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 05:49:13,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 05:49:13,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:13,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:13,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051809259] [2025-02-08 05:49:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051809259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:49:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532172894] [2025-02-08 05:49:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:49:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:13,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:49:13,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:13,420 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:13,484 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-02-08 05:49:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:49:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2025-02-08 05:49:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:13,485 INFO L225 Difference]: With dead ends: 43 [2025-02-08 05:49:13,485 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 05:49:13,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:13,486 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:13,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 100 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 05:49:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-02-08 05:49:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-02-08 05:49:13,491 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 37 [2025-02-08 05:49:13,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:13,491 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-08 05:49:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-02-08 05:49:13,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 05:49:13,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:13,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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 05:49:13,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:49:13,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:13,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:13,495 INFO L85 PathProgramCache]: Analyzing trace with hash 468303826, now seen corresponding path program 1 times [2025-02-08 05:49:13,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:13,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-02-08 05:49:13,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:13,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:49:13,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:49:13,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:13,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15139490] [2025-02-08 05:49:13,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15139490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278595487] [2025-02-08 05:49:13,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:13,759 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 05:49:13,761 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 05:49:13,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:49:13,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:49:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:13,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:13,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 05:49:13,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:49:13,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:13,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278595487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:13,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:13,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 9 [2025-02-08 05:49:13,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610106869] [2025-02-08 05:49:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:13,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:49:13,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:13,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:49:13,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:49:13,965 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:14,061 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-02-08 05:49:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-08 05:49:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:14,063 INFO L225 Difference]: With dead ends: 47 [2025-02-08 05:49:14,063 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 05:49:14,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:49:14,063 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:14,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 129 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 05:49:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-02-08 05:49:14,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-02-08 05:49:14,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 38 [2025-02-08 05:49:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-02-08 05:49:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-02-08 05:49:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 05:49:14,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:14,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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 05:49:14,082 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 05:49:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:14,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash 439674675, now seen corresponding path program 1 times [2025-02-08 05:49:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-02-08 05:49:14,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:49:14,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:49:14,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:14,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 05:49:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962864379] [2025-02-08 05:49:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962864379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:49:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263071501] [2025-02-08 05:49:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:49:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:14,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:49:14,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:14,567 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:14,611 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2025-02-08 05:49:14,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:49:14,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 38 [2025-02-08 05:49:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:14,612 INFO L225 Difference]: With dead ends: 44 [2025-02-08 05:49:14,612 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 05:49:14,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:14,613 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:14,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 05:49:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 05:49:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-02-08 05:49:14,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 38 [2025-02-08 05:49:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:14,618 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-02-08 05:49:14,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-02-08 05:49:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 05:49:14,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:14,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:14,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:49:14,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:14,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1278138412, now seen corresponding path program 1 times [2025-02-08 05:49:14,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:14,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-02-08 05:49:14,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:14,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:14,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:49:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:49:14,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:49:15,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-02-08 05:49:15,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169925182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:15,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:15,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:49:15,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491000964] [2025-02-08 05:49:15,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:15,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:15,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:15,083 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:15,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:15,289 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2025-02-08 05:49:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:49:15,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2025-02-08 05:49:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:15,290 INFO L225 Difference]: With dead ends: 47 [2025-02-08 05:49:15,291 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 05:49:15,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:49:15,292 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:15,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 109 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:15,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 05:49:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-02-08 05:49:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 38 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-02-08 05:49:15,299 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 41 [2025-02-08 05:49:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:15,300 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-02-08 05:49:15,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 05:49:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-02-08 05:49:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 05:49:15,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:15,301 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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 05:49:15,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:49:15,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:15,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1701861278, now seen corresponding path program 1 times [2025-02-08 05:49:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:15,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-02-08 05:49:15,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:15,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:49:15,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:49:15,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:15,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:49:15,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:15,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636422369] [2025-02-08 05:49:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636422369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729907450] [2025-02-08 05:49:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:15,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:15,898 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 05:49:15,899 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 05:49:16,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:49:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:49:16,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:16,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 05:49:16,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:16,137 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 13 treesize of output 9 [2025-02-08 05:49:16,236 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 8 [2025-02-08 05:49:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:49:16,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:49:16,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729907450] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:16,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:16,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-08 05:49:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741935814] [2025-02-08 05:49:16,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:16,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:49:16,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:16,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:49:16,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:49:16,447 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 05:49:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:17,194 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-08 05:49:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 05:49:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 41 [2025-02-08 05:49:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:17,196 INFO L225 Difference]: With dead ends: 59 [2025-02-08 05:49:17,196 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 05:49:17,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 05:49:17,198 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:17,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 303 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:49:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 05:49:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2025-02-08 05:49:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2025-02-08 05:49:17,206 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 41 [2025-02-08 05:49:17,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:17,206 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2025-02-08 05:49:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 21 states have internal predecessors, (52), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 05:49:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2025-02-08 05:49:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 05:49:17,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:17,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:17,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:49:17,410 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,SelfDestructingSolverStorable6 [2025-02-08 05:49:17,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -339157216, now seen corresponding path program 2 times [2025-02-08 05:49:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-02-08 05:49:17,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:17,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 05:49:17,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:49:17,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106920700] [2025-02-08 05:49:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106920700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78496396] [2025-02-08 05:49:18,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:18,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:18,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:18,652 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 05:49:18,654 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 05:49:18,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-08 05:49:18,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:49:18,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-08 05:49:18,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:18,852 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 05:49:18,866 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 05:49:18,972 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 05:49:18,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:19,062 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 05:49:19,063 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 15 [2025-02-08 05:49:19,071 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 21 treesize of output 16 [2025-02-08 05:49:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:49:19,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:19,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:19,487 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-02-08 05:49:19,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78496396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:19,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 26 [2025-02-08 05:49:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338495021] [2025-02-08 05:49:19,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 05:49:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:19,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 05:49:19,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-02-08 05:49:19,564 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:49:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:20,627 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2025-02-08 05:49:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 05:49:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-02-08 05:49:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:20,629 INFO L225 Difference]: With dead ends: 65 [2025-02-08 05:49:20,629 INFO L226 Difference]: Without dead ends: 65 [2025-02-08 05:49:20,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=357, Invalid=2295, Unknown=0, NotChecked=0, Total=2652 [2025-02-08 05:49:20,631 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 127 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:20,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 234 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:49:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-08 05:49:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2025-02-08 05:49:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2025-02-08 05:49:20,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 45 [2025-02-08 05:49:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:20,636 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2025-02-08 05:49:20,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 23 states have internal predecessors, (49), 3 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:49:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2025-02-08 05:49:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 05:49:20,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:20,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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 05:49:20,646 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 05:49:20,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:20,838 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:20,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:20,840 INFO L85 PathProgramCache]: Analyzing trace with hash -914160286, now seen corresponding path program 1 times [2025-02-08 05:49:20,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:20,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812909509] [2025-02-08 05:49:20,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:20,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:49:20,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:49:20,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:20,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-08 05:49:21,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:21,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812909509] [2025-02-08 05:49:21,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812909509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722568983] [2025-02-08 05:49:21,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:21,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:21,128 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 05:49:21,158 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 05:49:21,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:49:21,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:49:21,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:21,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:21,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 05:49:21,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:21,335 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 05:49:21,401 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 13 treesize of output 9 [2025-02-08 05:49:21,455 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-08 05:49:21,455 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 17 treesize of output 17 [2025-02-08 05:49:21,537 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 8 [2025-02-08 05:49:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:49:21,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 05:49:21,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722568983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:21,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:21,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 28 [2025-02-08 05:49:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996709155] [2025-02-08 05:49:21,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:21,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 05:49:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:21,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 05:49:21,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2025-02-08 05:49:21,845 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 26 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:22,578 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2025-02-08 05:49:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 05:49:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 26 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 47 [2025-02-08 05:49:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:22,579 INFO L225 Difference]: With dead ends: 76 [2025-02-08 05:49:22,579 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 05:49:22,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2025-02-08 05:49:22,581 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 172 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:22,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 246 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:49:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 05:49:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2025-02-08 05:49:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 05:49:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2025-02-08 05:49:22,591 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 47 [2025-02-08 05:49:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:22,591 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2025-02-08 05:49:22,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 26 states have internal predecessors, (63), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 05:49:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2025-02-08 05:49:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 05:49:22,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:22,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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 05:49:22,602 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 05:49:22,792 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,SelfDestructingSolverStorable8 [2025-02-08 05:49:22,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1300301215, now seen corresponding path program 1 times [2025-02-08 05:49:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:22,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-02-08 05:49:22,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:49:22,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:22,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:22,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-02-08 05:49:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736752545] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352756565] [2025-02-08 05:49:23,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:23,742 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 05:49:23,743 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 05:49:23,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:49:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-08 05:49:23,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:24,019 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 05:49:24,171 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 05:49:24,176 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:24,277 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:24,277 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 21 treesize of output 24 [2025-02-08 05:49:24,480 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 7 treesize of output 3 [2025-02-08 05:49:24,762 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 05:49:24,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 26 [2025-02-08 05:49:24,832 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 27 treesize of output 11 [2025-02-08 05:49:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 05:49:24,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:25,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:25,312 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2025-02-08 05:49:29,353 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~head~0.offset 4))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (forall ((v_~head~0.base_85 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_85 v_arrayElimArr_4) c_~head~0.base) .cse0) 0)) (= v_~head~0.base_85 c_~head~0.base))) (not (= (select v_arrayElimArr_4 4) c_~head~0.base)))) (or (= c_~head~0.offset 0) (forall ((v_~head~0.base_85 Int) (v_arrayElimArr_4 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| v_~head~0.base_85 v_arrayElimArr_4) c_~head~0.base) .cse0) 0)) (not (= (select v_arrayElimArr_4 4) c_~head~0.base))))))) is different from false [2025-02-08 05:49:29,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352756565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:29,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:29,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2025-02-08 05:49:29,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106909546] [2025-02-08 05:49:29,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:29,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 05:49:29,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:29,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 05:49:29,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1850, Unknown=1, NotChecked=86, Total=2070 [2025-02-08 05:49:29,361 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 38 states, 38 states have (on average 1.894736842105263) internal successors, (72), 35 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 05:49:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:30,769 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-02-08 05:49:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 05:49:30,769 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.894736842105263) internal successors, (72), 35 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 49 [2025-02-08 05:49:30,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:30,770 INFO L225 Difference]: With dead ends: 75 [2025-02-08 05:49:30,770 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 05:49:30,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=449, Invalid=4524, Unknown=1, NotChecked=138, Total=5112 [2025-02-08 05:49:30,772 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 131 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:30,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 392 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 05:49:30,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 05:49:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-02-08 05:49:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 54 states have internal predecessors, (65), 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 05:49:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2025-02-08 05:49:30,776 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 49 [2025-02-08 05:49:30,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:30,776 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2025-02-08 05:49:30,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.894736842105263) internal successors, (72), 35 states have internal predecessors, (72), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 05:49:30,776 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2025-02-08 05:49:30,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 05:49:30,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:30,777 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:30,786 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 05:49:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:30,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1147080542, now seen corresponding path program 3 times [2025-02-08 05:49:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398210509] [2025-02-08 05:49:30,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:30,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes. [2025-02-08 05:49:31,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:31,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:31,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398210509] [2025-02-08 05:49:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398210509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:32,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863699442] [2025-02-08 05:49:32,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:32,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:32,546 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 05:49:32,548 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 05:49:32,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 4 equivalence classes. [2025-02-08 05:49:32,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:49:32,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-08 05:49:32,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:32,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-08 05:49:32,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:32,890 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 05:49:32,928 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 05:49:33,063 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:33,068 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 05:49:33,174 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:33,174 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 21 treesize of output 24 [2025-02-08 05:49:33,192 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-02-08 05:49:33,193 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 21 treesize of output 29 [2025-02-08 05:49:33,277 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:33,287 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:33,366 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:33,366 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 20 treesize of output 23 [2025-02-08 05:49:33,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:33,384 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 05:49:33,384 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2025-02-08 05:49:33,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:33,393 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-02-08 05:49:33,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2025-02-08 05:49:33,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:33,697 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 19 treesize of output 7 [2025-02-08 05:49:33,803 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-02-08 05:49:33,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2025-02-08 05:49:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:49:33,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:34,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:34,125 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-02-08 05:49:34,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:34,129 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2025-02-08 05:49:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863699442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:34,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 41 [2025-02-08 05:49:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494231997] [2025-02-08 05:49:34,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 05:49:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:34,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 05:49:34,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2009, Unknown=1, NotChecked=0, Total=2162 [2025-02-08 05:49:34,185 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 05:49:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:37,049 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2025-02-08 05:49:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-08 05:49:37,049 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 49 [2025-02-08 05:49:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:37,050 INFO L225 Difference]: With dead ends: 91 [2025-02-08 05:49:37,050 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 05:49:37,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=767, Invalid=5874, Unknown=1, NotChecked=0, Total=6642 [2025-02-08 05:49:37,052 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 222 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:37,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 508 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 05:49:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 05:49:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2025-02-08 05:49:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2025-02-08 05:49:37,056 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 49 [2025-02-08 05:49:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:37,057 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2025-02-08 05:49:37,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 05:49:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2025-02-08 05:49:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 05:49:37,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:37,057 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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 05:49:37,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 05:49:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:37,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:37,259 INFO L85 PathProgramCache]: Analyzing trace with hash 980782368, now seen corresponding path program 2 times [2025-02-08 05:49:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755496496] [2025-02-08 05:49:37,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:37,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-02-08 05:49:37,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:49:37,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 05:49:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755496496] [2025-02-08 05:49:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755496496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692359572] [2025-02-08 05:49:37,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:37,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:37,582 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 05:49:37,584 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 05:49:37,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-02-08 05:49:37,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:49:37,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:37,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:37,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 05:49:37,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:37,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-08 05:49:37,936 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 9 treesize of output 3 [2025-02-08 05:49:37,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:37,954 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 29 treesize of output 29 [2025-02-08 05:49:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 05:49:38,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:38,134 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 10 treesize of output 4 [2025-02-08 05:49:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-08 05:49:38,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692359572] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:38,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:38,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 27 [2025-02-08 05:49:38,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35313526] [2025-02-08 05:49:38,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:38,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 05:49:38,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:38,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 05:49:38,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-02-08 05:49:38,302 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 05:49:38,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:38,659 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2025-02-08 05:49:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:49:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2025-02-08 05:49:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:38,661 INFO L225 Difference]: With dead ends: 90 [2025-02-08 05:49:38,661 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 05:49:38,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 05:49:38,662 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:38,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 247 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:49:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 05:49:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2025-02-08 05:49:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 68 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2025-02-08 05:49:38,666 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 51 [2025-02-08 05:49:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2025-02-08 05:49:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-08 05:49:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2025-02-08 05:49:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 05:49:38,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:38,668 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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 05:49:38,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 05:49:38,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:38,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:38,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:38,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1326544225, now seen corresponding path program 2 times [2025-02-08 05:49:38,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:38,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-02-08 05:49:38,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:38,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:38,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-08 05:49:38,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:49:38,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:38,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 05:49:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947834570] [2025-02-08 05:49:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947834570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126507359] [2025-02-08 05:49:39,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:39,797 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 05:49:39,799 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 05:49:39,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-02-08 05:49:39,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:49:39,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:39,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:39,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-08 05:49:39,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:39,995 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 05:49:40,026 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 22 treesize of output 7 [2025-02-08 05:49:40,160 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 05:49:40,168 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 05:49:40,252 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:40,252 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 24 treesize of output 27 [2025-02-08 05:49:40,256 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 3 [2025-02-08 05:49:40,265 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 05:49:40,265 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 15 [2025-02-08 05:49:40,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:40,502 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 40 treesize of output 40 [2025-02-08 05:49:40,677 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 05:49:40,678 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 27 [2025-02-08 05:49:40,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-08 05:49:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:40,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:41,052 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 28 treesize of output 22 [2025-02-08 05:49:41,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126507359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:41,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2025-02-08 05:49:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311795132] [2025-02-08 05:49:41,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 05:49:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:41,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 05:49:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1676, Unknown=0, NotChecked=0, Total=1806 [2025-02-08 05:49:41,098 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:49:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:42,032 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2025-02-08 05:49:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 05:49:42,033 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2025-02-08 05:49:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:42,034 INFO L225 Difference]: With dead ends: 92 [2025-02-08 05:49:42,034 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 05:49:42,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=392, Invalid=3768, Unknown=0, NotChecked=0, Total=4160 [2025-02-08 05:49:42,035 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 64 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:42,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 335 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 05:49:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 05:49:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2025-02-08 05:49:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 72 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2025-02-08 05:49:42,041 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 53 [2025-02-08 05:49:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:42,041 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2025-02-08 05:49:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 33 states have internal predecessors, (64), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 05:49:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2025-02-08 05:49:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-08 05:49:42,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:42,042 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:42,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 05:49:42,244 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,SelfDestructingSolverStorable12 [2025-02-08 05:49:42,245 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:42,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:42,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1173323552, now seen corresponding path program 4 times [2025-02-08 05:49:42,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:42,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124130086] [2025-02-08 05:49:42,245 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:42,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:42,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-08 05:49:42,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 53 statements. [2025-02-08 05:49:42,285 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:42,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:44,699 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 49 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:49:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124130086] [2025-02-08 05:49:44,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124130086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:44,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801481004] [2025-02-08 05:49:44,700 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:44,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:44,702 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 05:49:44,705 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 05:49:44,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-02-08 05:49:44,908 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 48 of 53 statements. [2025-02-08 05:49:44,908 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:44,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:44,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-02-08 05:49:44,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:44,927 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 05:49:44,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-08 05:49:45,018 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 05:49:45,025 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 05:49:45,151 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:45,151 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 20 treesize of output 23 [2025-02-08 05:49:45,169 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2025-02-08 05:49:45,170 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 21 treesize of output 29 [2025-02-08 05:49:45,362 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:45,372 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:45,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,600 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 53 treesize of output 36 [2025-02-08 05:49:45,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,621 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2025-02-08 05:49:45,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2025-02-08 05:49:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 05:49:45,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,646 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 20 treesize of output 15 [2025-02-08 05:49:45,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:45,785 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:45,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,961 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 05:49:45,961 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 70 [2025-02-08 05:49:45,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,973 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2025-02-08 05:49:45,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2025-02-08 05:49:45,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:45,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-08 05:49:45,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-02-08 05:49:46,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:46,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:46,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:46,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2025-02-08 05:49:46,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2025-02-08 05:49:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-08 05:49:46,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:47,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:47,166 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 156 [2025-02-08 05:49:47,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:47,170 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 138 [2025-02-08 05:49:47,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801481004] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:47,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 43 [2025-02-08 05:49:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127464463] [2025-02-08 05:49:47,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:47,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-08 05:49:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-08 05:49:47,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2311, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 05:49:47,294 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:49,893 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-02-08 05:49:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 05:49:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 53 [2025-02-08 05:49:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:49,894 INFO L225 Difference]: With dead ends: 71 [2025-02-08 05:49:49,894 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 05:49:49,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=299, Invalid=4257, Unknown=0, NotChecked=0, Total=4556 [2025-02-08 05:49:49,896 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:49,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 363 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 05:49:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 05:49:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2025-02-08 05:49:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2025-02-08 05:49:49,899 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 53 [2025-02-08 05:49:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:49,899 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2025-02-08 05:49:49,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 41 states have internal predecessors, (72), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2025-02-08 05:49:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 05:49:49,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:49,900 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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 05:49:49,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:50,100 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,SelfDestructingSolverStorable13 [2025-02-08 05:49:50,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:50,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1830691934, now seen corresponding path program 1 times [2025-02-08 05:49:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-02-08 05:49:50,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:50,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:49:50,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:49:50,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:50,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 05:49:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293031437] [2025-02-08 05:49:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293031437] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911555156] [2025-02-08 05:49:51,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:51,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:51,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:51,114 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 05:49:51,115 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 05:49:51,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:49:51,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:49:51,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:51,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:51,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-08 05:49:51,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:51,330 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 22 treesize of output 1 [2025-02-08 05:49:51,414 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 05:49:51,445 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 05:49:51,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:51,530 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:51,531 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 20 treesize of output 23 [2025-02-08 05:49:51,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:51,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:51,776 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:51,776 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 20 treesize of output 23 [2025-02-08 05:49:51,791 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:51,791 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 40 treesize of output 37 [2025-02-08 05:49:51,801 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2025-02-08 05:49:51,802 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 28 treesize of output 29 [2025-02-08 05:49:51,814 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 05:49:51,816 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 05:49:51,818 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 05:49:51,824 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 05:49:51,824 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 15 [2025-02-08 05:49:52,277 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 50 treesize of output 34 [2025-02-08 05:49:52,650 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 05:49:52,651 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2025-02-08 05:49:52,653 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 15 treesize of output 7 [2025-02-08 05:49:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 05:49:52,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:53,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:53,285 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 94 [2025-02-08 05:49:53,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:53,289 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 85 [2025-02-08 05:49:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911555156] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:53,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 05:49:53,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 46 [2025-02-08 05:49:53,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498875263] [2025-02-08 05:49:53,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:53,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 05:49:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:53,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 05:49:53,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2973, Unknown=0, NotChecked=0, Total=3192 [2025-02-08 05:49:53,632 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 46 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 05:49:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:55,572 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-02-08 05:49:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 05:49:55,573 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 55 [2025-02-08 05:49:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:55,573 INFO L225 Difference]: With dead ends: 76 [2025-02-08 05:49:55,574 INFO L226 Difference]: Without dead ends: 72 [2025-02-08 05:49:55,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=589, Invalid=6893, Unknown=0, NotChecked=0, Total=7482 [2025-02-08 05:49:55,576 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:55,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 337 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 05:49:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-08 05:49:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2025-02-08 05:49:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 05:49:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-02-08 05:49:55,579 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 55 [2025-02-08 05:49:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:55,580 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-02-08 05:49:55,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 43 states have internal predecessors, (81), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-08 05:49:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-02-08 05:49:55,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 05:49:55,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:55,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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 05:49:55,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 05:49:55,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:55,781 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:55,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:55,782 INFO L85 PathProgramCache]: Analyzing trace with hash -482399470, now seen corresponding path program 2 times [2025-02-08 05:49:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:55,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-02-08 05:49:55,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:55,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 05:49:55,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:49:55,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:55,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:49:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032952901] [2025-02-08 05:49:56,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032952901] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279596153] [2025-02-08 05:49:56,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:56,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:56,515 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 05:49:56,516 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 05:49:56,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-02-08 05:49:56,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 05:49:56,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-02-08 05:49:56,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:56,770 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 22 treesize of output 1 [2025-02-08 05:49:56,853 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 05:49:56,883 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 05:49:56,889 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 05:49:56,965 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:56,966 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 20 treesize of output 23 [2025-02-08 05:49:57,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:57,087 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 05:49:57,196 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 05:49:57,197 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 20 treesize of output 23 [2025-02-08 05:49:57,206 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 05:49:57,206 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 15 [2025-02-08 05:49:57,210 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 40 treesize of output 29 [2025-02-08 05:49:57,221 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-02-08 05:49:57,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 1 case distinctions, treesize of input 40 treesize of output 47 [2025-02-08 05:49:57,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:57,712 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 50 treesize of output 54 [2025-02-08 05:49:58,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:49:58,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 144 treesize of output 286 [2025-02-08 05:49:58,812 INFO L349 Elim1Store]: treesize reduction 8, result has 95.5 percent of original size [2025-02-08 05:49:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 192 treesize of output 279