./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-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 af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:22:34,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:22:34,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:22:34,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:22:34,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:22:34,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:22:34,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:22:34,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:22:34,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:22:34,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:22:34,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:22:34,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:22:34,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:22:34,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:22:34,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:22:34,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:22:34,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:22:34,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:22:34,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:22:34,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:22:34,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:22:34,643 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 -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2025-03-17 11:22:34,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:22:34,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:22:34,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:22:34,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:22:34,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:22:34,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2025-03-17 11:22:36,018 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19946732/ab307ffaf5f64c6da3097357544a0086/FLAG642525bdf [2025-03-17 11:22:36,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:22:36,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2025-03-17 11:22:36,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19946732/ab307ffaf5f64c6da3097357544a0086/FLAG642525bdf [2025-03-17 11:22:36,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19946732/ab307ffaf5f64c6da3097357544a0086 [2025-03-17 11:22:36,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:22:36,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:22:36,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:22:36,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:22:36,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:22:36,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@918a2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36, skipping insertion in model container [2025-03-17 11:22:36,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:22:36,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:22:36,885 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:22:36,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:22:36,929 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:22:36,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36 WrapperNode [2025-03-17 11:22:36,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:22:36,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:22:36,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:22:36,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:22:36,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,963 INFO L138 Inliner]: procedures = 119, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2025-03-17 11:22:36,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:22:36,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:22:36,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:22:36,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:22:36,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,987 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-17 11:22:36,987 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,987 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:36,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:22:36,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:22:36,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:22:36,998 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:22:36,999 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (1/1) ... [2025-03-17 11:22:37,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:22:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:37,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:22:37,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 11:22:37,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:22:37,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:22:37,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:22:37,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:22:37,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:22:37,364 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 11:22:37,364 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:22:37,374 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:22:37,375 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:22:37,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:22:37 BoogieIcfgContainer [2025-03-17 11:22:37,375 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:22:37,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:22:37,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:22:37,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:22:37,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:22:36" (1/3) ... [2025-03-17 11:22:37,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272ab048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:37, skipping insertion in model container [2025-03-17 11:22:37,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:36" (2/3) ... [2025-03-17 11:22:37,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272ab048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:37, skipping insertion in model container [2025-03-17 11:22:37,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:22:37" (3/3) ... [2025-03-17 11:22:37,384 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2025-03-17 11:22:37,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:22:37,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-queue-2.i that has 2 procedures, 89 locations, 1 initial locations, 17 loop locations, and 2 error locations. [2025-03-17 11:22:37,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:22:37,436 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;@40d58107, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:22:37,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:22:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 73 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 11:22:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:22:37,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:37,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:22:37,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash 821201715, now seen corresponding path program 1 times [2025-03-17 11:22:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:37,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688906697] [2025-03-17 11:22:37,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:37,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:22:37,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:22:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:37,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:37,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688906697] [2025-03-17 11:22:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688906697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:22:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426366719] [2025-03-17 11:22:37,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:37,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 11:22:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:37,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 11:22:37,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:22:37,625 INFO L87 Difference]: Start difference. First operand has 89 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 73 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-17 11:22:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:37,638 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2025-03-17 11:22:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 11:22:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2025-03-17 11:22:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:37,645 INFO L225 Difference]: With dead ends: 73 [2025-03-17 11:22:37,645 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 11:22:37,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 11:22:37,650 INFO L435 NwaCegarLoop]: 96 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, 96 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-17 11:22:37,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:37,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 11:22:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-17 11:22:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2025-03-17 11:22:37,676 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 6 [2025-03-17 11:22:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:37,676 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2025-03-17 11:22:37,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-17 11:22:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2025-03-17 11:22:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:22:37,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:37,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:37,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:22:37,678 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -319512993, now seen corresponding path program 1 times [2025-03-17 11:22:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:37,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946903943] [2025-03-17 11:22:37,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:37,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:22:37,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:22:37,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:37,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:37,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946903943] [2025-03-17 11:22:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946903943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:22:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067470877] [2025-03-17 11:22:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:37,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:37,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:37,748 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 11:22:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:37,784 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2025-03-17 11:22:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-03-17 11:22:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:37,785 INFO L225 Difference]: With dead ends: 67 [2025-03-17 11:22:37,785 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 11:22:37,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:37,785 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:37,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 82 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 11:22:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 11:22:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 65 states have internal predecessors, (76), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2025-03-17 11:22:37,793 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 7 [2025-03-17 11:22:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:37,793 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2025-03-17 11:22:37,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 11:22:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2025-03-17 11:22:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 11:22:37,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:37,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:37,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:22:37,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:37,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2009923744, now seen corresponding path program 1 times [2025-03-17 11:22:37,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:37,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133303269] [2025-03-17 11:22:37,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:37,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 11:22:37,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 11:22:37,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:37,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133303269] [2025-03-17 11:22:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133303269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:37,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:22:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533238776] [2025-03-17 11:22:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:37,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:37,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:37,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:37,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:37,898 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-17 11:22:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:37,930 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2025-03-17 11:22:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2025-03-17 11:22:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:37,934 INFO L225 Difference]: With dead ends: 66 [2025-03-17 11:22:37,934 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 11:22:37,934 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-17 11:22:37,934 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:37,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 99 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 11:22:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 11:22:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 64 states have internal predecessors, (75), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2025-03-17 11:22:37,938 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 10 [2025-03-17 11:22:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:37,938 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-03-17 11:22:37,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-17 11:22:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2025-03-17 11:22:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:22:37,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:37,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:37,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:22:37,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:37,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:37,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1497310301, now seen corresponding path program 1 times [2025-03-17 11:22:37,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:37,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719353345] [2025-03-17 11:22:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:37,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:37,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:22:37,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:22:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:37,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719353345] [2025-03-17 11:22:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719353345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:22:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854624511] [2025-03-17 11:22:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:37,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:37,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:37,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:37,999 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-17 11:22:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:38,034 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2025-03-17 11:22:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 13 [2025-03-17 11:22:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:38,035 INFO L225 Difference]: With dead ends: 94 [2025-03-17 11:22:38,035 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 11:22:38,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:38,036 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 27 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:38,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 146 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 11:22:38,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-03-17 11:22:38,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 78 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2025-03-17 11:22:38,040 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 13 [2025-03-17 11:22:38,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:38,040 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2025-03-17 11:22:38,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-17 11:22:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2025-03-17 11:22:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:22:38,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:38,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:38,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:22:38,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:38,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:38,042 INFO L85 PathProgramCache]: Analyzing trace with hash 80177246, now seen corresponding path program 1 times [2025-03-17 11:22:38,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118869515] [2025-03-17 11:22:38,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:38,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:22:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:22:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:38,216 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-17 11:22:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118869515] [2025-03-17 11:22:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118869515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859716422] [2025-03-17 11:22:38,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:38,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:22:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:22:38,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:22:38,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:22:38,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:38,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:38,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:22:38,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:38,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 11:22:38,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:22:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 11:22:38,446 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-17 11:22:38,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:38,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 11:22:38,516 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-17 11:22:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859716422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:38,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 11:22:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995048397] [2025-03-17 11:22:38,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:22:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:38,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:22:38,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:22:38,518 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:38,911 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2025-03-17 11:22:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 11:22:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 15 [2025-03-17 11:22:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:38,913 INFO L225 Difference]: With dead ends: 141 [2025-03-17 11:22:38,913 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 11:22:38,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:22:38,914 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 292 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:38,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 444 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:22:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 11:22:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 84. [2025-03-17 11:22:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 82 states have internal predecessors, (97), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2025-03-17 11:22:38,925 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 15 [2025-03-17 11:22:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:38,926 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2025-03-17 11:22:38,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2025-03-17 11:22:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:22:38,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:38,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:38,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:22:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:39,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 81100767, now seen corresponding path program 1 times [2025-03-17 11:22:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397516876] [2025-03-17 11:22:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:22:39,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:22:39,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,204 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-17 11:22:39,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397516876] [2025-03-17 11:22:39,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397516876] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:39,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208748947] [2025-03-17 11:22:39,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:39,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:39,206 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:22:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:22:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:22:39,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:22:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:22:39,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:39,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:22:39,299 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-17 11:22:39,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:39,330 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-17 11:22:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208748947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:39,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2025-03-17 11:22:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738760237] [2025-03-17 11:22:39,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:39,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:22:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:39,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:22:39,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:22:39,331 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:39,369 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2025-03-17 11:22:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:22:39,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 15 [2025-03-17 11:22:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:39,370 INFO L225 Difference]: With dead ends: 109 [2025-03-17 11:22:39,370 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 11:22:39,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:22:39,371 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:39,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 291 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 11:22:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2025-03-17 11:22:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 90 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2025-03-17 11:22:39,378 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 15 [2025-03-17 11:22:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:39,378 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2025-03-17 11:22:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2025-03-17 11:22:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:22:39,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:39,380 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:39,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:22:39,580 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,SelfDestructingSolverStorable5 [2025-03-17 11:22:39,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1809471672, now seen corresponding path program 2 times [2025-03-17 11:22:39,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278872639] [2025-03-17 11:22:39,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:22:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 11:22:39,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 16 statements. [2025-03-17 11:22:39,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:22:39,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:22:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:39,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278872639] [2025-03-17 11:22:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278872639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:22:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626847448] [2025-03-17 11:22:39,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:39,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:22:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:39,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:22:39,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:22:39,688 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:39,751 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2025-03-17 11:22:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:22:39,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 16 [2025-03-17 11:22:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:39,753 INFO L225 Difference]: With dead ends: 101 [2025-03-17 11:22:39,753 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 11:22:39,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:22:39,754 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:39,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 279 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 11:22:39,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-03-17 11:22:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-03-17 11:22:39,758 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 16 [2025-03-17 11:22:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:39,758 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-03-17 11:22:39,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-03-17 11:22:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 11:22:39,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:39,758 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:39,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:22:39,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1780842521, now seen corresponding path program 2 times [2025-03-17 11:22:39,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272748652] [2025-03-17 11:22:39,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:22:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 11:22:39,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:22:39,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:22:39,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272748652] [2025-03-17 11:22:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272748652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681398717] [2025-03-17 11:22:39,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:22:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:39,851 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-17 11:22:39,853 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-17 11:22:39,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-17 11:22:39,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 11:22:39,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:22:39,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 11:22:39,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:39,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-17 11:22:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:39,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:40,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-17 11:22:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681398717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:40,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-17 11:22:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961874557] [2025-03-17 11:22:40,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:22:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:22:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:22:40,051 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:40,165 INFO L93 Difference]: Finished difference Result 108 states and 131 transitions. [2025-03-17 11:22:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:22:40,166 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 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 16 [2025-03-17 11:22:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:40,166 INFO L225 Difference]: With dead ends: 108 [2025-03-17 11:22:40,166 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 11:22:40,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:22:40,167 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 33 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:40,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 415 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:22:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 11:22:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2025-03-17 11:22:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 87 states have internal predecessors, (101), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2025-03-17 11:22:40,175 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 109 transitions. Word has length 16 [2025-03-17 11:22:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 109 transitions. [2025-03-17 11:22:40,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2025-03-17 11:22:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-17 11:22:40,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:40,176 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:40,182 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-17 11:22:40,376 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-17 11:22:40,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:40,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash 637076387, now seen corresponding path program 1 times [2025-03-17 11:22:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390636358] [2025-03-17 11:22:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:40,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:22:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:22:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:40,528 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-17 11:22:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390636358] [2025-03-17 11:22:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390636358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114783345] [2025-03-17 11:22:40,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:40,531 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-17 11:22:40,532 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-17 11:22:40,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 11:22:40,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 11:22:40,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:40,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:40,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 11:22:40,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:40,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:22:40,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:22:40,631 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 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:22:40,637 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 16 treesize of output 16 [2025-03-17 11:22:40,641 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 16 treesize of output 11 [2025-03-17 11:22:40,653 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:22:40,653 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 33 treesize of output 32 [2025-03-17 11:22:40,700 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-17 11:22:40,703 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-17 11:22:40,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:40,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:40,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-17 11:22:40,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:40,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-03-17 11:22:40,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-17 11:22:40,830 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-17 11:22:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114783345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:40,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2025-03-17 11:22:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031578386] [2025-03-17 11:22:40,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:22:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:40,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:22:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=80, Unknown=2, NotChecked=0, Total=110 [2025-03-17 11:22:40,832 INFO L87 Difference]: Start difference. First operand 89 states and 109 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-17 11:22:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:40,975 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2025-03-17 11:22:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:22:40,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-17 11:22:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:40,976 INFO L225 Difference]: With dead ends: 171 [2025-03-17 11:22:40,976 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 11:22:40,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=94, Unknown=2, NotChecked=0, Total=132 [2025-03-17 11:22:40,977 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 74 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:40,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 415 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:22:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 11:22:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 103. [2025-03-17 11:22:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 101 states have internal predecessors, (118), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-03-17 11:22:40,980 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 20 [2025-03-17 11:22:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-03-17 11:22:40,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 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-17 11:22:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-03-17 11:22:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:22:40,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:40,981 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] [2025-03-17 11:22:40,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:22:41,185 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-17 11:22:41,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1320063533, now seen corresponding path program 1 times [2025-03-17 11:22:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661994434] [2025-03-17 11:22:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:41,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:22:41,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:22:41,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:41,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:41,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661994434] [2025-03-17 11:22:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661994434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:22:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095884094] [2025-03-17 11:22:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:41,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:41,214 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-17 11:22:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:41,233 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2025-03-17 11:22:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:41,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-17 11:22:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:41,234 INFO L225 Difference]: With dead ends: 137 [2025-03-17 11:22:41,234 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 11:22:41,234 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-17 11:22:41,235 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 27 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:41,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 161 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 11:22:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2025-03-17 11:22:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 104 states have (on average 1.2403846153846154) internal successors, (129), 112 states have internal predecessors, (129), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2025-03-17 11:22:41,238 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 21 [2025-03-17 11:22:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:41,238 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2025-03-17 11:22:41,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-17 11:22:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2025-03-17 11:22:41,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 11:22:41,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:41,239 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] [2025-03-17 11:22:41,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:22:41,239 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:41,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:41,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2095411965, now seen corresponding path program 1 times [2025-03-17 11:22:41,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:41,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688476039] [2025-03-17 11:22:41,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:41,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 11:22:41,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 11:22:41,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:41,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:22:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688476039] [2025-03-17 11:22:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688476039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:22:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567097042] [2025-03-17 11:22:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:41,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:41,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:41,260 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:41,273 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2025-03-17 11:22:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:41,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2025-03-17 11:22:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:41,274 INFO L225 Difference]: With dead ends: 102 [2025-03-17 11:22:41,274 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 11:22:41,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:41,274 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:41,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 11:22:41,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 11:22:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 100 states have internal predecessors, (114), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2025-03-17 11:22:41,276 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 24 [2025-03-17 11:22:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2025-03-17 11:22:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2025-03-17 11:22:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 11:22:41,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:41,277 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:41,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:22:41,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1113761797, now seen corresponding path program 1 times [2025-03-17 11:22:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935736984] [2025-03-17 11:22:41,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:41,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:22:41,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:22:41,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:22:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935736984] [2025-03-17 11:22:41,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935736984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732180913] [2025-03-17 11:22:41,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:41,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:41,355 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-17 11:22:41,357 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-17 11:22:41,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:22:41,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:22:41,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:41,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:41,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 11:22:41,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:41,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-17 11:22:41,523 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 23 treesize of output 11 [2025-03-17 11:22:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:22:41,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 11:22:41,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732180913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:41,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:41,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2025-03-17 11:22:41,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61669099] [2025-03-17 11:22:41,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:41,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:22:41,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:41,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:22:41,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:22:41,605 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:41,819 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2025-03-17 11:22:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:22:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 27 [2025-03-17 11:22:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:41,820 INFO L225 Difference]: With dead ends: 131 [2025-03-17 11:22:41,820 INFO L226 Difference]: Without dead ends: 128 [2025-03-17 11:22:41,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:22:41,820 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 182 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:41,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 326 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:22:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-17 11:22:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2025-03-17 11:22:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.231578947368421) internal successors, (117), 103 states have internal predecessors, (117), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-03-17 11:22:41,823 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 27 [2025-03-17 11:22:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:41,823 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-03-17 11:22:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:41,823 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-03-17 11:22:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:22:41,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:41,824 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:41,830 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-17 11:22:42,024 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,SelfDestructingSolverStorable11 [2025-03-17 11:22:42,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1017423146, now seen corresponding path program 1 times [2025-03-17 11:22:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670008505] [2025-03-17 11:22:42,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:42,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:22:42,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:22:42,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:42,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:22:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670008505] [2025-03-17 11:22:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670008505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:42,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:42,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:22:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973836677] [2025-03-17 11:22:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:42,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:42,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:42,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:42,085 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-17 11:22:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:42,111 INFO L93 Difference]: Finished difference Result 140 states and 166 transitions. [2025-03-17 11:22:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 28 [2025-03-17 11:22:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:42,112 INFO L225 Difference]: With dead ends: 140 [2025-03-17 11:22:42,112 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 11:22:42,112 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-17 11:22:42,112 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:42,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 162 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 11:22:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 119. [2025-03-17 11:22:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 109 states have (on average 1.2110091743119267) internal successors, (132), 117 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-03-17 11:22:42,135 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 28 [2025-03-17 11:22:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:42,135 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-03-17 11:22:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-17 11:22:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-03-17 11:22:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 11:22:42,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:42,135 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:42,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:22:42,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:42,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 138249186, now seen corresponding path program 1 times [2025-03-17 11:22:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095442137] [2025-03-17 11:22:42,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:42,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:22:42,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:22:42,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:42,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095442137] [2025-03-17 11:22:42,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095442137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:42,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721783362] [2025-03-17 11:22:42,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:42,429 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-17 11:22:42,430 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-17 11:22:42,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 11:22:42,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 11:22:42,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:42,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:22:42,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:42,549 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-03-17 11:22:42,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2025-03-17 11:22:42,559 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 16 treesize of output 16 [2025-03-17 11:22:42,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:22:42,586 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:22:42,586 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 38 treesize of output 37 [2025-03-17 11:22:42,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2025-03-17 11:22:42,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 32 [2025-03-17 11:22:42,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:42,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:42,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_486) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2025-03-17 11:22:42,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-17 11:22:42,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:42,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 61 [2025-03-17 11:22:42,851 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 22 treesize of output 20 [2025-03-17 11:22:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:43,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721783362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:43,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-17 11:22:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186254675] [2025-03-17 11:22:43,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:43,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:22:43,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:43,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:22:43,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2025-03-17 11:22:43,142 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:43,383 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2025-03-17 11:22:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:22:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 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 28 [2025-03-17 11:22:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:43,384 INFO L225 Difference]: With dead ends: 147 [2025-03-17 11:22:43,384 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 11:22:43,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2025-03-17 11:22:43,384 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:43,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 633 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2025-03-17 11:22:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 11:22:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2025-03-17 11:22:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 125 states have (on average 1.216) internal successors, (152), 133 states have internal predecessors, (152), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2025-03-17 11:22:43,387 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 28 [2025-03-17 11:22:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:43,388 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2025-03-17 11:22:43,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2025-03-17 11:22:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:22:43,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:43,388 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:43,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:22:43,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:43,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:43,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1570185562, now seen corresponding path program 1 times [2025-03-17 11:22:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:43,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874646486] [2025-03-17 11:22:43,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:43,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:22:43,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:22:43,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:43,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874646486] [2025-03-17 11:22:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874646486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:43,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298315873] [2025-03-17 11:22:43,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:43,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:43,903 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-17 11:22:43,904 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-17 11:22:43,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 11:22:43,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:22:43,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:43,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:43,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 11:22:43,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:43,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:22:44,006 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 16 treesize of output 16 [2025-03-17 11:22:44,015 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:22:44,016 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 11:22:44,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:22:44,037 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:22:44,037 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 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:22:44,061 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 16 treesize of output 11 [2025-03-17 11:22:44,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:22:44,120 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2025-03-17 11:22:44,120 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 55 treesize of output 36 [2025-03-17 11:22:44,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:22:44,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2025-03-17 11:22:44,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:22:44,139 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 41 treesize of output 30 [2025-03-17 11:22:44,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2025-03-17 11:22:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-17 11:22:44,211 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-17 11:22:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:44,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:44,243 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_601 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_601) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-17 11:22:44,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:44,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 11:22:44,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:44,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 82 [2025-03-17 11:22:44,312 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 52 treesize of output 48 [2025-03-17 11:22:44,316 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 48 treesize of output 46 [2025-03-17 11:22:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-17 11:22:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298315873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:44,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-17 11:22:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40942405] [2025-03-17 11:22:44,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:44,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:22:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:44,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:22:44,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2025-03-17 11:22:44,451 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 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-17 11:22:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:44,936 INFO L93 Difference]: Finished difference Result 174 states and 206 transitions. [2025-03-17 11:22:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:22:44,937 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 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 29 [2025-03-17 11:22:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:44,937 INFO L225 Difference]: With dead ends: 174 [2025-03-17 11:22:44,937 INFO L226 Difference]: Without dead ends: 174 [2025-03-17 11:22:44,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=419, Unknown=1, NotChecked=44, Total=600 [2025-03-17 11:22:44,939 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 380 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:44,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 495 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 371 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2025-03-17 11:22:44,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-17 11:22:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2025-03-17 11:22:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.208) internal successors, (151), 132 states have internal predecessors, (151), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 158 transitions. [2025-03-17 11:22:44,943 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 158 transitions. Word has length 29 [2025-03-17 11:22:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:44,943 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 158 transitions. [2025-03-17 11:22:44,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 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-17 11:22:44,943 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 158 transitions. [2025-03-17 11:22:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:22:44,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:44,945 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:44,951 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-17 11:22:45,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:45,146 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:45,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash -880000223, now seen corresponding path program 1 times [2025-03-17 11:22:45,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:45,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098873452] [2025-03-17 11:22:45,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:45,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:22:45,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:22:45,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:45,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:45,450 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-17 11:22:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:45,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098873452] [2025-03-17 11:22:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098873452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23927289] [2025-03-17 11:22:45,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:45,453 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-17 11:22:45,454 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-17 11:22:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:22:45,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:22:45,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:45,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:45,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 11:22:45,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:45,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:22:45,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2025-03-17 11:22:45,572 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:22:45,572 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-17 11:22:45,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 11:22:45,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:22:45,584 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-17 11:22:45,588 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 16 treesize of output 16 [2025-03-17 11:22:45,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:22:45,623 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 11:22:45,623 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 79 treesize of output 68 [2025-03-17 11:22:45,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2025-03-17 11:22:45,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 11:22:45,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 11:22:45,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 11:22:45,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 11:22:45,765 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-17 11:22:45,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:45,817 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 72 treesize of output 52 [2025-03-17 11:22:45,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:45,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-03-17 11:22:45,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:45,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-17 11:22:45,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2025-03-17 11:22:45,867 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 29 treesize of output 27 [2025-03-17 11:22:45,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:45,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2025-03-17 11:22:45,879 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 35 treesize of output 33 [2025-03-17 11:22:45,933 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-17 11:22:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23927289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:22:45,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:22:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-03-17 11:22:45,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380068936] [2025-03-17 11:22:45,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:22:45,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 11:22:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:45,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 11:22:45,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=227, Unknown=3, NotChecked=0, Total=272 [2025-03-17 11:22:45,934 INFO L87 Difference]: Start difference. First operand 134 states and 158 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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-17 11:22:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:46,252 INFO L93 Difference]: Finished difference Result 198 states and 234 transitions. [2025-03-17 11:22:46,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 11:22:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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 30 [2025-03-17 11:22:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:46,254 INFO L225 Difference]: With dead ends: 198 [2025-03-17 11:22:46,254 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 11:22:46,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=401, Unknown=3, NotChecked=0, Total=506 [2025-03-17 11:22:46,254 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 260 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:46,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 700 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:22:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 11:22:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 139. [2025-03-17 11:22:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 130 states have (on average 1.2153846153846153) internal successors, (158), 137 states have internal predecessors, (158), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2025-03-17 11:22:46,257 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 165 transitions. Word has length 30 [2025-03-17 11:22:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:46,258 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 165 transitions. [2025-03-17 11:22:46,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 16 states have internal predecessors, (81), 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-17 11:22:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2025-03-17 11:22:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 11:22:46,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:46,258 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:46,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 11:22:46,459 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,SelfDestructingSolverStorable15 [2025-03-17 11:22:46,459 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -9241532, now seen corresponding path program 2 times [2025-03-17 11:22:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492795779] [2025-03-17 11:22:46,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:22:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:46,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 11:22:46,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:22:46,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:22:46,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492795779] [2025-03-17 11:22:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492795779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:22:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493721141] [2025-03-17 11:22:46,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:22:46,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:22:46,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:46,696 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-17 11:22:46,698 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-17 11:22:46,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 11:22:46,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 11:22:46,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:22:46,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:46,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 11:22:46,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:22:46,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:22:46,812 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 11:22:46,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 11:22:46,831 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 11:22:46,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 11:22:46,841 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:22:46,842 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-17 11:22:46,866 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 11:22:46,866 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 85 treesize of output 58 [2025-03-17 11:22:46,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2025-03-17 11:22:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:47,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:22:47,133 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_757 (Array Int Int))) (or (forall ((v_ArrVal_755 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_ArrVal_755)))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_757) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0)) (not (= v_ArrVal_757 (store .cse3 .cse2 (select v_ArrVal_757 .cse2)))))) (forall ((v_ArrVal_757 (Array Int Int))) (or (not (= v_ArrVal_757 (store .cse3 .cse2 (select v_ArrVal_757 .cse2)))) (forall ((v_ArrVal_755 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_757))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_ArrVal_755)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0)))))) is different from false [2025-03-17 11:22:47,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:47,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 160 [2025-03-17 11:22:47,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:47,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3268 treesize of output 3179 [2025-03-17 11:22:47,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:22:47,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 2458 treesize of output 2398