./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:15:50,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:15:50,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:15:50,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:15:50,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:15:50,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:15:50,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:15:50,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:15:50,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:15:50,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:15:50,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:15:50,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:15:50,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:15:50,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:50,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:15:50,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:15:50,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2025-03-08 22:15:50,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:15:50,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:15:50,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:15:50,385 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:15:50,385 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:15:50,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-03-08 22:15:51,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a938fdb6e/2fc459477eb34acf90c5376f443ab53d/FLAGd827dc895 [2025-03-08 22:15:51,768 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:15:51,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2025-03-08 22:15:51,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a938fdb6e/2fc459477eb34acf90c5376f443ab53d/FLAGd827dc895 [2025-03-08 22:15:51,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a938fdb6e/2fc459477eb34acf90c5376f443ab53d [2025-03-08 22:15:51,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:15:51,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:15:51,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:51,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:15:51,806 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:15:51,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:51" (1/1) ... [2025-03-08 22:15:51,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba84f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:51, skipping insertion in model container [2025-03-08 22:15:51,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:51" (1/1) ... [2025-03-08 22:15:51,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:15:52,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:52,072 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:15:52,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:52,139 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:15:52,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52 WrapperNode [2025-03-08 22:15:52,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:52,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:52,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:15:52,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:15:52,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,180 INFO L138 Inliner]: procedures = 119, calls = 47, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2025-03-08 22:15:52,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:52,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:15:52,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:15:52,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:15:52,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,204 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 16 writes are split as follows [0, 16]. [2025-03-08 22:15:52,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:15:52,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:15:52,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:15:52,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:15:52,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (1/1) ... [2025-03-08 22:15:52,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:52,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:15:52,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:15:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 22:15:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:15:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:15:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:15:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:15:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:15:52,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:15:52,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:15:52,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:15:52,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:15:52,574 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-08 22:15:52,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:15:52,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:15:52,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:15:52,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:52 BoogieIcfgContainer [2025-03-08 22:15:52,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:15:52,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:15:52,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:15:52,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:15:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:15:51" (1/3) ... [2025-03-08 22:15:52,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d454baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:52, skipping insertion in model container [2025-03-08 22:15:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:52" (2/3) ... [2025-03-08 22:15:52,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d454baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:52, skipping insertion in model container [2025-03-08 22:15:52,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:52" (3/3) ... [2025-03-08 22:15:52,588 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2025-03-08 22:15:52,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:15:52,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-buckets-2.i that has 2 procedures, 49 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-08 22:15:52,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:15:52,634 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;@7b2373e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:15:52,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:15:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 40 states have (on average 1.725) internal successors, (69), 42 states have internal predecessors, (69), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 22:15:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 22:15:52,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:52,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 22:15:52,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1071404018, now seen corresponding path program 1 times [2025-03-08 22:15:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697635209] [2025-03-08 22:15:52,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:52,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 22:15:52,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 22:15:52,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:52,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:52,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697635209] [2025-03-08 22:15:52,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697635209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:52,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:15:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547706759] [2025-03-08 22:15:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:52,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 22:15:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:52,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 22:15:52,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:15:52,858 INFO L87 Difference]: Start difference. First operand has 49 states, 40 states have (on average 1.725) internal successors, (69), 42 states have internal predecessors, (69), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:52,869 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2025-03-08 22:15:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 22:15:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 22:15:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:52,874 INFO L225 Difference]: With dead ends: 42 [2025-03-08 22:15:52,874 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 22:15:52,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 22:15:52,878 INFO L435 NwaCegarLoop]: 53 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, 53 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-03-08 22:15:52,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 22:15:52,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 22:15:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.393939393939394) internal successors, (46), 38 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2025-03-08 22:15:52,905 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 6 [2025-03-08 22:15:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:52,905 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2025-03-08 22:15:52,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2025-03-08 22:15:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:15:52,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:52,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:52,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:15:52,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1146651133, now seen corresponding path program 1 times [2025-03-08 22:15:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:52,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370432315] [2025-03-08 22:15:52,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:52,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:15:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:15:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:53,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:53,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370432315] [2025-03-08 22:15:53,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370432315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:53,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:53,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:15:53,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241711134] [2025-03-08 22:15:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:53,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:15:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:53,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:15:53,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:15:53,101 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:53,166 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-08 22:15:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:15:53,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 22:15:53,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:53,169 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:15:53,169 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:15:53,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:15:53,170 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 53 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:53,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:15:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2025-03-08 22:15:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 41 states have internal predecessors, (50), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2025-03-08 22:15:53,176 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 7 [2025-03-08 22:15:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:53,176 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2025-03-08 22:15:53,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2025-03-08 22:15:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:15:53,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:53,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:15:53,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:53,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1553095905, now seen corresponding path program 1 times [2025-03-08 22:15:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703830976] [2025-03-08 22:15:53,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:53,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:53,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:15:53,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:15:53,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:53,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:53,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:53,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703830976] [2025-03-08 22:15:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703830976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:15:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499728608] [2025-03-08 22:15:53,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:15:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:15:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:15:53,249 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:53,278 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-03-08 22:15:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:15:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 22:15:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:53,281 INFO L225 Difference]: With dead ends: 42 [2025-03-08 22:15:53,281 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 22:15:53,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:15:53,281 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:53,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 22:15:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 22:15:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 40 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-08 22:15:53,286 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 11 [2025-03-08 22:15:53,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:53,286 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-08 22:15:53,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-08 22:15:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:15:53,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:53,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:53,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:15:53,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:53,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:53,287 INFO L85 PathProgramCache]: Analyzing trace with hash -922407466, now seen corresponding path program 1 times [2025-03-08 22:15:53,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:53,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422695208] [2025-03-08 22:15:53,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:53,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:53,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:15:53,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:15:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:53,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:53,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422695208] [2025-03-08 22:15:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422695208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:53,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:15:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725201142] [2025-03-08 22:15:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:53,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:15:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:53,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:15:53,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:15:53,887 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:54,009 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-03-08 22:15:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:15:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:15:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:54,011 INFO L225 Difference]: With dead ends: 49 [2025-03-08 22:15:54,011 INFO L226 Difference]: Without dead ends: 49 [2025-03-08 22:15:54,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:15:54,014 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:54,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:15:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-08 22:15:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-03-08 22:15:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 45 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2025-03-08 22:15:54,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 12 [2025-03-08 22:15:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:54,019 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2025-03-08 22:15:54,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2025-03-08 22:15:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:15:54,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:54,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:15:54,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:54,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2075076714, now seen corresponding path program 1 times [2025-03-08 22:15:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:54,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650179665] [2025-03-08 22:15:54,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:54,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:15:54,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:15:54,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:54,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650179665] [2025-03-08 22:15:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650179665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:54,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:15:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344337227] [2025-03-08 22:15:54,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:54,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:15:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:54,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:15:54,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:15:54,065 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:54,088 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-03-08 22:15:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:15:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:15:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:54,089 INFO L225 Difference]: With dead ends: 46 [2025-03-08 22:15:54,089 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 22:15:54,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:15:54,089 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:54,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 22:15:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 22:15:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 44 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-08 22:15:54,095 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 12 [2025-03-08 22:15:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-08 22:15:54,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-08 22:15:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:15:54,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:54,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:15:54,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:54,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash -902488659, now seen corresponding path program 1 times [2025-03-08 22:15:54,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:54,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368724324] [2025-03-08 22:15:54,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:54,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:54,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:15:54,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:15:54,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:54,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:54,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:54,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368724324] [2025-03-08 22:15:54,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368724324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:54,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478606119] [2025-03-08 22:15:54,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:54,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:54,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:54,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:54,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:15:54,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:15:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:15:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:54,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:54,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 22:15:54,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:54,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:54,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-08 22:15:54,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:15:54,507 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-03-08 22:15:54,507 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 34 [2025-03-08 22:15:54,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 22:15:54,523 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:15:54,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:15:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-08 22:15:54,614 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 24 treesize of output 12 [2025-03-08 22:15:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:54,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478606119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:54,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2025-03-08 22:15:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727154267] [2025-03-08 22:15:54,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:15:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:54,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:15:54,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:15:54,647 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:54,741 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-03-08 22:15:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:15:54,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 22:15:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:54,742 INFO L225 Difference]: With dead ends: 59 [2025-03-08 22:15:54,742 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 22:15:54,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:15:54,743 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:54,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 146 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:15:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 22:15:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2025-03-08 22:15:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 47 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-08 22:15:54,747 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 12 [2025-03-08 22:15:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:54,748 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-08 22:15:54,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-08 22:15:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:15:54,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:54,748 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:54,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:15:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 22:15:54,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash 942039078, now seen corresponding path program 1 times [2025-03-08 22:15:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713028553] [2025-03-08 22:15:54,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:54,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:54,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:15:54,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:15:54,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713028553] [2025-03-08 22:15:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713028553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369713652] [2025-03-08 22:15:55,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:55,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:55,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:55,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:15:55,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:15:55,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:15:55,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:55,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:55,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 22:15:55,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:55,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-03-08 22:15:55,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2025-03-08 22:15:55,729 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-03-08 22:15:55,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2025-03-08 22:15:55,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2025-03-08 22:15:55,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:55,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:55,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:55,747 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 40 treesize of output 42 [2025-03-08 22:15:55,757 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 22:15:55,757 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 35 treesize of output 27 [2025-03-08 22:15:55,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2025-03-08 22:15:55,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2025-03-08 22:15:55,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2025-03-08 22:15:56,089 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 22:15:56,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 66 [2025-03-08 22:15:56,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2025-03-08 22:15:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:56,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369713652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:56,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-08 22:15:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509058165] [2025-03-08 22:15:56,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 22:15:56,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:56,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 22:15:56,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:15:56,680 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:57,343 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2025-03-08 22:15:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:15:57,344 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:15:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:57,344 INFO L225 Difference]: With dead ends: 66 [2025-03-08 22:15:57,344 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 22:15:57,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:15:57,345 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:57,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 259 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 22:15:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 22:15:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2025-03-08 22:15:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2025-03-08 22:15:57,347 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 17 [2025-03-08 22:15:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:57,347 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2025-03-08 22:15:57,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2025-03-08 22:15:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:15:57,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:57,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:57,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:15:57,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 22:15:57,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:57,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:57,556 INFO L85 PathProgramCache]: Analyzing trace with hash 961957885, now seen corresponding path program 2 times [2025-03-08 22:15:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:57,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184978330] [2025-03-08 22:15:57,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:15:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:57,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 22:15:57,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:15:57,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:15:57,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184978330] [2025-03-08 22:15:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184978330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342536407] [2025-03-08 22:15:57,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:15:57,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:57,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:57,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:57,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:15:57,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 22:15:58,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:15:58,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:15:58,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:58,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 22:15:58,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:58,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-03-08 22:15:58,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2025-03-08 22:15:58,188 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-03-08 22:15:58,188 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 137 [2025-03-08 22:15:58,194 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 10 treesize of output 8 [2025-03-08 22:15:58,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2025-03-08 22:15:58,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:58,209 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-03-08 22:15:58,209 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 1 case distinctions, treesize of input 52 treesize of output 28 [2025-03-08 22:15:58,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:58,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:58,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-08 22:15:58,300 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:15:58,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 33 [2025-03-08 22:15:58,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 22:15:58,360 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-03-08 22:15:58,388 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:15:58,388 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 1 case distinctions, treesize of input 63 treesize of output 33 [2025-03-08 22:15:58,435 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:15:58,435 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 52 treesize of output 23 [2025-03-08 22:15:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:58,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342536407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:58,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-08 22:15:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888404075] [2025-03-08 22:15:58,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:58,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 22:15:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:58,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 22:15:58,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-08 22:15:58,508 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:58,703 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-03-08 22:15:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:15:58,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:15:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:58,704 INFO L225 Difference]: With dead ends: 64 [2025-03-08 22:15:58,704 INFO L226 Difference]: Without dead ends: 64 [2025-03-08 22:15:58,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:15:58,704 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:58,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 199 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:15:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-08 22:15:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2025-03-08 22:15:58,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.24) internal successors, (62), 52 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-03-08 22:15:58,710 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 17 [2025-03-08 22:15:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-03-08 22:15:58,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-03-08 22:15:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:15:58,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:58,710 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:58,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 22:15:58,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:58,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 780802426, now seen corresponding path program 1 times [2025-03-08 22:15:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708603931] [2025-03-08 22:15:58,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:58,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:15:58,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:15:58,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:58,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708603931] [2025-03-08 22:15:59,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708603931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:15:59,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729058586] [2025-03-08 22:15:59,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:15:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:59,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:15:59,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:15:59,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:15:59,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:15:59,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:59,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:59,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:15:59,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:15:59,227 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 22:15:59,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2025-03-08 22:15:59,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2025-03-08 22:15:59,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 22:15:59,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2025-03-08 22:15:59,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:15:59,266 INFO L349 Elim1Store]: treesize reduction 39, result has 2.5 percent of original size [2025-03-08 22:15:59,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2025-03-08 22:15:59,301 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:15:59,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2025-03-08 22:15:59,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-03-08 22:15:59,322 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:15:59,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 22:15:59,346 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 32 treesize of output 23 [2025-03-08 22:15:59,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:15:59,405 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 31 treesize of output 15 [2025-03-08 22:15:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:59,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:15:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:15:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729058586] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:15:59,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:15:59,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-03-08 22:15:59,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456688375] [2025-03-08 22:15:59,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:15:59,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 22:15:59,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:59,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 22:15:59,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=114, Unknown=5, NotChecked=0, Total=156 [2025-03-08 22:15:59,481 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:59,833 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2025-03-08 22:15:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:15:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 22:15:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:59,834 INFO L225 Difference]: With dead ends: 135 [2025-03-08 22:15:59,834 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 22:15:59,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=288, Unknown=5, NotChecked=0, Total=420 [2025-03-08 22:15:59,835 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 332 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:59,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 273 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:15:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 22:15:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 85. [2025-03-08 22:15:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.271604938271605) internal successors, (103), 83 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-03-08 22:15:59,840 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 18 [2025-03-08 22:15:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:59,841 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-03-08 22:15:59,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-03-08 22:15:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 22:15:59,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:59,844 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:59,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:16:00,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:00,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -212182183, now seen corresponding path program 2 times [2025-03-08 22:16:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236115614] [2025-03-08 22:16:00,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:16:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:00,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 22:16:00,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:16:00,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:16:00,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:16:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236115614] [2025-03-08 22:16:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236115614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944440742] [2025-03-08 22:16:00,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:16:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:16:00,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:16:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:16:00,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-08 22:16:00,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 22:16:00,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:16:00,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:00,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 22:16:00,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:16:00,642 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 38 treesize of output 22 [2025-03-08 22:16:00,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:00,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2025-03-08 22:16:00,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-03-08 22:16:00,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-08 22:16:00,665 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 43 treesize of output 22 [2025-03-08 22:16:00,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-03-08 22:16:00,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:00,719 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-08 22:16:00,719 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 16 treesize of output 15 [2025-03-08 22:16:00,734 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 22:16:00,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 22:16:00,755 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 20 [2025-03-08 22:16:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:16:00,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 22:16:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944440742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:16:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 22:16:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-08 22:16:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229169786] [2025-03-08 22:16:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:16:00,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:16:00,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:00,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:16:00,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-08 22:16:00,828 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:16:01,036 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2025-03-08 22:16:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:16:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 22:16:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:16:01,037 INFO L225 Difference]: With dead ends: 152 [2025-03-08 22:16:01,037 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 22:16:01,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-08 22:16:01,038 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:16:01,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 162 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:16:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 22:16:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2025-03-08 22:16:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.2568807339449541) internal successors, (137), 111 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2025-03-08 22:16:01,042 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 20 [2025-03-08 22:16:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:16:01,042 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2025-03-08 22:16:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2025-03-08 22:16:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:16:01,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:16:01,042 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:01,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:16:01,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 22:16:01,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:01,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1478701791, now seen corresponding path program 1 times [2025-03-08 22:16:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:01,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457629116] [2025-03-08 22:16:01,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:16:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:01,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:16:01,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:16:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:01,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:16:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457629116] [2025-03-08 22:16:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457629116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843272732] [2025-03-08 22:16:01,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:16:01,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:01,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:16:01,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:16:01,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 22:16:01,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 22:16:01,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:16:01,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:01,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:01,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 22:16:01,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:16:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:16:01,665 INFO L349 Elim1Store]: treesize reduction 62, result has 7.5 percent of original size [2025-03-08 22:16:01,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 172 treesize of output 137 [2025-03-08 22:16:01,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-03-08 22:16:01,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:01,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:01,674 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 36 treesize of output 16 [2025-03-08 22:16:01,681 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 39 treesize of output 11 [2025-03-08 22:16:01,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 11 [2025-03-08 22:16:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:01,703 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-08 22:16:01,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 33 [2025-03-08 22:16:01,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:01,758 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 44 treesize of output 33 [2025-03-08 22:16:01,770 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 22:16:01,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 22:16:01,777 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 20 treesize of output 15 [2025-03-08 22:16:01,783 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 23 treesize of output 16 [2025-03-08 22:16:01,826 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 25 treesize of output 24 [2025-03-08 22:16:01,830 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 43 treesize of output 32 [2025-03-08 22:16:01,842 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 23 treesize of output 16 [2025-03-08 22:16:01,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-08 22:16:02,001 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 22:16:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:02,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:16:02,116 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1138 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 8)) 1)) is different from false [2025-03-08 22:16:02,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:02,127 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 31 treesize of output 35 [2025-03-08 22:16:02,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843272732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:16:02,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:16:02,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-03-08 22:16:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651754579] [2025-03-08 22:16:02,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:16:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:16:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:02,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:16:02,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=301, Unknown=1, NotChecked=34, Total=380 [2025-03-08 22:16:02,193 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:16:03,899 INFO L93 Difference]: Finished difference Result 242 states and 305 transitions. [2025-03-08 22:16:03,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 22:16:03,899 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 22:16:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:16:03,900 INFO L225 Difference]: With dead ends: 242 [2025-03-08 22:16:03,900 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 22:16:03,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=1411, Unknown=1, NotChecked=82, Total=1892 [2025-03-08 22:16:03,901 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 450 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:16:03,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 450 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 666 Invalid, 2 Unknown, 173 Unchecked, 0.7s Time] [2025-03-08 22:16:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 22:16:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 174. [2025-03-08 22:16:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 170 states have (on average 1.2529411764705882) internal successors, (213), 172 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2025-03-08 22:16:03,911 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 21 [2025-03-08 22:16:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:16:03,911 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2025-03-08 22:16:03,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2025-03-08 22:16:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:16:03,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:16:03,912 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:03,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 22:16:04,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:04,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash -260562986, now seen corresponding path program 2 times [2025-03-08 22:16:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678489638] [2025-03-08 22:16:04,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:16:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:04,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 22:16:04,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:16:04,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:16:04,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:16:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678489638] [2025-03-08 22:16:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678489638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628937102] [2025-03-08 22:16:04,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:16:04,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:04,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:16:04,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:16:04,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:16:04,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 22:16:04,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:16:04,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:16:04,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:04,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 22:16:04,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:16:04,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-03-08 22:16:04,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-03-08 22:16:04,864 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-03-08 22:16:04,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 84 [2025-03-08 22:16:04,872 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-03-08 22:16:04,872 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 59 treesize of output 43 [2025-03-08 22:16:04,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 22:16:04,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 31 [2025-03-08 22:16:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:04,893 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 48 treesize of output 50 [2025-03-08 22:16:04,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 31 [2025-03-08 22:16:04,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2025-03-08 22:16:05,035 INFO L349 Elim1Store]: treesize reduction 88, result has 14.6 percent of original size [2025-03-08 22:16:05,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 133 treesize of output 83 [2025-03-08 22:16:05,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:05,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 71 [2025-03-08 22:16:05,228 INFO L349 Elim1Store]: treesize reduction 80, result has 8.0 percent of original size [2025-03-08 22:16:05,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 133 treesize of output 76 [2025-03-08 22:16:05,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:05,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78 [2025-03-08 22:16:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:05,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:16:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:09,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628937102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:16:09,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:16:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 22:16:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054997468] [2025-03-08 22:16:09,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:16:09,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 22:16:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:09,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 22:16:09,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=384, Unknown=1, NotChecked=0, Total=462 [2025-03-08 22:16:09,709 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:16:10,594 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2025-03-08 22:16:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:16:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 22:16:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:16:10,595 INFO L225 Difference]: With dead ends: 195 [2025-03-08 22:16:10,595 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 22:16:10,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=165, Invalid=764, Unknown=1, NotChecked=0, Total=930 [2025-03-08 22:16:10,596 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 22:16:10,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 328 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 22:16:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 22:16:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-03-08 22:16:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 191 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2025-03-08 22:16:10,602 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 22 [2025-03-08 22:16:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:16:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2025-03-08 22:16:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2025-03-08 22:16:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 22:16:10,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:16:10,603 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:10,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 22:16:10,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:10,803 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -240644179, now seen corresponding path program 3 times [2025-03-08 22:16:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734668254] [2025-03-08 22:16:10,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:16:10,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:10,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-08 22:16:10,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:16:10,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:16:10,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:16:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734668254] [2025-03-08 22:16:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734668254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033453339] [2025-03-08 22:16:11,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:16:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:16:11,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:16:11,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 22:16:11,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-03-08 22:16:12,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 22:16:12,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 22:16:12,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:12,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 22:16:12,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:16:12,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-03-08 22:16:12,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 36 [2025-03-08 22:16:12,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2025-03-08 22:16:12,074 INFO L349 Elim1Store]: treesize reduction 74, result has 6.3 percent of original size [2025-03-08 22:16:12,075 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 170 treesize of output 139 [2025-03-08 22:16:12,081 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 10 treesize of output 8 [2025-03-08 22:16:12,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:12,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:12,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:12,091 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 45 treesize of output 11 [2025-03-08 22:16:12,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 22:16:12,188 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:16:12,188 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 1 case distinctions, treesize of input 82 treesize of output 48 [2025-03-08 22:16:12,258 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 22:16:12,261 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-03-08 22:16:12,330 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-08 22:16:12,330 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 1 case distinctions, treesize of input 89 treesize of output 51 [2025-03-08 22:16:12,376 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:16:12,377 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 88 treesize of output 47 [2025-03-08 22:16:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:12,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:16:12,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 Int)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (store (store (store |c_#valid| |c_ULTIMATE.start_main_~bcki~0#1.base| 0) .cse0 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~bcki~0#1.offset| 4) v_ArrVal_1467)) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|)) 0))))) is different from false [2025-03-08 22:16:12,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 Int)) (= (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (store (store (store |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base| 0) .cse0 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_main_~bucket~0#1.offset| 4) v_ArrVal_1467)) .cse0) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 0))) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-03-08 22:16:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-08 22:16:12,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033453339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:16:12,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:16:12,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-03-08 22:16:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763847738] [2025-03-08 22:16:12,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:16:12,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:16:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:12,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:16:12,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=285, Unknown=2, NotChecked=70, Total=420 [2025-03-08 22:16:12,593 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:16:13,145 INFO L93 Difference]: Finished difference Result 211 states and 260 transitions. [2025-03-08 22:16:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:16:13,145 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 22:16:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:16:13,146 INFO L225 Difference]: With dead ends: 211 [2025-03-08 22:16:13,146 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 22:16:13,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=319, Unknown=2, NotChecked=74, Total=462 [2025-03-08 22:16:13,147 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 22:16:13,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 411 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 126 Unchecked, 0.5s Time] [2025-03-08 22:16:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 22:16:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2025-03-08 22:16:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 189 states have (on average 1.2433862433862435) internal successors, (235), 191 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2025-03-08 22:16:13,150 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 22 [2025-03-08 22:16:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:16:13,150 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2025-03-08 22:16:13,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2025-03-08 22:16:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 22:16:13,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:16:13,151 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:13,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 22:16:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:16:13,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 660644703, now seen corresponding path program 1 times [2025-03-08 22:16:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918729664] [2025-03-08 22:16:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:16:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:13,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:16:13,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:16:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:13,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:16:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918729664] [2025-03-08 22:16:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918729664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:16:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976031917] [2025-03-08 22:16:13,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:16:13,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:16:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:16:13,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:16:13,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 22:16:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 22:16:13,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 22:16:13,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:13,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:16:13,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 22:16:13,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:16:13,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-03-08 22:16:13,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2025-03-08 22:16:13,957 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2025-03-08 22:16:13,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 78 [2025-03-08 22:16:13,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2025-03-08 22:16:13,995 INFO L349 Elim1Store]: treesize reduction 124, result has 10.8 percent of original size [2025-03-08 22:16:13,996 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 4 case distinctions, treesize of input 83 treesize of output 70 [2025-03-08 22:16:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 15 [2025-03-08 22:16:14,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:14,012 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 52 treesize of output 31 [2025-03-08 22:16:14,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 11 [2025-03-08 22:16:14,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:14,080 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-08 22:16:14,080 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 96 treesize of output 67 [2025-03-08 22:16:14,096 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2025-03-08 22:16:14,096 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 1 case distinctions, treesize of input 24 treesize of output 31 [2025-03-08 22:16:14,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:14,121 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2025-03-08 22:16:14,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 42 [2025-03-08 22:16:14,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:14,151 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-03-08 22:16:14,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-03-08 22:16:14,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2025-03-08 22:16:14,215 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-03-08 22:16:14,215 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 94 treesize of output 65 [2025-03-08 22:16:14,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:16:14,230 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 34 treesize of output 30 [2025-03-08 22:16:14,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 22:16:14,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 44 [2025-03-08 22:16:14,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 22:16:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:14,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:16:14,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int))) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1628)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1627))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) 2)) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2025-03-08 22:16:14,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:16:14,630 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 59 treesize of output 63 [2025-03-08 22:16:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:16:14,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976031917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:16:14,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:16:14,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-08 22:16:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785794853] [2025-03-08 22:16:14,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:16:14,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:16:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:16:14,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:16:14,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2025-03-08 22:16:14,686 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:16:15,857 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2025-03-08 22:16:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 22:16:15,858 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 22:16:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:16:15,859 INFO L225 Difference]: With dead ends: 313 [2025-03-08 22:16:15,859 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 22:16:15,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=903, Unknown=1, NotChecked=64, Total=1190 [2025-03-08 22:16:15,859 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 178 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 22:16:15,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 535 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 805 Invalid, 0 Unknown, 138 Unchecked, 0.7s Time] [2025-03-08 22:16:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 22:16:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 237. [2025-03-08 22:16:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.257510729613734) internal successors, (293), 235 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 295 transitions. [2025-03-08 22:16:15,864 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 295 transitions. Word has length 23 [2025-03-08 22:16:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:16:15,864 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 295 transitions. [2025-03-08 22:16:15,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:16:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 295 transitions. [2025-03-08 22:16:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 22:16:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:16:15,865 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:15,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 22:16:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 22:16:16,066 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:16:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:16:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -887231747, now seen corresponding path program 1 times [2025-03-08 22:16:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:16:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403479876] [2025-03-08 22:16:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:16:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:16:16,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:16:16,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:16:16,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:16,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:16:16,093 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:16:16,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:16:16,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:16:16,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:16:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:16:16,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:16:16,125 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:16:16,126 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-08 22:16:16,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-08 22:16:16,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:16:16,130 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:16:16,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:16:16,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:16:16 BoogieIcfgContainer [2025-03-08 22:16:16,154 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:16:16,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:16:16,155 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:16:16,155 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:16:16,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:52" (3/4) ... [2025-03-08 22:16:16,156 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:16:16,192 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 21. [2025-03-08 22:16:16,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:16:16,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:16:16,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:16:16,240 INFO L158 Benchmark]: Toolchain (without parser) took 24438.89ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 112.3MB in the beginning and 186.6MB in the end (delta: -74.4MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,240 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:16:16,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 94.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.70ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:16:16,241 INFO L158 Benchmark]: Boogie Preprocessor took 36.83ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,241 INFO L158 Benchmark]: IcfgBuilder took 362.29ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 71.5MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,241 INFO L158 Benchmark]: TraceAbstraction took 23571.31ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 71.0MB in the beginning and 195.1MB in the end (delta: -124.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,242 INFO L158 Benchmark]: Witness Printer took 84.46ms. Allocated memory is still 327.2MB. Free memory was 194.0MB in the beginning and 186.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:16:16,244 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.74ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 94.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.70ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.83ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.5MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 362.29ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 71.5MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23571.31ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 71.0MB in the beginning and 195.1MB in the end (delta: -124.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Witness Printer took 84.46ms. Allocated memory is still 327.2MB. Free memory was 194.0MB in the beginning and 186.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bucket={-3:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 [L1032] bcki = bucket VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1034] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1035] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1036] COND TRUE bcki->data != item->data [L1036] EXPR bcki->data [L1036] EXPR item->data [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1038] COND FALSE !(0) VAL [bcki={-3:0}, bucket={-3:0}, item={-4:0}] [L1040] EXPR bcki->list [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item [L1021] COND TRUE __VERIFIER_nondet_int() [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-3:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] COND TRUE 0 [L1061] EXPR itr->data [L1061] EXPR bcki->data [L1061] COND TRUE !(itr->data != bcki->data) [L1061] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-buckets-2.c", 14, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 84 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1316 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1316 mSDsluCounter, 3142 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 437 IncrementalHoareTripleChecker+Unchecked, 2577 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3252 IncrementalHoareTripleChecker+Invalid, 3852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 565 mSDtfsCounter, 3252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 261 SyntacticMatches, 4 SemanticMatches, 209 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=14, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 302 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 513 ConstructedInterpolants, 68 QuantifiedInterpolants, 15303 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 402 ConjunctsInUnsatCore, 31 InterpolantComputations, 6 PerfectInterpolantSequences, 32/183 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 22:16:16,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)