./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:04:16,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:04:17,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:04:17,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:04:17,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:04:17,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:04:17,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:04:17,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:04:17,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:04:17,053 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:04:17,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:04:17,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:04:17,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:04:17,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:04:17,053 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:04:17,054 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:04:17,054 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:04:17,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:04:17,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:04:17,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:04:17,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:04:17,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:04:17,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:04:17,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:04:17,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:04:17,056 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2025-03-08 23:04:17,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:04:17,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:04:17,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:04:17,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:04:17,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:04:17,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2025-03-08 23:04:18,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0e0ad2d/12fe68e58a2f4387a6822f165fb1b6b5/FLAGfc662661d [2025-03-08 23:04:18,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:04:18,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2025-03-08 23:04:18,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0e0ad2d/12fe68e58a2f4387a6822f165fb1b6b5/FLAGfc662661d [2025-03-08 23:04:18,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0e0ad2d/12fe68e58a2f4387a6822f165fb1b6b5 [2025-03-08 23:04:18,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:04:18,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:04:19,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:04:19,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:04:19,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:04:19,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:04:18" (1/1) ... [2025-03-08 23:04:19,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19, skipping insertion in model container [2025-03-08 23:04:19,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:04:18" (1/1) ... [2025-03-08 23:04:19,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:04:19,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:04:19,199 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:04:19,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:04:19,257 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:04:19,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19 WrapperNode [2025-03-08 23:04:19,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:04:19,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:04:19,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:04:19,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:04:19,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,295 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 156 [2025-03-08 23:04:19,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:04:19,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:04:19,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:04:19,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:04:19,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,324 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-08 23:04:19,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:04:19,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:04:19,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:04:19,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:04:19,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (1/1) ... [2025-03-08 23:04:19,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:04:19,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:19,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:04:19,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:04:19,387 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 23:04:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:04:19,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:04:19,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:04:19,475 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:04:19,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:04:19,788 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-03-08 23:04:19,789 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:04:19,800 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:04:19,801 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:04:19,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:04:19 BoogieIcfgContainer [2025-03-08 23:04:19,801 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:04:19,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:04:19,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:04:19,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:04:19,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:04:18" (1/3) ... [2025-03-08 23:04:19,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a2033b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:04:19, skipping insertion in model container [2025-03-08 23:04:19,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:04:19" (2/3) ... [2025-03-08 23:04:19,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a2033b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:04:19, skipping insertion in model container [2025-03-08 23:04:19,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:04:19" (3/3) ... [2025-03-08 23:04:19,811 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2025-03-08 23:04:19,820 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:04:19,821 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-sentinel-2.i that has 2 procedures, 176 locations, 1 initial locations, 10 loop locations, and 74 error locations. [2025-03-08 23:04:19,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:04:19,868 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;@21dc9ad2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:04:19,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-03-08 23:04:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 93 states have (on average 2.10752688172043) internal successors, (196), 167 states have internal predecessors, (196), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 23:04:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:04:19,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:19,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:04:19,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:19,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:19,880 INFO L85 PathProgramCache]: Analyzing trace with hash 232329, now seen corresponding path program 1 times [2025-03-08 23:04:19,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:19,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-08 23:04:19,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:19,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:04:19,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:04:19,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:19,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-08 23:04:20,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:20,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:04:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572021751] [2025-03-08 23:04:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:20,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:20,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:20,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:04:20,080 INFO L87 Difference]: Start difference. First operand has 176 states, 93 states have (on average 2.10752688172043) internal successors, (196), 167 states have internal predecessors, (196), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:20,250 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2025-03-08 23:04:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 23:04:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:20,256 INFO L225 Difference]: With dead ends: 193 [2025-03-08 23:04:20,256 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 23:04:20,257 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-08 23:04:20,259 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 140 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:20,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 121 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 23:04:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 166. [2025-03-08 23:04:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 88 states have (on average 1.9659090909090908) internal successors, (173), 164 states have internal predecessors, (173), 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-08 23:04:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2025-03-08 23:04:20,292 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 3 [2025-03-08 23:04:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:20,293 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2025-03-08 23:04:20,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2025-03-08 23:04:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-08 23:04:20,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:20,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-08 23:04:20,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:04:20,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:20,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 232330, now seen corresponding path program 1 times [2025-03-08 23:04:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753750065] [2025-03-08 23:04:20,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:20,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-08 23:04:20,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-08 23:04:20,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:20,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753750065] [2025-03-08 23:04:20,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753750065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:20,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:20,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:04:20,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842649] [2025-03-08 23:04:20,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:20,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:20,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:20,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:04:20,365 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:20,517 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2025-03-08 23:04:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:20,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-08 23:04:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:20,518 INFO L225 Difference]: With dead ends: 162 [2025-03-08 23:04:20,518 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 23:04:20,518 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-08 23:04:20,518 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 149 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:20,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 99 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 23:04:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-08 23:04:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 88 states have (on average 1.9090909090909092) internal successors, (168), 160 states have internal predecessors, (168), 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-08 23:04:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2025-03-08 23:04:20,532 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 3 [2025-03-08 23:04:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:20,532 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2025-03-08 23:04:20,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2025-03-08 23:04:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:04:20,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:20,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:04:20,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -182516476, now seen corresponding path program 1 times [2025-03-08 23:04:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-08 23:04:20,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:20,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:20,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:04:20,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:04:20,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:20,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:20,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-08 23:04:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698821941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:04:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342137267] [2025-03-08 23:04:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:20,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:20,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:20,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:04:20,657 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:20,799 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2025-03-08 23:04:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:04:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:20,801 INFO L225 Difference]: With dead ends: 167 [2025-03-08 23:04:20,801 INFO L226 Difference]: Without dead ends: 167 [2025-03-08 23:04:20,801 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-08 23:04:20,803 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:20,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 125 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-08 23:04:20,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-08 23:04:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 96 states have (on average 1.84375) internal successors, (177), 165 states have internal predecessors, (177), 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-08 23:04:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2025-03-08 23:04:20,810 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 7 [2025-03-08 23:04:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:20,810 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2025-03-08 23:04:20,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2025-03-08 23:04:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:04:20,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:20,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:04:20,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:20,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -182516477, now seen corresponding path program 1 times [2025-03-08 23:04:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-03-08 23:04:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:04:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:04:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:20,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:20,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298574078] [2025-03-08 23:04:20,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298574078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:20,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:20,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:04:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196898] [2025-03-08 23:04:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:20,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:20,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:20,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:04:20,860 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:20,967 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2025-03-08 23:04:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:04:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:20,969 INFO L225 Difference]: With dead ends: 160 [2025-03-08 23:04:20,969 INFO L226 Difference]: Without dead ends: 160 [2025-03-08 23:04:20,969 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-08 23:04:20,970 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 117 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:20,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 109 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-08 23:04:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-08 23:04:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 96 states have (on average 1.7395833333333333) internal successors, (167), 158 states have internal predecessors, (167), 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-08 23:04:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2025-03-08 23:04:20,978 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 7 [2025-03-08 23:04:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:20,978 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2025-03-08 23:04:20,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2025-03-08 23:04:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 23:04:20,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:20,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:20,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:04:20,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1805333959, now seen corresponding path program 1 times [2025-03-08 23:04:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:20,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640072838] [2025-03-08 23:04:20,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:20,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 23:04:21,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 23:04:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640072838] [2025-03-08 23:04:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640072838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:21,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:04:21,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686816241] [2025-03-08 23:04:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:04:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:21,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:04:21,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:21,222 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:21,443 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-03-08 23:04:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:04:21,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2025-03-08 23:04:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:21,444 INFO L225 Difference]: With dead ends: 174 [2025-03-08 23:04:21,444 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 23:04:21,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:04:21,445 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 286 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:21,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 141 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 23:04:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2025-03-08 23:04:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 109 states have (on average 1.6788990825688073) internal successors, (183), 169 states have internal predecessors, (183), 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-08 23:04:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 190 transitions. [2025-03-08 23:04:21,449 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 190 transitions. Word has length 13 [2025-03-08 23:04:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:21,449 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 190 transitions. [2025-03-08 23:04:21,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 190 transitions. [2025-03-08 23:04:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:04:21,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:21,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:21,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:04:21,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:21,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:21,451 INFO L85 PathProgramCache]: Analyzing trace with hash -564238593, now seen corresponding path program 1 times [2025-03-08 23:04:21,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:21,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-08 23:04:21,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:21,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:21,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:04:21,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:04:21,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:21,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:21,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:21,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-03-08 23:04:21,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758736812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:21,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:04:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209315122] [2025-03-08 23:04:21,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:21,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:21,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:21,524 INFO L87 Difference]: Start difference. First operand 171 states and 190 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:21,703 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2025-03-08 23:04:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 23:04:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:21,706 INFO L225 Difference]: With dead ends: 208 [2025-03-08 23:04:21,706 INFO L226 Difference]: Without dead ends: 208 [2025-03-08 23:04:21,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-08 23:04:21,707 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 307 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:21,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 170 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-08 23:04:21,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 173. [2025-03-08 23:04:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 171 states have internal predecessors, (185), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2025-03-08 23:04:21,711 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 17 [2025-03-08 23:04:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:21,711 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2025-03-08 23:04:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2025-03-08 23:04:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:04:21,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:21,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:21,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:04:21,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:21,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1123379948, now seen corresponding path program 1 times [2025-03-08 23:04:21,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:21,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-08 23:04:21,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:21,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:04:21,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:04:21,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:21,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977620529] [2025-03-08 23:04:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977620529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577324971] [2025-03-08 23:04:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:21,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:21,807 INFO L87 Difference]: Start difference. First operand 173 states and 191 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:21,971 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2025-03-08 23:04:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-08 23:04:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:21,972 INFO L225 Difference]: With dead ends: 172 [2025-03-08 23:04:21,973 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 23:04:21,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:21,973 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:21,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 371 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 23:04:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 23:04:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 112 states have (on average 1.6339285714285714) internal successors, (183), 170 states have internal predecessors, (183), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2025-03-08 23:04:21,981 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 16 [2025-03-08 23:04:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:21,981 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2025-03-08 23:04:21,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2025-03-08 23:04:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:04:21,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:21,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:21,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:04:21,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:21,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1123379947, now seen corresponding path program 1 times [2025-03-08 23:04:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-03-08 23:04:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:21,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:04:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:04:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:22,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:22,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-03-08 23:04:22,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438046205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:22,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:22,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:22,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064887356] [2025-03-08 23:04:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:22,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:22,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:22,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:22,189 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:22,335 INFO L93 Difference]: Finished difference Result 171 states and 187 transitions. [2025-03-08 23:04:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-08 23:04:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:22,337 INFO L225 Difference]: With dead ends: 171 [2025-03-08 23:04:22,337 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 23:04:22,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:22,337 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:22,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 389 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 23:04:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-08 23:04:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 112 states have (on average 1.6160714285714286) internal successors, (181), 169 states have internal predecessors, (181), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2025-03-08 23:04:22,340 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 16 [2025-03-08 23:04:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:22,340 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2025-03-08 23:04:22,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2025-03-08 23:04:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:04:22,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:22,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:22,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:04:22,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:22,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:22,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1138476920, now seen corresponding path program 1 times [2025-03-08 23:04:22,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:22,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-03-08 23:04:22,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:22,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:22,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:04:22,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:04:22,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:22,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:22,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:22,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:22,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087772142] [2025-03-08 23:04:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087772142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:22,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:22,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:04:22,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154288348] [2025-03-08 23:04:22,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:22,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:04:22,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:22,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:04:22,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:04:22,548 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:22,772 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2025-03-08 23:04:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:04:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-08 23:04:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:22,773 INFO L225 Difference]: With dead ends: 213 [2025-03-08 23:04:22,773 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 23:04:22,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:04:22,774 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 373 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:22,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 377 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 23:04:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2025-03-08 23:04:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 117 states have (on average 1.5897435897435896) internal successors, (186), 174 states have internal predecessors, (186), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2025-03-08 23:04:22,777 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 20 [2025-03-08 23:04:22,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:22,777 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2025-03-08 23:04:22,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2025-03-08 23:04:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:04:22,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:22,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:22,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:04:22,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:22,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:22,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1561444686, now seen corresponding path program 1 times [2025-03-08 23:04:22,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:22,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-03-08 23:04:22,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:22,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:22,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:04:22,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:04:22,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:23,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:23,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913904592] [2025-03-08 23:04:23,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913904592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:23,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:23,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:04:23,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24393491] [2025-03-08 23:04:23,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:23,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:04:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:23,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:04:23,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:04:23,010 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:23,295 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2025-03-08 23:04:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:04:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 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 20 [2025-03-08 23:04:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:23,295 INFO L225 Difference]: With dead ends: 161 [2025-03-08 23:04:23,295 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 23:04:23,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:04:23,296 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 147 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:23,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 232 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 23:04:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-03-08 23:04:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 159 states have internal predecessors, (171), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 177 transitions. [2025-03-08 23:04:23,300 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 177 transitions. Word has length 20 [2025-03-08 23:04:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 177 transitions. [2025-03-08 23:04:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2025-03-08 23:04:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:04:23,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:23,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:23,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:04:23,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1561444687, now seen corresponding path program 1 times [2025-03-08 23:04:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-03-08 23:04:23,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:23,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:04:23,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:04:23,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:23,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:23,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:23,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:23,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-03-08 23:04:23,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623015516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:23,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:23,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 23:04:23,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348194247] [2025-03-08 23:04:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:23,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:04:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:23,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:04:23,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:04:23,634 INFO L87 Difference]: Start difference. First operand 161 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:24,049 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2025-03-08 23:04:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 23:04:24,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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 20 [2025-03-08 23:04:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:24,051 INFO L225 Difference]: With dead ends: 175 [2025-03-08 23:04:24,051 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 23:04:24,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-08 23:04:24,051 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 193 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:24,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 298 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:04:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 23:04:24,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 165. [2025-03-08 23:04:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 163 states have internal predecessors, (179), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2025-03-08 23:04:24,054 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 20 [2025-03-08 23:04:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:24,054 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2025-03-08 23:04:24,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2025-03-08 23:04:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:04:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:24,055 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] [2025-03-08 23:04:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:04:24,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -886904317, now seen corresponding path program 1 times [2025-03-08 23:04:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-03-08 23:04:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:24,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:04:24,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:04:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290510508] [2025-03-08 23:04:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290510508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:24,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520928212] [2025-03-08 23:04:24,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:24,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:24,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:24,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:04:24,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:04:24,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:04:24,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:24,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 23:04:24,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:24,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:24,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:24,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 23:04:24,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 23:04:24,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:24,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 23:04:24,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 23:04:24,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-08 23:04:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:24,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:24,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 23:04:24,981 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 14 treesize of output 12 [2025-03-08 23:04:24,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 23:04:24,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520928212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:25,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:25,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 16 [2025-03-08 23:04:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164402180] [2025-03-08 23:04:25,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:25,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 23:04:25,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:25,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 23:04:25,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:04:25,009 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:25,357 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2025-03-08 23:04:25,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 23:04:25,357 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 25 [2025-03-08 23:04:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:25,358 INFO L225 Difference]: With dead ends: 203 [2025-03-08 23:04:25,358 INFO L226 Difference]: Without dead ends: 203 [2025-03-08 23:04:25,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-08 23:04:25,359 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 586 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:25,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 450 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-08 23:04:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2025-03-08 23:04:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.3955223880597014) internal successors, (187), 170 states have internal predecessors, (187), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2025-03-08 23:04:25,362 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 25 [2025-03-08 23:04:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2025-03-08 23:04:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2025-03-08 23:04:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:04:25,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:25,363 INFO L218 NwaCegarLoop]: trace histogram [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-08 23:04:25,370 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-08 23:04:25,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 23:04:25,564 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:25,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:25,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2116311308, now seen corresponding path program 1 times [2025-03-08 23:04:25,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:25,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575438365] [2025-03-08 23:04:25,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:25,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:25,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:04:25,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:04:25,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:25,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575438365] [2025-03-08 23:04:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575438365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:25,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:25,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 23:04:25,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467423903] [2025-03-08 23:04:25,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:25,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:25,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:25,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:25,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:25,618 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:25,734 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2025-03-08 23:04:25,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:25,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 27 [2025-03-08 23:04:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:25,735 INFO L225 Difference]: With dead ends: 175 [2025-03-08 23:04:25,735 INFO L226 Difference]: Without dead ends: 175 [2025-03-08 23:04:25,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:25,736 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 18 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:25,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 361 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-08 23:04:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2025-03-08 23:04:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 169 states have internal predecessors, (184), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 190 transitions. [2025-03-08 23:04:25,740 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 190 transitions. Word has length 27 [2025-03-08 23:04:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 190 transitions. [2025-03-08 23:04:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 190 transitions. [2025-03-08 23:04:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:04:25,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:25,742 INFO L218 NwaCegarLoop]: trace histogram [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-08 23:04:25,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:04:25,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:25,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:25,743 INFO L85 PathProgramCache]: Analyzing trace with hash -56982996, now seen corresponding path program 1 times [2025-03-08 23:04:25,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:25,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106096221] [2025-03-08 23:04:25,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:04:25,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:04:25,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:25,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:25,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:25,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106096221] [2025-03-08 23:04:25,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106096221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:25,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:25,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777005600] [2025-03-08 23:04:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:04:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:25,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:04:25,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:04:25,808 INFO L87 Difference]: Start difference. First operand 171 states and 190 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:25,885 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-03-08 23:04:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:04:25,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-08 23:04:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:25,887 INFO L225 Difference]: With dead ends: 174 [2025-03-08 23:04:25,887 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 23:04:25,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:25,887 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 15 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:25,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 307 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 23:04:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2025-03-08 23:04:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 133 states have (on average 1.368421052631579) internal successors, (182), 168 states have internal predecessors, (182), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2025-03-08 23:04:25,890 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 28 [2025-03-08 23:04:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:25,891 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2025-03-08 23:04:25,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2025-03-08 23:04:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:04:25,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:25,893 INFO L218 NwaCegarLoop]: trace histogram [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-08 23:04:25,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:04:25,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:25,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1979778616, now seen corresponding path program 1 times [2025-03-08 23:04:25,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:25,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608662232] [2025-03-08 23:04:25,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:25,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:04:25,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:04:25,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:25,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:25,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608662232] [2025-03-08 23:04:25,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608662232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:25,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94521337] [2025-03-08 23:04:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:25,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:25,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:25,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:25,991 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:26,109 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2025-03-08 23:04:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:26,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-08 23:04:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:26,110 INFO L225 Difference]: With dead ends: 169 [2025-03-08 23:04:26,110 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 23:04:26,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:26,111 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:26,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 335 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 23:04:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-08 23:04:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 167 states have internal predecessors, (181), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2025-03-08 23:04:26,116 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 28 [2025-03-08 23:04:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:26,116 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2025-03-08 23:04:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2025-03-08 23:04:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:04:26,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:26,117 INFO L218 NwaCegarLoop]: trace histogram [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-08 23:04:26,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:04:26,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1979778615, now seen corresponding path program 1 times [2025-03-08 23:04:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64893305] [2025-03-08 23:04:26,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:26,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:04:26,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:04:26,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:26,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:26,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64893305] [2025-03-08 23:04:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64893305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:26,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:26,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:26,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144283120] [2025-03-08 23:04:26,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:26,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 23:04:26,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:26,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 23:04:26,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:26,284 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:26,407 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2025-03-08 23:04:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:04:26,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-08 23:04:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:26,408 INFO L225 Difference]: With dead ends: 168 [2025-03-08 23:04:26,408 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 23:04:26,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:04:26,408 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:26,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 331 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 23:04:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-08 23:04:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 133 states have (on average 1.3533834586466165) internal successors, (180), 166 states have internal predecessors, (180), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2025-03-08 23:04:26,411 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 28 [2025-03-08 23:04:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2025-03-08 23:04:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2025-03-08 23:04:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:04:26,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:26,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:26,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:04:26,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:26,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:26,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1385858414, now seen corresponding path program 1 times [2025-03-08 23:04:26,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:26,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460115770] [2025-03-08 23:04:26,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:26,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:04:26,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:04:26,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:26,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:26,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460115770] [2025-03-08 23:04:26,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460115770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 23:04:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847153449] [2025-03-08 23:04:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:26,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:04:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:26,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:04:26,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:04:26,543 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:26,638 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2025-03-08 23:04:26,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:04:26,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 31 [2025-03-08 23:04:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:26,639 INFO L225 Difference]: With dead ends: 168 [2025-03-08 23:04:26,640 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 23:04:26,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:04:26,640 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:26,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 256 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:04:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 23:04:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-03-08 23:04:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 165 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2025-03-08 23:04:26,644 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 31 [2025-03-08 23:04:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2025-03-08 23:04:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2025-03-08 23:04:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 23:04:26,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:26,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:26,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:04:26,645 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -890588395, now seen corresponding path program 1 times [2025-03-08 23:04:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400112509] [2025-03-08 23:04:26,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:26,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:04:26,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:04:26,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:26,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:26,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400112509] [2025-03-08 23:04:26,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400112509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:26,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384811832] [2025-03-08 23:04:26,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:26,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:04:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 23:04:26,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 23:04:26,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:26,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:26,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 23:04:26,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:26,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:04:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384811832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:26,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:04:26,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-08 23:04:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450173593] [2025-03-08 23:04:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:26,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:26,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:04:26,875 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:26,910 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2025-03-08 23:04:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2025-03-08 23:04:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:26,910 INFO L225 Difference]: With dead ends: 168 [2025-03-08 23:04:26,910 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 23:04:26,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:04:26,911 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:26,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 134 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:04:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 23:04:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-08 23:04:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.328358208955224) internal successors, (178), 166 states have internal predecessors, (178), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2025-03-08 23:04:26,914 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 31 [2025-03-08 23:04:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:26,914 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2025-03-08 23:04:26,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2025-03-08 23:04:26,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 23:04:26,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:26,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:26,921 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-08 23:04:27,119 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,SelfDestructingSolverStorable17 [2025-03-08 23:04:27,120 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash 303129967, now seen corresponding path program 1 times [2025-03-08 23:04:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-08 23:04:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:27,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 23:04:27,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 23:04:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:27,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965032409] [2025-03-08 23:04:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965032409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 23:04:27,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682454154] [2025-03-08 23:04:27,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:27,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 23:04:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 23:04:27,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 23:04:27,339 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:27,766 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2025-03-08 23:04:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:04:27,766 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 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 33 [2025-03-08 23:04:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:27,767 INFO L225 Difference]: With dead ends: 199 [2025-03-08 23:04:27,767 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 23:04:27,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-08 23:04:27,768 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 326 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:27,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 330 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:04:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 23:04:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 168. [2025-03-08 23:04:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.3208955223880596) internal successors, (177), 166 states have internal predecessors, (177), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2025-03-08 23:04:27,772 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 33 [2025-03-08 23:04:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:27,773 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2025-03-08 23:04:27,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2025-03-08 23:04:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 23:04:27,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:27,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:27,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:04:27,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:27,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash 454125058, now seen corresponding path program 1 times [2025-03-08 23:04:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:27,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693486112] [2025-03-08 23:04:27,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:27,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 23:04:27,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 23:04:27,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:27,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693486112] [2025-03-08 23:04:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693486112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 23:04:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038350817] [2025-03-08 23:04:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:27,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 23:04:27,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:27,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 23:04:27,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 23:04:27,999 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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-08 23:04:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:28,263 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2025-03-08 23:04:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 23:04:28,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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 32 [2025-03-08 23:04:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:28,264 INFO L225 Difference]: With dead ends: 168 [2025-03-08 23:04:28,264 INFO L226 Difference]: Without dead ends: 168 [2025-03-08 23:04:28,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 23:04:28,265 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 40 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:28,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 373 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-08 23:04:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2025-03-08 23:04:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 165 states have internal predecessors, (176), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2025-03-08 23:04:28,268 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 32 [2025-03-08 23:04:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:28,268 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2025-03-08 23:04:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 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-08 23:04:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2025-03-08 23:04:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 23:04:28,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:28,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:28,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:04:28,269 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 454125059, now seen corresponding path program 1 times [2025-03-08 23:04:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-08 23:04:28,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 23:04:28,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 23:04:28,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122790998] [2025-03-08 23:04:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122790998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:28,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 23:04:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934585380] [2025-03-08 23:04:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:28,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 23:04:28,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:28,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 23:04:28,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:04:28,497 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-08 23:04:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:28,752 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2025-03-08 23:04:28,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:04:28,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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 32 [2025-03-08 23:04:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:28,753 INFO L225 Difference]: With dead ends: 162 [2025-03-08 23:04:28,753 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 23:04:28,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-08 23:04:28,754 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:28,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 384 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:28,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 23:04:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 151. [2025-03-08 23:04:28,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.272) internal successors, (159), 149 states have internal predecessors, (159), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2025-03-08 23:04:28,756 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 32 [2025-03-08 23:04:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:28,756 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2025-03-08 23:04:28,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 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-08 23:04:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2025-03-08 23:04:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 23:04:28,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:28,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:28,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:04:28,757 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:28,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1156955886, now seen corresponding path program 1 times [2025-03-08 23:04:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-03-08 23:04:28,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:28,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 23:04:28,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 23:04:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:28,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049930952] [2025-03-08 23:04:28,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049930952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:28,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563824625] [2025-03-08 23:04:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:28,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:28,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:28,832 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:28,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:04:28,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 23:04:28,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 23:04:28,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:28,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:28,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:04:28,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:28,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-08 23:04:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:28,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:04:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563824625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 23:04:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-03-08 23:04:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329400444] [2025-03-08 23:04:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:04:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:04:28,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:04:28,962 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:29,019 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2025-03-08 23:04:29,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 23:04:29,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2025-03-08 23:04:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:29,020 INFO L225 Difference]: With dead ends: 158 [2025-03-08 23:04:29,020 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 23:04:29,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:04:29,021 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:29,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 289 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:04:29,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 23:04:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-08 23:04:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.265625) internal successors, (162), 152 states have internal predecessors, (162), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-03-08 23:04:29,024 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 33 [2025-03-08 23:04:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:29,024 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-03-08 23:04:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-03-08 23:04:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 23:04:29,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:29,024 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, 1, 1, 1, 1] [2025-03-08 23:04:29,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 23:04:29,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:29,225 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:29,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1983174851, now seen corresponding path program 1 times [2025-03-08 23:04:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:29,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858555157] [2025-03-08 23:04:29,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:29,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 23:04:29,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 23:04:29,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:29,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858555157] [2025-03-08 23:04:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858555157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784192011] [2025-03-08 23:04:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:29,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:29,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:29,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:04:29,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 23:04:29,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 23:04:29,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:29,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:29,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 23:04:29,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:29,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:29,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 23:04:29,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-08 23:04:29,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:29,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-08 23:04:29,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-03-08 23:04:29,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2025-03-08 23:04:29,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:29,646 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 24 treesize of output 10 [2025-03-08 23:04:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:29,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:29,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784192011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:29,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:29,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 10 [2025-03-08 23:04:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926612878] [2025-03-08 23:04:29,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:29,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 23:04:29,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:29,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 23:04:29,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 23:04:29,741 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:30,099 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2025-03-08 23:04:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 23:04:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 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 34 [2025-03-08 23:04:30,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:30,100 INFO L225 Difference]: With dead ends: 176 [2025-03-08 23:04:30,100 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 23:04:30,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:04:30,100 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 19 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:30,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 472 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 23:04:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 23:04:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2025-03-08 23:04:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 163 states have internal predecessors, (175), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 179 transitions. [2025-03-08 23:04:30,103 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 179 transitions. Word has length 34 [2025-03-08 23:04:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 179 transitions. [2025-03-08 23:04:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2025-03-08 23:04:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 23:04:30,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:30,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:30,111 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-08 23:04:30,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:30,309 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:30,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1348878093, now seen corresponding path program 1 times [2025-03-08 23:04:30,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:30,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-08 23:04:30,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:30,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 23:04:30,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 23:04:30,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 23:04:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:30,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617136290] [2025-03-08 23:04:30,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617136290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:30,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:30,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:04:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562532057] [2025-03-08 23:04:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:30,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:04:30,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:30,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:04:30,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:04:30,334 INFO L87 Difference]: Start difference. First operand 165 states and 179 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:30,365 INFO L93 Difference]: Finished difference Result 164 states and 177 transitions. [2025-03-08 23:04:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:04:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2025-03-08 23:04:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:30,366 INFO L225 Difference]: With dead ends: 164 [2025-03-08 23:04:30,366 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 23:04:30,366 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-08 23:04:30,366 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:30,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 91 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:04:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 23:04:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-03-08 23:04:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 162 states have internal predecessors, (173), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2025-03-08 23:04:30,369 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 35 [2025-03-08 23:04:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:30,369 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2025-03-08 23:04:30,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2025-03-08 23:04:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 23:04:30,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:30,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:30,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 23:04:30,369 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:30,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:30,370 INFO L85 PathProgramCache]: Analyzing trace with hash -808276726, now seen corresponding path program 1 times [2025-03-08 23:04:30,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:30,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353884361] [2025-03-08 23:04:30,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:30,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:04:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:04:30,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:30,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:30,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353884361] [2025-03-08 23:04:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353884361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386237735] [2025-03-08 23:04:30,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:30,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:30,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:30,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:30,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:04:30,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 23:04:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 23:04:30,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:30,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:30,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 23:04:30,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:30,695 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-08 23:04:30,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2025-03-08 23:04:30,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2025-03-08 23:04:30,934 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 37 [2025-03-08 23:04:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:30,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 23:04:31,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386237735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:31,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:31,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-08 23:04:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290506422] [2025-03-08 23:04:31,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 23:04:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:31,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 23:04:31,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 23:04:31,194 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:31,460 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2025-03-08 23:04:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 23:04:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 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 37 [2025-03-08 23:04:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:31,461 INFO L225 Difference]: With dead ends: 174 [2025-03-08 23:04:31,461 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 23:04:31,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-08 23:04:31,461 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 7 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:31,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 349 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:04:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 23:04:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 23:04:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 147 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2025-03-08 23:04:31,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 37 [2025-03-08 23:04:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:31,464 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2025-03-08 23:04:31,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.230769230769231) internal successors, (94), 14 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2025-03-08 23:04:31,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 23:04:31,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:31,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:31,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 23:04:31,665 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,SelfDestructingSolverStorable24 [2025-03-08 23:04:31,667 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 174217936, now seen corresponding path program 1 times [2025-03-08 23:04:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:31,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928268734] [2025-03-08 23:04:31,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:31,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:31,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:04:31,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:04:31,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:31,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928268734] [2025-03-08 23:04:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928268734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567993135] [2025-03-08 23:04:32,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:32,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:32,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:32,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 23:04:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 23:04:32,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 23:04:32,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:32,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:32,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 23:04:32,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:32,314 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-08 23:04:32,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:32,378 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:04:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:04:32,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:32,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:32,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:04:32,477 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:32,477 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 41 treesize of output 38 [2025-03-08 23:04:32,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:04:32,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 16 treesize of output 8 [2025-03-08 23:04:32,539 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-08 23:04:32,556 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-08 23:04:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:32,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:32,651 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1531) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:32,691 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1531) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:32,701 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1529) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1528) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1531) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:32,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1528 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1529) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1528) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1531)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:32,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:32,715 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 38 treesize of output 39 [2025-03-08 23:04:32,717 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 70 treesize of output 62 [2025-03-08 23:04:32,721 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-08 23:04:38,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:38,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:38,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 46 [2025-03-08 23:04:38,846 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 95 treesize of output 77 [2025-03-08 23:04:38,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:04:38,854 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:38,856 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:04:38,856 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 2 case distinctions, treesize of input 25 treesize of output 1 [2025-03-08 23:04:45,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:45,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567993135] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:45,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:45,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 36 [2025-03-08 23:04:45,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496948658] [2025-03-08 23:04:45,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:45,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 23:04:45,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:45,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 23:04:45,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=823, Unknown=20, NotChecked=252, Total=1260 [2025-03-08 23:04:45,385 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:46,934 INFO L93 Difference]: Finished difference Result 229 states and 250 transitions. [2025-03-08 23:04:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 23:04:46,935 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 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 41 [2025-03-08 23:04:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:46,935 INFO L225 Difference]: With dead ends: 229 [2025-03-08 23:04:46,935 INFO L226 Difference]: Without dead ends: 229 [2025-03-08 23:04:46,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=480, Invalid=1770, Unknown=22, NotChecked=380, Total=2652 [2025-03-08 23:04:46,936 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 551 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 60 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 778 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:46,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 667 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1105 Invalid, 14 Unknown, 778 Unchecked, 0.8s Time] [2025-03-08 23:04:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-08 23:04:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 175. [2025-03-08 23:04:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 150 states have (on average 1.2333333333333334) internal successors, (185), 173 states have internal predecessors, (185), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 189 transitions. [2025-03-08 23:04:46,945 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 189 transitions. Word has length 41 [2025-03-08 23:04:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:46,945 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 189 transitions. [2025-03-08 23:04:46,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 189 transitions. [2025-03-08 23:04:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 23:04:46,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:46,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:46,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 23:04:47,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 23:04:47,147 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:47,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash -981628732, now seen corresponding path program 1 times [2025-03-08 23:04:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:47,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12775077] [2025-03-08 23:04:47,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:47,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 23:04:47,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 23:04:47,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:47,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:47,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12775077] [2025-03-08 23:04:47,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12775077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:04:47,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:04:47,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 23:04:47,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637168779] [2025-03-08 23:04:47,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:04:47,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 23:04:47,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:47,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 23:04:47,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-08 23:04:47,574 INFO L87 Difference]: Start difference. First operand 175 states and 189 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-08 23:04:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:48,198 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2025-03-08 23:04:48,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 23:04:48,198 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 43 [2025-03-08 23:04:48,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:48,199 INFO L225 Difference]: With dead ends: 220 [2025-03-08 23:04:48,199 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 23:04:48,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=757, Unknown=0, NotChecked=0, Total=992 [2025-03-08 23:04:48,200 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 358 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:48,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 570 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 23:04:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 23:04:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 167. [2025-03-08 23:04:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.2377622377622377) internal successors, (177), 165 states have internal predecessors, (177), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2025-03-08 23:04:48,203 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 43 [2025-03-08 23:04:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:48,203 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2025-03-08 23:04:48,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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-08 23:04:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2025-03-08 23:04:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:04:48,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:48,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:48,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 23:04:48,204 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:48,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 860288187, now seen corresponding path program 1 times [2025-03-08 23:04:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534262097] [2025-03-08 23:04:48,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:48,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:04:48,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:04:48,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:48,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534262097] [2025-03-08 23:04:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534262097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346803145] [2025-03-08 23:04:48,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:48,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:48,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:48,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 23:04:48,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:04:48,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:04:48,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:48,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:48,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 23:04:48,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:48,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:04:48,795 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:04:48,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:04:48,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 23:04:48,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:48,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:48,908 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:48,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 23:04:48,913 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-08 23:04:49,018 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 23:04:49,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 23:04:49,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:49,027 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-08 23:04:49,057 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:49,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-08 23:04:49,063 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-08 23:04:49,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:04:49,189 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-08 23:04:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:49,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:49,514 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_85| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_85| 0) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_85|))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_85| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_85| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1766) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1767) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_85|)))) is different from false [2025-03-08 23:04:49,744 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_85| Int) (v_ArrVal_1761 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_85| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_85|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1761) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1763) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1766) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|) 9)))) (forall ((v_ArrVal_1767 (Array Int Int)) (v_ArrVal_1766 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_85| Int) (v_ArrVal_1761 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_85| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_85|) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1763))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1761) .cse0 v_ArrVal_1766) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1767) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_85|)))))))) is different from false [2025-03-08 23:04:49,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:49,860 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 38 treesize of output 39 [2025-03-08 23:04:49,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:49,864 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 30 treesize of output 31 [2025-03-08 23:04:49,871 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 54 treesize of output 46 [2025-03-08 23:04:49,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:49,881 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 186 treesize of output 181 [2025-03-08 23:04:49,887 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 64 treesize of output 62 [2025-03-08 23:04:49,891 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 90 treesize of output 84 [2025-03-08 23:04:49,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-03-08 23:04:49,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:49,977 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 73 treesize of output 74 [2025-03-08 23:04:49,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:49,982 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 65 treesize of output 50 [2025-03-08 23:04:49,985 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:49,985 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:49,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:49,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:49,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2025-03-08 23:04:49,994 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:04:49,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:49,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:49,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2025-03-08 23:04:50,004 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 13 treesize of output 11 [2025-03-08 23:04:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:50,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346803145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:50,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:50,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 37 [2025-03-08 23:04:50,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972674264] [2025-03-08 23:04:50,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:50,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 23:04:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:50,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 23:04:50,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1117, Unknown=26, NotChecked=138, Total=1406 [2025-03-08 23:04:50,221 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand has 38 states, 37 states have (on average 3.4594594594594597) internal successors, (128), 38 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:51,612 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2025-03-08 23:04:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 23:04:51,612 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.4594594594594597) internal successors, (128), 38 states have internal predecessors, (128), 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 46 [2025-03-08 23:04:51,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:51,613 INFO L225 Difference]: With dead ends: 257 [2025-03-08 23:04:51,613 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 23:04:51,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=365, Invalid=2373, Unknown=26, NotChecked=206, Total=2970 [2025-03-08 23:04:51,614 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 510 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:51,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 862 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1683 Invalid, 0 Unknown, 427 Unchecked, 0.9s Time] [2025-03-08 23:04:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 23:04:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 204. [2025-03-08 23:04:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 180 states have (on average 1.2166666666666666) internal successors, (219), 202 states have internal predecessors, (219), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 222 transitions. [2025-03-08 23:04:51,617 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 222 transitions. Word has length 46 [2025-03-08 23:04:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:51,617 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 222 transitions. [2025-03-08 23:04:51,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.4594594594594597) internal successors, (128), 38 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 222 transitions. [2025-03-08 23:04:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 23:04:51,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:51,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:51,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 23:04:51,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:51,819 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 860288186, now seen corresponding path program 1 times [2025-03-08 23:04:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944079691] [2025-03-08 23:04:51,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:51,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:51,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:04:51,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:04:51,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:51,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:52,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944079691] [2025-03-08 23:04:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944079691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261221207] [2025-03-08 23:04:52,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:52,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:52,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:52,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:52,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 23:04:52,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 23:04:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 23:04:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:52,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:52,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 23:04:52,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:52,253 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-08 23:04:52,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:04:52,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:04:52,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:52,363 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:52,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:04:52,450 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-08 23:04:52,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 23:04:52,479 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:52,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-08 23:04:52,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 23:04:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:52,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:54,287 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-08 23:04:54,287 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 29 treesize of output 28 [2025-03-08 23:04:54,294 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_91| Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1903))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1906)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_91|)) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_91|) (< |v_ULTIMATE.start_main_~end~0#1.offset_91| 0))) is different from false [2025-03-08 23:04:54,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_91| Int) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_91|) (< |v_ULTIMATE.start_main_~end~0#1.offset_91| 0) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1903))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1906)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_91|))))) is different from false [2025-03-08 23:04:54,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:54,322 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 36 treesize of output 29 [2025-03-08 23:04:54,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:54,330 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 136 treesize of output 123 [2025-03-08 23:04:54,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:54,340 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 72 treesize of output 70 [2025-03-08 23:04:54,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2025-03-08 23:04:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261221207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:04:54,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:04:54,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34 [2025-03-08 23:04:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380028803] [2025-03-08 23:04:54,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:04:54,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 23:04:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:04:54,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 23:04:54,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=938, Unknown=5, NotChecked=126, Total=1190 [2025-03-08 23:04:54,552 INFO L87 Difference]: Start difference. First operand 204 states and 222 transitions. Second operand has 35 states, 34 states have (on average 3.588235294117647) internal successors, (122), 35 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:04:55,448 INFO L93 Difference]: Finished difference Result 257 states and 280 transitions. [2025-03-08 23:04:55,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 23:04:55,448 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.588235294117647) internal successors, (122), 35 states have internal predecessors, (122), 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 46 [2025-03-08 23:04:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:04:55,449 INFO L225 Difference]: With dead ends: 257 [2025-03-08 23:04:55,449 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 23:04:55,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=1619, Unknown=5, NotChecked=170, Total=2070 [2025-03-08 23:04:55,450 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 619 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 23:04:55,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 816 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1707 Invalid, 0 Unknown, 415 Unchecked, 0.7s Time] [2025-03-08 23:04:55,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 23:04:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 204. [2025-03-08 23:04:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 180 states have (on average 1.211111111111111) internal successors, (218), 202 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2025-03-08 23:04:55,453 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 46 [2025-03-08 23:04:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:04:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2025-03-08 23:04:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.588235294117647) internal successors, (122), 35 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:04:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2025-03-08 23:04:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 23:04:55,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:04:55,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:04:55,461 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-08 23:04:55,654 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,SelfDestructingSolverStorable28 [2025-03-08 23:04:55,654 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-03-08 23:04:55,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:04:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 666130725, now seen corresponding path program 1 times [2025-03-08 23:04:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:04:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062772148] [2025-03-08 23:04:55,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:04:55,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:04:55,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:04:55,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:04:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062772148] [2025-03-08 23:04:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062772148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 23:04:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323840670] [2025-03-08 23:04:56,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:04:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:04:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:04:56,353 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:04:56,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 23:04:56,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 23:04:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 23:04:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:04:56,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:04:56,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-08 23:04:56,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:04:56,504 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-08 23:04:56,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:04:56,567 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 23:04:56,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-08 23:04:56,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:56,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:56,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 23:04:56,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:56,644 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-08 23:04:56,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:56,678 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 0 case distinctions, treesize of input 46 treesize of output 32 [2025-03-08 23:04:56,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:04:56,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 23:04:56,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:04:56,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2025-03-08 23:04:56,782 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-08 23:04:56,819 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-08 23:04:56,831 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-08 23:04:56,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-08 23:04:56,857 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-08 23:04:56,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 23:04:56,926 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 23:04:56,926 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 1 case distinctions, treesize of input 49 treesize of output 44 [2025-03-08 23:04:56,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-08 23:04:56,944 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 24 treesize of output 12 [2025-03-08 23:04:56,981 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-08 23:04:56,988 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-08 23:04:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:04:57,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 23:04:57,078 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:57,083 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:04:57,086 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int))) (= (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:05:01,239 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2105 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2105) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2106) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2025-03-08 23:05:01,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:05:01,640 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 33 treesize of output 34 [2025-03-08 23:05:01,653 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 60 treesize of output 52 [2025-03-08 23:05:01,667 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 24 treesize of output 22 [2025-03-08 23:05:01,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or .cse0 (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_arrayElimCell_88 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not .cse0)) (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) is different from false [2025-03-08 23:05:05,849 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-03-08 23:05:05,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 310 [2025-03-08 23:05:09,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (< |c_ULTIMATE.start_main_~end~0#1.offset| (+ |c_ULTIMATE.start_main_#t~malloc4#1.offset| 4))) (.cse3 (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_prenex_2 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_2) (forall ((v_prenex_7 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_7)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_2 v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_6) |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_5) v_prenex_2 v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_2))) (or .cse2 .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse4 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103))) (or (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|) (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse5 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2094 Int)) (or (forall ((v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_arrayElimCell_88 Int)) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103))) (or (= (select (select (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse6 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (let ((.cse7 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse7 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2094 Int)) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103))) (or (= (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_2105 (Array Int Int)) (v_arrayElimCell_88 Int)) (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int) (v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103))) (or (= (select (select (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse9 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|)))) (forall ((v_prenex_2 Int)) (or (forall ((v_prenex_7 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_prenex_7)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_5) v_prenex_2 v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_2) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_2))) (or .cse2 .cse3 (forall ((v_prenex_2 Int) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_2) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_6) |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_5) v_prenex_2 v_prenex_3) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_9| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc8#1.base_9| |c_ULTIMATE.start_main_~end~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_9|) (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2103 (Array Int Int)) (v_ArrVal_2100 (Array Int Int)) (v_ArrVal_2094 Int) (v_arrayElimCell_88 Int)) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_2094)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2103))) (or (= (select (select (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_2100) |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2103) |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store (store .cse10 |v_ULTIMATE.start_main_#t~malloc8#1.base_9| v_ArrVal_2105) v_arrayElimCell_88 v_ArrVal_2108) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))))) is different from false [2025-03-08 23:05:42,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,354 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 23:05:42,391 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 2 case distinctions, treesize of input 52 treesize of output 57 [2025-03-08 23:05:42,410 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,417 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 36 treesize of output 24 [2025-03-08 23:05:42,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:05:42,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 23:05:42,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,483 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:05:42,483 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 2 case distinctions, treesize of input 28 treesize of output 1 [2025-03-08 23:05:42,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,505 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,510 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:05:42,510 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 2 case distinctions, treesize of input 36 treesize of output 1 [2025-03-08 23:05:42,522 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,522 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,533 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,540 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:05:42,541 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 2 case distinctions, treesize of input 67 treesize of output 1 [2025-03-08 23:05:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,564 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,571 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:05:42,571 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 2 case distinctions, treesize of input 59 treesize of output 1 [2025-03-08 23:05:42,592 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 23:05:42,599 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-03-08 23:05:42,599 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 2 case distinctions, treesize of input 60 treesize of output 1 [2025-03-08 23:05:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:05:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323840670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 23:05:50,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 23:05:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 57 [2025-03-08 23:05:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688433282] [2025-03-08 23:05:50,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 23:05:50,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 23:05:50,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:05:50,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 23:05:50,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2177, Unknown=30, NotChecked=618, Total=3192 [2025-03-08 23:05:50,979 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand has 57 states, 57 states have (on average 2.3859649122807016) internal successors, (136), 57 states have internal predecessors, (136), 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)