./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-1.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 a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:45,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:45,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:52:45,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:45,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:45,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:45,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:45,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:45,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:45,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:45,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:45,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:45,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:45,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:45,726 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:45,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:45,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:45,728 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:45,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:45,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:45,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:45,729 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 -> a9a441ad5f70efa202eb02609b90cbc83f5bf4487618c2a09bffcfe320d65f90 [2025-03-04 07:52:45,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:45,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:45,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:45,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:45,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:45,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-1.i [2025-03-04 07:52:47,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e620de/f7df08c5e0f64b379235521970344ef8/FLAG46d075c62 [2025-03-04 07:52:47,330 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:47,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2025-03-04 07:52:47,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e620de/f7df08c5e0f64b379235521970344ef8/FLAG46d075c62 [2025-03-04 07:52:47,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/142e620de/f7df08c5e0f64b379235521970344ef8 [2025-03-04 07:52:47,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:47,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:47,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:47,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:47,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:47,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37686b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47, skipping insertion in model container [2025-03-04 07:52:47,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:47,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:47,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:47,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:47,924 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:47,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47 WrapperNode [2025-03-04 07:52:47,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:47,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:47,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:47,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:47,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,954 INFO L138 Inliner]: procedures = 119, calls = 49, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 204 [2025-03-04 07:52:47,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:47,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:47,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:47,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:47,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,979 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-04 07:52:47,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,985 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,989 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:47,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:47,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:47,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:47,992 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (1/1) ... [2025-03-04 07:52:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:48,016 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-04 07:52:48,019 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-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:52:48,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:48,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:48,112 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:48,113 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:48,479 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:48,479 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:48,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:48,492 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:48,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:48 BoogieIcfgContainer [2025-03-04 07:52:48,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:48,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:48,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:48,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:48,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:47" (1/3) ... [2025-03-04 07:52:48,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6309205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:48, skipping insertion in model container [2025-03-04 07:52:48,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:47" (2/3) ... [2025-03-04 07:52:48,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6309205b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:48, skipping insertion in model container [2025-03-04 07:52:48,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:48" (3/3) ... [2025-03-04 07:52:48,499 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2025-03-04 07:52:48,509 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:48,510 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-queue-1.i that has 2 procedures, 175 locations, 1 initial locations, 17 loop locations, and 57 error locations. [2025-03-04 07:52:48,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:48,554 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;@156038d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:48,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2025-03-04 07:52:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 102 states have (on average 2.107843137254902) internal successors, (215), 159 states have internal predecessors, (215), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 07:52:48,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:48,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:48,562 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:48,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:48,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 258147, now seen corresponding path program 1 times [2025-03-04 07:52:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008151833] [2025-03-04 07:52:48,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:48,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:48,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:48,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:48,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:48,693 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-04 07:52:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008151833] [2025-03-04 07:52:48,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008151833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:48,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976883383] [2025-03-04 07:52:48,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:48,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:48,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:48,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:48,719 INFO L87 Difference]: Start difference. First operand has 175 states, 102 states have (on average 2.107843137254902) internal successors, (215), 159 states have internal predecessors, (215), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 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-04 07:52:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:48,870 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2025-03-04 07:52:48,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:48,871 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-04 07:52:48,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:48,875 INFO L225 Difference]: With dead ends: 151 [2025-03-04 07:52:48,876 INFO L226 Difference]: Without dead ends: 149 [2025-03-04 07:52:48,877 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-04 07:52:48,878 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:48,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 113 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-04 07:52:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-04 07:52:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 88 states have (on average 1.8181818181818181) internal successors, (160), 147 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2025-03-04 07:52:48,909 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 3 [2025-03-04 07:52:48,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:48,909 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2025-03-04 07:52:48,910 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-04 07:52:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2025-03-04 07:52:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:48,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:48,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:48,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:52:48,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:48,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 258148, now seen corresponding path program 1 times [2025-03-04 07:52:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:48,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932627178] [2025-03-04 07:52:48,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:48,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:48,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:48,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:48,984 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-04 07:52:48,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932627178] [2025-03-04 07:52:48,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932627178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:48,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:48,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897199783] [2025-03-04 07:52:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:48,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:48,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:48,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:48,987 INFO L87 Difference]: Start difference. First operand 149 states and 174 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-04 07:52:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:49,086 INFO L93 Difference]: Finished difference Result 139 states and 163 transitions. [2025-03-04 07:52:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:49,087 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-04 07:52:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:49,088 INFO L225 Difference]: With dead ends: 139 [2025-03-04 07:52:49,088 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:52:49,088 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-04 07:52:49,088 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 129 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:49,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 114 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:49,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:52:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 07:52:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.6931818181818181) internal successors, (149), 137 states have internal predecessors, (149), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2025-03-04 07:52:49,099 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 3 [2025-03-04 07:52:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:49,099 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2025-03-04 07:52:49,099 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-04 07:52:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2025-03-04 07:52:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:52:49,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:49,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:52:49,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash -925125162, now seen corresponding path program 1 times [2025-03-04 07:52:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650512486] [2025-03-04 07:52:49,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:49,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:52:49,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:52:49,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:49,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:49,255 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-04 07:52:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:49,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650512486] [2025-03-04 07:52:49,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650512486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717286639] [2025-03-04 07:52:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:49,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:49,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:49,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:49,258 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:52:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:49,403 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2025-03-04 07:52:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:49,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-04 07:52:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:49,405 INFO L225 Difference]: With dead ends: 143 [2025-03-04 07:52:49,405 INFO L226 Difference]: Without dead ends: 143 [2025-03-04 07:52:49,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-04 07:52:49,406 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 220 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:49,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 119 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:49,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-04 07:52:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2025-03-04 07:52:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 95 states have (on average 1.631578947368421) internal successors, (155), 139 states have internal predecessors, (155), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 169 transitions. [2025-03-04 07:52:49,413 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 169 transitions. Word has length 8 [2025-03-04 07:52:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:49,414 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 169 transitions. [2025-03-04 07:52:49,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 07:52:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 169 transitions. [2025-03-04 07:52:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:52:49,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:49,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:49,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:52:49,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:49,417 INFO L85 PathProgramCache]: Analyzing trace with hash -925125161, now seen corresponding path program 1 times [2025-03-04 07:52:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340023598] [2025-03-04 07:52:49,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:49,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:49,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:52:49,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:52:49,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:49,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:49,595 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-04 07:52:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340023598] [2025-03-04 07:52:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340023598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:49,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350707418] [2025-03-04 07:52:49,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:49,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:49,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:49,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:49,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:49,597 INFO L87 Difference]: Start difference. First operand 141 states and 169 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:52:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:49,807 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2025-03-04 07:52:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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 8 [2025-03-04 07:52:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:49,810 INFO L225 Difference]: With dead ends: 212 [2025-03-04 07:52:49,810 INFO L226 Difference]: Without dead ends: 212 [2025-03-04 07:52:49,810 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-04 07:52:49,811 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 342 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:49,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 163 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-04 07:52:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2025-03-04 07:52:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.6) internal successors, (160), 144 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 174 transitions. [2025-03-04 07:52:49,816 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 174 transitions. Word has length 8 [2025-03-04 07:52:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:49,817 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 174 transitions. [2025-03-04 07:52:49,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-04 07:52:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2025-03-04 07:52:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:52:49,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:49,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:49,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:52:49,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:49,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 399447153, now seen corresponding path program 1 times [2025-03-04 07:52:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108109634] [2025-03-04 07:52:49,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:49,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:52:49,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:52:49,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:49,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:49,843 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-04 07:52:49,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:49,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108109634] [2025-03-04 07:52:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108109634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:49,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57189011] [2025-03-04 07:52:49,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:49,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:49,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:49,844 INFO L87 Difference]: Start difference. First operand 146 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:49,869 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2025-03-04 07:52:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:52:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:49,870 INFO L225 Difference]: With dead ends: 141 [2025-03-04 07:52:49,870 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 07:52:49,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:49,871 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 115 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:49,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 146 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 07:52:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-04 07:52:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 100 states have (on average 1.54) internal successors, (154), 139 states have internal predecessors, (154), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 163 transitions. [2025-03-04 07:52:49,875 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 163 transitions. Word has length 11 [2025-03-04 07:52:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:49,875 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 163 transitions. [2025-03-04 07:52:49,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 163 transitions. [2025-03-04 07:52:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:49,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:49,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:52:49,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -434746224, now seen corresponding path program 1 times [2025-03-04 07:52:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:49,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238047422] [2025-03-04 07:52:49,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:49,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:49,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:49,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:49,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:49,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:49,985 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-04 07:52:49,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238047422] [2025-03-04 07:52:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238047422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439659406] [2025-03-04 07:52:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:49,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:49,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:49,988 INFO L87 Difference]: Start difference. First operand 141 states and 163 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04 07:52:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:50,184 INFO L93 Difference]: Finished difference Result 203 states and 235 transitions. [2025-03-04 07:52:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:50,186 INFO L225 Difference]: With dead ends: 203 [2025-03-04 07:52:50,186 INFO L226 Difference]: Without dead ends: 203 [2025-03-04 07:52:50,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:50,187 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:50,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 660 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-04 07:52:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 140. [2025-03-04 07:52:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 100 states have (on average 1.53) internal successors, (153), 138 states have internal predecessors, (153), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2025-03-04 07:52:50,192 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 12 [2025-03-04 07:52:50,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:50,192 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2025-03-04 07:52:50,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04 07:52:50,192 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2025-03-04 07:52:50,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:52:50,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:50,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:50,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:52:50,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:50,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash -434746223, now seen corresponding path program 1 times [2025-03-04 07:52:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625462911] [2025-03-04 07:52:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:50,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:52:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:52:50,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:50,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:50,346 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-04 07:52:50,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:50,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625462911] [2025-03-04 07:52:50,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625462911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:50,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:50,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:50,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361910696] [2025-03-04 07:52:50,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:50,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:50,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:50,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:50,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:50,348 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04 07:52:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:50,554 INFO L93 Difference]: Finished difference Result 196 states and 228 transitions. [2025-03-04 07:52:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:52:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 07:52:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:50,555 INFO L225 Difference]: With dead ends: 196 [2025-03-04 07:52:50,555 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 07:52:50,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:50,556 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 86 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:50,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 657 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 07:52:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2025-03-04 07:52:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 127 states have internal predecessors, (141), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 150 transitions. [2025-03-04 07:52:50,559 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 150 transitions. Word has length 12 [2025-03-04 07:52:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:50,560 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 150 transitions. [2025-03-04 07:52:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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-04 07:52:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 150 transitions. [2025-03-04 07:52:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:52:50,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:50,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:50,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:52:50,561 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:50,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1469217973, now seen corresponding path program 1 times [2025-03-04 07:52:50,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:50,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024808064] [2025-03-04 07:52:50,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:50,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:50,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:52:50,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:52:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:50,597 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-04 07:52:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024808064] [2025-03-04 07:52:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024808064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699020124] [2025-03-04 07:52:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:50,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:50,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:50,598 INFO L87 Difference]: Start difference. First operand 129 states and 150 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 07:52:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:50,618 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2025-03-04 07:52:50,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:50,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 07:52:50,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:50,619 INFO L225 Difference]: With dead ends: 182 [2025-03-04 07:52:50,619 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 07:52:50,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:50,620 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:50,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 253 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 07:52:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2025-03-04 07:52:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 140 states have internal predecessors, (155), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 164 transitions. [2025-03-04 07:52:50,625 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 164 transitions. Word has length 17 [2025-03-04 07:52:50,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:50,626 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 164 transitions. [2025-03-04 07:52:50,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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-04 07:52:50,626 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 164 transitions. [2025-03-04 07:52:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:50,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:50,626 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-04 07:52:50,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:52:50,626 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1683613506, now seen corresponding path program 1 times [2025-03-04 07:52:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:50,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979714498] [2025-03-04 07:52:50,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:50,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:50,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:50,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:50,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:50,761 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-04 07:52:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:50,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979714498] [2025-03-04 07:52:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979714498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:50,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:50,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:50,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850046668] [2025-03-04 07:52:50,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:50,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:50,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:50,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:50,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:50,762 INFO L87 Difference]: Start difference. First operand 142 states and 164 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-04 07:52:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:50,871 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2025-03-04 07:52:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:52:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-04 07:52:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:50,872 INFO L225 Difference]: With dead ends: 150 [2025-03-04 07:52:50,872 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 07:52:50,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:50,873 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:50,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 586 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 07:52:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2025-03-04 07:52:50,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.415929203539823) internal successors, (160), 145 states have internal predecessors, (160), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2025-03-04 07:52:50,875 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 20 [2025-03-04 07:52:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:50,875 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2025-03-04 07:52:50,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-04 07:52:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2025-03-04 07:52:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:52:50,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:50,879 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] [2025-03-04 07:52:50,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:52:50,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1693514108, now seen corresponding path program 1 times [2025-03-04 07:52:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026888222] [2025-03-04 07:52:50,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 07:52:50,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:52:50,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:50,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:50,957 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-04 07:52:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026888222] [2025-03-04 07:52:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026888222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:50,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282833830] [2025-03-04 07:52:50,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:50,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:50,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:50,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:50,958 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:51,024 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2025-03-04 07:52:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:52:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-04 07:52:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:51,025 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:51,025 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:51,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:51,026 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 80 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:51,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 553 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 113 states have (on average 1.407079646017699) internal successors, (159), 144 states have internal predecessors, (159), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2025-03-04 07:52:51,029 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 21 [2025-03-04 07:52:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:51,029 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2025-03-04 07:52:51,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2025-03-04 07:52:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:52:51,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:51,029 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] [2025-03-04 07:52:51,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:52:51,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:51,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash -350240302, now seen corresponding path program 1 times [2025-03-04 07:52:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:51,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958275072] [2025-03-04 07:52:51,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:51,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:51,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:52:51,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:52:51,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:51,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:51,092 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-04 07:52:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958275072] [2025-03-04 07:52:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958275072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45378053] [2025-03-04 07:52:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:51,094 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04 07:52:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:51,159 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2025-03-04 07:52:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-04 07:52:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:51,160 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:51,160 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:51,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:51,160 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 123 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:51,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 204 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:51,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 144 states have internal predecessors, (158), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2025-03-04 07:52:51,165 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 22 [2025-03-04 07:52:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:51,166 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2025-03-04 07:52:51,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-04 07:52:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2025-03-04 07:52:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:51,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:51,167 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-04 07:52:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:52:51,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:51,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1533295434, now seen corresponding path program 1 times [2025-03-04 07:52:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301752280] [2025-03-04 07:52:51,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:51,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:51,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:51,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:51,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:51,297 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-04 07:52:51,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301752280] [2025-03-04 07:52:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301752280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026486492] [2025-03-04 07:52:51,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:51,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:51,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:51,300 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-04 07:52:51,302 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-04 07:52:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:51,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:52:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:51,399 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-04 07:52:51,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:52:51,571 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-04 07:52:51,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:51,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-03-04 07:52:51,711 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-04 07:52:51,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026486492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:51,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:51,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 12 [2025-03-04 07:52:51,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969638556] [2025-03-04 07:52:51,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:51,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:52:51,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:51,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:52:51,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:52:51,713 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-04 07:52:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:51,919 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2025-03-04 07:52:51,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:52:51,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-04 07:52:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:51,921 INFO L225 Difference]: With dead ends: 154 [2025-03-04 07:52:51,921 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 07:52:51,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:52:51,921 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 72 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:51,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 808 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 07:52:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-04 07:52:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2025-03-04 07:52:51,925 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 25 [2025-03-04 07:52:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:51,925 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2025-03-04 07:52:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 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-04 07:52:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2025-03-04 07:52:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:51,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:51,926 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] [2025-03-04 07:52:51,933 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-04 07:52:52,126 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-04 07:52:52,128 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:52,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1533295786, now seen corresponding path program 1 times [2025-03-04 07:52:52,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:52,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401379888] [2025-03-04 07:52:52,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:52,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:52,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:52,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:52,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:52,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:52,181 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-04 07:52:52,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401379888] [2025-03-04 07:52:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401379888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:52,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091532674] [2025-03-04 07:52:52,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:52,190 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-04 07:52:52,191 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-04 07:52:52,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:52,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:52,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:52,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:52,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:52:52,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:52,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:52:52,303 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-04 07:52:52,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091532674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:52,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 07:52:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518103652] [2025-03-04 07:52:52,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:52,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:52,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:52,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:52,331 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-04 07:52:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:52,453 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2025-03-04 07:52:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:52:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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 25 [2025-03-04 07:52:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:52,454 INFO L225 Difference]: With dead ends: 155 [2025-03-04 07:52:52,454 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 07:52:52,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:52,455 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 9 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:52,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 382 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 07:52:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 07:52:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 104 states have (on average 1.4230769230769231) internal successors, (148), 135 states have internal predecessors, (148), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2025-03-04 07:52:52,458 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 25 [2025-03-04 07:52:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:52,458 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2025-03-04 07:52:52,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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-04 07:52:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2025-03-04 07:52:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:52:52,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:52,459 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] [2025-03-04 07:52:52,465 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-04 07:52:52,659 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,SelfDestructingSolverStorable12 [2025-03-04 07:52:52,660 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:52,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1346806425, now seen corresponding path program 1 times [2025-03-04 07:52:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273801485] [2025-03-04 07:52:52,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:52,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:52,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:52,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:52,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:52,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273801485] [2025-03-04 07:52:52,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273801485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:52,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911436914] [2025-03-04 07:52:52,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:52,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:52,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:52,833 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-04 07:52:52,835 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-04 07:52:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:52,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:52,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:52,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 07:52:52,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:52,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:52,932 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:52,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:52:52,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:53,004 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:53,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 07:52:53,037 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:53,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-04 07:52:53,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:52:53,084 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-04 07:52:53,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:53,127 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_308) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-04 07:52:53,131 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_308 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_308) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-04 07:52:53,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:53,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2025-03-04 07:52:53,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:53,144 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 33 treesize of output 36 [2025-03-04 07:52:53,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:52:53,241 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-04 07:52:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911436914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:53,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-04 07:52:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965164804] [2025-03-04 07:52:53,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:52:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:53,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:52:53,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=219, Unknown=6, NotChecked=62, Total=342 [2025-03-04 07:52:53,243 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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-04 07:52:53,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:53,710 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2025-03-04 07:52:53,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:52:53,710 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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-04 07:52:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:53,711 INFO L225 Difference]: With dead ends: 233 [2025-03-04 07:52:53,711 INFO L226 Difference]: Without dead ends: 233 [2025-03-04 07:52:53,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=398, Unknown=6, NotChecked=86, Total=600 [2025-03-04 07:52:53,711 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 510 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:53,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 936 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 756 Invalid, 0 Unknown, 471 Unchecked, 0.4s Time] [2025-03-04 07:52:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-04 07:52:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 152. [2025-03-04 07:52:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.3865546218487395) internal successors, (165), 150 states have internal predecessors, (165), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2025-03-04 07:52:53,717 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 31 [2025-03-04 07:52:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:53,717 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2025-03-04 07:52:53,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.4210526315789473) internal successors, (65), 19 states have internal predecessors, (65), 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-04 07:52:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2025-03-04 07:52:53,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:52:53,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:53,718 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] [2025-03-04 07:52:53,724 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-04 07:52:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:53,923 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1019228351, now seen corresponding path program 1 times [2025-03-04 07:52:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928689143] [2025-03-04 07:52:53,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:53,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:52:53,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:52:53,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:53,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928689143] [2025-03-04 07:52:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928689143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560257894] [2025-03-04 07:52:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:53,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:53,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:53,951 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-04 07:52:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:53,972 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2025-03-04 07:52:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2025-03-04 07:52:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:53,973 INFO L225 Difference]: With dead ends: 211 [2025-03-04 07:52:53,973 INFO L226 Difference]: Without dead ends: 211 [2025-03-04 07:52:53,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:53,974 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:53,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 249 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-04 07:52:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2025-03-04 07:52:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 168 states have internal predecessors, (183), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2025-03-04 07:52:53,977 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 32 [2025-03-04 07:52:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2025-03-04 07:52:53,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-04 07:52:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2025-03-04 07:52:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:52:53,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:53,978 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] [2025-03-04 07:52:53,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:52:53,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:53,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1434796838, now seen corresponding path program 1 times [2025-03-04 07:52:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768172278] [2025-03-04 07:52:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:53,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:52:53,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:52:53,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:53,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:54,252 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-04 07:52:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768172278] [2025-03-04 07:52:54,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768172278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521233905] [2025-03-04 07:52:54,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:54,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:54,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:54,255 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-04 07:52:54,257 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-04 07:52:54,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:52:54,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:52:54,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:54,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:54,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:52:54,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:54,336 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-04 07:52:54,364 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:52:54,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:52:54,396 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-04 07:52:54,486 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:54,487 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-04 07:52:54,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:54,507 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-04 07:52:54,595 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-04 07:52:54,659 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-04 07:52:54,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:54,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2025-03-04 07:52:54,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_416 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_416) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2025-03-04 07:52:54,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:54,745 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 20 treesize of output 21 [2025-03-04 07:52:54,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:54,751 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 34 treesize of output 37 [2025-03-04 07:52:54,765 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 5 [2025-03-04 07:52:54,980 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-04 07:52:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521233905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:54,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:54,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2025-03-04 07:52:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047716769] [2025-03-04 07:52:54,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:52:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:54,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:52:54,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=525, Unknown=12, NotChecked=98, Total=756 [2025-03-04 07:52:54,985 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 28 states have internal predecessors, (111), 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-04 07:52:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:55,715 INFO L93 Difference]: Finished difference Result 291 states and 335 transitions. [2025-03-04 07:52:55,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:52:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 28 states have internal predecessors, (111), 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 39 [2025-03-04 07:52:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:55,716 INFO L225 Difference]: With dead ends: 291 [2025-03-04 07:52:55,717 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 07:52:55,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1038, Unknown=13, NotChecked=142, Total=1482 [2025-03-04 07:52:55,718 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 679 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:55,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 795 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 922 Invalid, 0 Unknown, 598 Unchecked, 0.5s Time] [2025-03-04 07:52:55,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 07:52:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 181. [2025-03-04 07:52:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 148 states have (on average 1.337837837837838) internal successors, (198), 179 states have internal predecessors, (198), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:55,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 206 transitions. [2025-03-04 07:52:55,723 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 206 transitions. Word has length 39 [2025-03-04 07:52:55,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:55,723 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 206 transitions. [2025-03-04 07:52:55,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.111111111111111) internal successors, (111), 28 states have internal predecessors, (111), 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-04 07:52:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 206 transitions. [2025-03-04 07:52:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:52:55,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:55,724 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] [2025-03-04 07:52:55,731 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-04 07:52:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:52:55,927 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1434796837, now seen corresponding path program 1 times [2025-03-04 07:52:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379603817] [2025-03-04 07:52:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:55,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:52:55,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:52:55,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:55,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:56,341 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-04 07:52:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379603817] [2025-03-04 07:52:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379603817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328082266] [2025-03-04 07:52:56,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:56,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:56,343 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-04 07:52:56,345 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-04 07:52:56,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:52:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:52:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:56,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 07:52:56,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:56,424 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-04 07:52:56,465 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:56,466 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-04 07:52:56,475 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-04 07:52:56,482 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-04 07:52:56,487 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-04 07:52:56,568 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:56,569 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-04 07:52:56,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:56,575 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-04 07:52:56,591 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:56,591 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-04 07:52:56,596 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-04 07:52:56,692 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-04 07:52:56,694 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-04 07:52:56,723 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-04 07:52:56,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:56,847 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_494 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2025-03-04 07:52:56,911 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_494 (Array Int Int)) (v_ArrVal_493 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_493) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_494 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_494) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2025-03-04 07:52:56,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:56,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-03-04 07:52:56,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:56,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 07:52:56,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:56,930 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 52 treesize of output 55 [2025-03-04 07:52:56,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:56,939 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 82 treesize of output 81 [2025-03-04 07:52:56,943 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 11 treesize of output 9 [2025-03-04 07:52:56,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 07:52:56,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 07:52:56,973 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:52:56,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 07:52:57,064 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-04 07:52:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328082266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:57,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 30 [2025-03-04 07:52:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615351291] [2025-03-04 07:52:57,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:52:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:57,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:52:57,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=697, Unknown=13, NotChecked=110, Total=930 [2025-03-04 07:52:57,066 INFO L87 Difference]: Start difference. First operand 181 states and 206 transitions. Second operand has 31 states, 30 states have (on average 3.8) internal successors, (114), 31 states have internal predecessors, (114), 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-04 07:52:58,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:58,107 INFO L93 Difference]: Finished difference Result 286 states and 328 transitions. [2025-03-04 07:52:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:52:58,107 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.8) internal successors, (114), 31 states have internal predecessors, (114), 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 39 [2025-03-04 07:52:58,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:58,108 INFO L225 Difference]: With dead ends: 286 [2025-03-04 07:52:58,108 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 07:52:58,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=1636, Unknown=15, NotChecked=174, Total=2162 [2025-03-04 07:52:58,110 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1229 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 587 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:58,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1103 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1363 Invalid, 0 Unknown, 587 Unchecked, 0.6s Time] [2025-03-04 07:52:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 07:52:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 185. [2025-03-04 07:52:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.3289473684210527) internal successors, (202), 183 states have internal predecessors, (202), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 210 transitions. [2025-03-04 07:52:58,113 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 210 transitions. Word has length 39 [2025-03-04 07:52:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:58,113 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 210 transitions. [2025-03-04 07:52:58,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.8) internal successors, (114), 31 states have internal predecessors, (114), 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-04 07:52:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 210 transitions. [2025-03-04 07:52:58,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:52:58,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:58,114 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] [2025-03-04 07:52:58,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:52:58,314 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,SelfDestructingSolverStorable16 [2025-03-04 07:52:58,314 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -518890705, now seen corresponding path program 1 times [2025-03-04 07:52:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561571372] [2025-03-04 07:52:58,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:58,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:52:58,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:52:58,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:58,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:58,339 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-04 07:52:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561571372] [2025-03-04 07:52:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561571372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:58,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365507204] [2025-03-04 07:52:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:58,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:58,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:58,341 INFO L87 Difference]: Start difference. First operand 185 states and 210 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-04 07:52:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:58,345 INFO L93 Difference]: Finished difference Result 186 states and 210 transitions. [2025-03-04 07:52:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:58,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 42 [2025-03-04 07:52:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:58,346 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:52:58,347 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:52:58,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:58,347 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:58,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:52:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2025-03-04 07:52:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 184 states have internal predecessors, (202), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2025-03-04 07:52:58,351 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 42 [2025-03-04 07:52:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:58,351 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2025-03-04 07:52:58,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-04 07:52:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2025-03-04 07:52:58,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:52:58,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:58,352 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] [2025-03-04 07:52:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:52:58,352 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:52:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 350045583, now seen corresponding path program 1 times [2025-03-04 07:52:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:58,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439856303] [2025-03-04 07:52:58,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:58,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:52:58,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:52:58,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:58,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:58,811 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-04 07:52:58,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439856303] [2025-03-04 07:52:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439856303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943707321] [2025-03-04 07:52:58,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:58,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:58,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:58,814 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-04 07:52:58,816 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-04 07:52:58,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:52:58,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:52:58,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:58,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:58,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:52:58,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:58,893 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-04 07:52:58,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:52:58,925 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-04 07:52:58,945 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-04 07:52:58,947 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-04 07:52:59,018 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:52:59,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 16 treesize of output 15 [2025-03-04 07:52:59,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:52:59,031 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:52:59,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-03-04 07:52:59,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:59,058 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 97 treesize of output 86 [2025-03-04 07:52:59,062 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 73 treesize of output 56 [2025-03-04 07:52:59,065 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 39 treesize of output 1 [2025-03-04 07:52:59,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 07:52:59,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-03-04 07:52:59,175 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 19 treesize of output 7 [2025-03-04 07:52:59,190 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-04 07:52:59,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:59,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 52 [2025-03-04 07:52:59,341 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_605 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_607 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2025-03-04 07:52:59,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_607 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_607) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (forall ((v_ArrVal_605 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))) is different from false [2025-03-04 07:52:59,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:59,357 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 18 treesize of output 19 [2025-03-04 07:52:59,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:59,363 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 30 treesize of output 33 [2025-03-04 07:52:59,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-04 07:52:59,376 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:52:59,376 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 18 treesize of output 1 [2025-03-04 07:52:59,433 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-04 07:52:59,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943707321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:59,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 34 [2025-03-04 07:52:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154361076] [2025-03-04 07:52:59,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:59,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:52:59,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:59,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:52:59,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=879, Unknown=14, NotChecked=122, Total=1122 [2025-03-04 07:52:59,435 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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-04 07:53:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:00,542 INFO L93 Difference]: Finished difference Result 300 states and 340 transitions. [2025-03-04 07:53:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:53:00,542 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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 44 [2025-03-04 07:53:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:00,543 INFO L225 Difference]: With dead ends: 300 [2025-03-04 07:53:00,543 INFO L226 Difference]: Without dead ends: 300 [2025-03-04 07:53:00,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=403, Invalid=2243, Unknown=14, NotChecked=202, Total=2862 [2025-03-04 07:53:00,544 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 604 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 589 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:00,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1538 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1440 Invalid, 0 Unknown, 589 Unchecked, 0.6s Time] [2025-03-04 07:53:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-04 07:53:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 185. [2025-03-04 07:53:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.3157894736842106) internal successors, (200), 183 states have internal predecessors, (200), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2025-03-04 07:53:00,547 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 44 [2025-03-04 07:53:00,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:00,547 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2025-03-04 07:53:00,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.323529411764706) internal successors, (113), 34 states have internal predecessors, (113), 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-04 07:53:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2025-03-04 07:53:00,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:53:00,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:00,548 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] [2025-03-04 07:53:00,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:53:00,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:00,752 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:00,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:00,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1177600769, now seen corresponding path program 1 times [2025-03-04 07:53:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124998351] [2025-03-04 07:53:00,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:00,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:00,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:00,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:00,987 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-04 07:53:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124998351] [2025-03-04 07:53:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124998351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38028046] [2025-03-04 07:53:00,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:00,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:00,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:00,989 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-04 07:53:00,991 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-04 07:53:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:01,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:01,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:01,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 07:53:01,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:01,076 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-04 07:53:01,099 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:53:01,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:01,127 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-04 07:53:01,204 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:01,204 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-04 07:53:01,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:01,225 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-04 07:53:01,341 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-04 07:53:01,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2025-03-04 07:53:01,385 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-04 07:53:01,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:01,465 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2025-03-04 07:53:01,508 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_683 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|))) (forall ((v_ArrVal_683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_683) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2025-03-04 07:53:01,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:01,516 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 19 treesize of output 20 [2025-03-04 07:53:01,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:01,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2025-03-04 07:53:01,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-04 07:53:01,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:01,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 07:53:01,544 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:01,546 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 07:53:01,605 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-04 07:53:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38028046] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:01,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 26 [2025-03-04 07:53:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813813781] [2025-03-04 07:53:01,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:53:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:53:01,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=496, Unknown=10, NotChecked=94, Total=702 [2025-03-04 07:53:01,607 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 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-04 07:53:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:01,906 INFO L93 Difference]: Finished difference Result 218 states and 248 transitions. [2025-03-04 07:53:01,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:53:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 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 44 [2025-03-04 07:53:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:01,907 INFO L225 Difference]: With dead ends: 218 [2025-03-04 07:53:01,907 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 07:53:01,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=496, Unknown=10, NotChecked=94, Total=702 [2025-03-04 07:53:01,908 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 205 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:01,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 981 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 841 Invalid, 0 Unknown, 389 Unchecked, 0.3s Time] [2025-03-04 07:53:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 07:53:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2025-03-04 07:53:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.3371428571428572) internal successors, (234), 206 states have internal predecessors, (234), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 242 transitions. [2025-03-04 07:53:01,911 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 242 transitions. Word has length 44 [2025-03-04 07:53:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:01,911 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 242 transitions. [2025-03-04 07:53:01,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 27 states have internal predecessors, (99), 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-04 07:53:01,911 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 242 transitions. [2025-03-04 07:53:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:53:01,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:01,911 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] [2025-03-04 07:53:01,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 07:53:02,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:02,115 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:02,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1177600768, now seen corresponding path program 1 times [2025-03-04 07:53:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:02,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48488247] [2025-03-04 07:53:02,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:02,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:02,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:02,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:02,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:02,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:02,345 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-04 07:53:02,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48488247] [2025-03-04 07:53:02,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48488247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:02,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12922027] [2025-03-04 07:53:02,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:02,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:02,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:02,347 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-04 07:53:02,347 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-04 07:53:02,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:02,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:02,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:02,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:02,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:53:02,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:02,448 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-04 07:53:02,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:53:02,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:02,469 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-04 07:53:02,493 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-04 07:53:02,495 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-04 07:53:02,568 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:02,568 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-04 07:53:02,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:53:02,575 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-04 07:53:02,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:02,592 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-04 07:53:02,594 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-04 07:53:02,704 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-04 07:53:02,707 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-04 07:53:02,745 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-04 07:53:02,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:02,876 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_763) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_764 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2025-03-04 07:53:02,890 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_764 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_764) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_764 (Array Int Int)) (v_ArrVal_763 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_764) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_763) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2025-03-04 07:53:02,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:02,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-03-04 07:53:02,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:02,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-04 07:53:02,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:02,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2025-03-04 07:53:02,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:02,971 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 82 treesize of output 81 [2025-03-04 07:53:02,974 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 11 treesize of output 9 [2025-03-04 07:53:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-04 07:53:02,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:02,992 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 18 treesize of output 19 [2025-03-04 07:53:02,995 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:53:02,996 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 07:53:03,068 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-04 07:53:03,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12922027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:03,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-04 07:53:03,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802645698] [2025-03-04 07:53:03,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:03,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:53:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:03,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:53:03,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=521, Unknown=6, NotChecked=94, Total=702 [2025-03-04 07:53:03,069 INFO L87 Difference]: Start difference. First operand 208 states and 242 transitions. Second operand has 27 states, 26 states have (on average 4.884615384615385) internal successors, (127), 27 states have internal predecessors, (127), 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-04 07:53:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:03,573 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2025-03-04 07:53:03,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:53:03,573 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.884615384615385) internal successors, (127), 27 states have internal predecessors, (127), 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 44 [2025-03-04 07:53:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:03,574 INFO L225 Difference]: With dead ends: 218 [2025-03-04 07:53:03,574 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 07:53:03,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=825, Unknown=6, NotChecked=122, Total=1122 [2025-03-04 07:53:03,574 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 399 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 384 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:03,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 950 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1026 Invalid, 0 Unknown, 384 Unchecked, 0.4s Time] [2025-03-04 07:53:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 07:53:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2025-03-04 07:53:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.3314285714285714) internal successors, (233), 206 states have internal predecessors, (233), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2025-03-04 07:53:03,578 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 44 [2025-03-04 07:53:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2025-03-04 07:53:03,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.884615384615385) internal successors, (127), 27 states have internal predecessors, (127), 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-04 07:53:03,578 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2025-03-04 07:53:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 07:53:03,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:03,578 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] [2025-03-04 07:53:03,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:53:03,782 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,SelfDestructingSolverStorable20 [2025-03-04 07:53:03,782 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:03,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1177601121, now seen corresponding path program 1 times [2025-03-04 07:53:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:03,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793163575] [2025-03-04 07:53:03,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:03,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:03,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:03,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:03,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:53:03,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793163575] [2025-03-04 07:53:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793163575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:03,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100352112] [2025-03-04 07:53:03,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:03,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:03,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:03,854 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-04 07:53:03,855 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-04 07:53:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 07:53:03,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 07:53:03,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:03,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:03,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 07:53:03,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-04 07:53:03,987 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 21 treesize of output 13 [2025-03-04 07:53:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:53:04,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:53:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100352112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:04,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:04,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2025-03-04 07:53:04,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103784531] [2025-03-04 07:53:04,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:04,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:53:04,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:04,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:53:04,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:53:04,061 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-04 07:53:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:04,304 INFO L93 Difference]: Finished difference Result 236 states and 276 transitions. [2025-03-04 07:53:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:53:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 44 [2025-03-04 07:53:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:04,306 INFO L225 Difference]: With dead ends: 236 [2025-03-04 07:53:04,306 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 07:53:04,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:53:04,307 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 242 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:04,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 746 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:53:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 07:53:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 222. [2025-03-04 07:53:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 189 states have (on average 1.3015873015873016) internal successors, (246), 220 states have internal predecessors, (246), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 254 transitions. [2025-03-04 07:53:04,313 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 254 transitions. Word has length 44 [2025-03-04 07:53:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:04,313 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 254 transitions. [2025-03-04 07:53:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-04 07:53:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 254 transitions. [2025-03-04 07:53:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:53:04,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:04,314 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:04,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:53:04,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:04,515 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1260932901, now seen corresponding path program 1 times [2025-03-04 07:53:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264585942] [2025-03-04 07:53:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:04,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:04,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:53:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:53:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:53:04,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:04,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264585942] [2025-03-04 07:53:04,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264585942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:53:04,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:53:04,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:53:04,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357502529] [2025-03-04 07:53:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:53:04,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:53:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:04,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:53:04,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:04,548 INFO L87 Difference]: Start difference. First operand 222 states and 254 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-04 07:53:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:04,567 INFO L93 Difference]: Finished difference Result 292 states and 331 transitions. [2025-03-04 07:53:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:53:04,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 46 [2025-03-04 07:53:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:04,568 INFO L225 Difference]: With dead ends: 292 [2025-03-04 07:53:04,568 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 07:53:04,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:53:04,569 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 58 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:04,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 286 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:53:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 07:53:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 241. [2025-03-04 07:53:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 208 states have (on average 1.2788461538461537) internal successors, (266), 239 states have internal predecessors, (266), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 274 transitions. [2025-03-04 07:53:04,573 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 274 transitions. Word has length 46 [2025-03-04 07:53:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:04,573 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 274 transitions. [2025-03-04 07:53:04,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-04 07:53:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 274 transitions. [2025-03-04 07:53:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:53:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:04,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:53:04,574 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2097940643, now seen corresponding path program 1 times [2025-03-04 07:53:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086314795] [2025-03-04 07:53:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:53:04,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:53:04,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:04,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086314795] [2025-03-04 07:53:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086314795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014798606] [2025-03-04 07:53:04,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:04,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:04,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:04,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:04,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:53:04,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:53:04,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:53:04,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:04,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:04,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:53:04,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:04,874 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-04 07:53:04,935 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 07:53:04,935 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 19 treesize of output 18 [2025-03-04 07:53:04,962 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 07:53:04,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:53:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:05,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:05,173 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_962) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (or (= .cse0 0) (not (= v_ArrVal_962 (let ((.cse1 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1 (select v_ArrVal_962 .cse1))))) (< .cse0 0)))) is different from false [2025-03-04 07:53:05,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:05,289 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 63 treesize of output 47 [2025-03-04 07:53:05,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:05,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 85 [2025-03-04 07:53:05,311 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 6 treesize of output 4 [2025-03-04 07:53:05,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:05,349 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 21 treesize of output 23 [2025-03-04 07:53:05,367 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 11 treesize of output 7 [2025-03-04 07:53:05,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:05,381 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 159 treesize of output 155 [2025-03-04 07:53:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014798606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:05,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 30 [2025-03-04 07:53:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470825249] [2025-03-04 07:53:05,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 07:53:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:05,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 07:53:05,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=721, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:53:05,498 INFO L87 Difference]: Start difference. First operand 241 states and 274 transitions. Second operand has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 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-04 07:53:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:06,133 INFO L93 Difference]: Finished difference Result 284 states and 316 transitions. [2025-03-04 07:53:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:53:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 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-04 07:53:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:06,134 INFO L225 Difference]: With dead ends: 284 [2025-03-04 07:53:06,134 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 07:53:06,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=359, Invalid=1356, Unknown=11, NotChecked=80, Total=1806 [2025-03-04 07:53:06,135 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 528 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 39 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:06,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1151 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 914 Invalid, 26 Unknown, 221 Unchecked, 0.5s Time] [2025-03-04 07:53:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 07:53:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 243. [2025-03-04 07:53:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 210 states have (on average 1.276190476190476) internal successors, (268), 241 states have internal predecessors, (268), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:53:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 276 transitions. [2025-03-04 07:53:06,138 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 276 transitions. Word has length 46 [2025-03-04 07:53:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:06,138 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 276 transitions. [2025-03-04 07:53:06,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.266666666666667) internal successors, (128), 31 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-04 07:53:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 276 transitions. [2025-03-04 07:53:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:53:06,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:06,139 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:06,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:53:06,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:53:06,343 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:06,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:06,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1783687869, now seen corresponding path program 1 times [2025-03-04 07:53:06,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:06,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011540112] [2025-03-04 07:53:06,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:06,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:06,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:06,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011540112] [2025-03-04 07:53:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011540112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:06,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517712603] [2025-03-04 07:53:06,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:06,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:06,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:06,640 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:06,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:53:06,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:06,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:06,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 07:53:06,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:06,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-04 07:53:06,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:06,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:53:06,771 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:53:06,842 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:06,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 07:53:06,858 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:06,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2025-03-04 07:53:06,891 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:06,891 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-04 07:53:06,923 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:53:06,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 19 [2025-03-04 07:53:07,002 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:07,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 43 [2025-03-04 07:53:07,007 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 12 treesize of output 8 [2025-03-04 07:53:07,063 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2025-03-04 07:53:07,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2025-03-04 07:53:07,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:53:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:07,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:07,122 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-04 07:53:07,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1079 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2025-03-04 07:53:07,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:07,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2025-03-04 07:53:07,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1079 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_84| Int)) (let ((.cse0 (select v_arrayElimArr_14 |v_ULTIMATE.start_main_~item~0#1.offset_84|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1079) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2025-03-04 07:53:07,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,302 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 24 treesize of output 25 [2025-03-04 07:53:07,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,308 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 73 treesize of output 76 [2025-03-04 07:53:07,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:07,313 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 69 treesize of output 65 [2025-03-04 07:53:07,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2025-03-04 07:53:07,325 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 07:53:07,325 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 13 treesize of output 12 [2025-03-04 07:53:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:53:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517712603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:07,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 35 [2025-03-04 07:53:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372891205] [2025-03-04 07:53:07,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 07:53:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:07,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 07:53:07,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=772, Unknown=28, NotChecked=244, Total=1190 [2025-03-04 07:53:07,425 INFO L87 Difference]: Start difference. First operand 243 states and 276 transitions. Second operand has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 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-04 07:53:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:08,390 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2025-03-04 07:53:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 07:53:08,391 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 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 47 [2025-03-04 07:53:08,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:08,391 INFO L225 Difference]: With dead ends: 279 [2025-03-04 07:53:08,391 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 07:53:08,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=522, Invalid=2434, Unknown=30, NotChecked=436, Total=3422 [2025-03-04 07:53:08,392 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 638 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 840 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:08,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 980 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1052 Invalid, 0 Unknown, 840 Unchecked, 0.4s Time] [2025-03-04 07:53:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 07:53:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 242. [2025-03-04 07:53:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 210 states have (on average 1.2714285714285714) internal successors, (267), 240 states have internal predecessors, (267), 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-04 07:53:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 274 transitions. [2025-03-04 07:53:08,395 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 274 transitions. Word has length 47 [2025-03-04 07:53:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:08,395 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 274 transitions. [2025-03-04 07:53:08,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.2) internal successors, (112), 35 states have internal predecessors, (112), 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-04 07:53:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 274 transitions. [2025-03-04 07:53:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:53:08,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:08,396 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:08,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:53:08,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:53:08,600 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:08,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash -611650512, now seen corresponding path program 1 times [2025-03-04 07:53:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:08,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758374818] [2025-03-04 07:53:08,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:08,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:08,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:08,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:08,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758374818] [2025-03-04 07:53:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758374818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77670933] [2025-03-04 07:53:08,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:08,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:08,773 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:08,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:53:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:08,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:53:08,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:08,867 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-04 07:53:08,881 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:53:08,882 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-04 07:53:08,889 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-04 07:53:08,946 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:08,946 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-04 07:53:08,961 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:53:08,962 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-04 07:53:09,027 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-04 07:53:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:09,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:09,108 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1154) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2025-03-04 07:53:09,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:09,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2025-03-04 07:53:09,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:09,142 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 30 treesize of output 33 [2025-03-04 07:53:09,144 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 5 [2025-03-04 07:53:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77670933] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:09,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-03-04 07:53:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375627998] [2025-03-04 07:53:09,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:53:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:09,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:53:09,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=309, Unknown=13, NotChecked=36, Total=420 [2025-03-04 07:53:09,187 INFO L87 Difference]: Start difference. First operand 242 states and 274 transitions. Second operand has 21 states, 20 states have (on average 4.65) internal successors, (93), 21 states have internal predecessors, (93), 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-04 07:53:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:53:09,512 INFO L93 Difference]: Finished difference Result 253 states and 281 transitions. [2025-03-04 07:53:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:53:09,513 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.65) internal successors, (93), 21 states have internal predecessors, (93), 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 47 [2025-03-04 07:53:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:53:09,513 INFO L225 Difference]: With dead ends: 253 [2025-03-04 07:53:09,513 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 07:53:09,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=656, Unknown=13, NotChecked=54, Total=870 [2025-03-04 07:53:09,514 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 591 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:53:09,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 715 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 639 Invalid, 0 Unknown, 195 Unchecked, 0.2s Time] [2025-03-04 07:53:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 07:53:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2025-03-04 07:53:09,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 211 states have (on average 1.2701421800947867) internal successors, (268), 241 states have internal predecessors, (268), 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-04 07:53:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 275 transitions. [2025-03-04 07:53:09,517 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 275 transitions. Word has length 47 [2025-03-04 07:53:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:53:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 275 transitions. [2025-03-04 07:53:09,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.65) internal successors, (93), 21 states have internal predecessors, (93), 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-04 07:53:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 275 transitions. [2025-03-04 07:53:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 07:53:09,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:53:09,517 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:53:09,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:53:09,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 07:53:09,718 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 54 more)] === [2025-03-04 07:53:09,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:53:09,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1783766643, now seen corresponding path program 1 times [2025-03-04 07:53:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:53:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987557787] [2025-03-04 07:53:09,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:09,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:53:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:09,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:09,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:09,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:10,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:53:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987557787] [2025-03-04 07:53:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987557787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:53:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154227805] [2025-03-04 07:53:10,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:53:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:53:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:53:10,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:53:10,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:53:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 07:53:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 07:53:10,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:53:10,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:53:10,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 07:53:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:53:10,133 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-04 07:53:10,158 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:53:10,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:53:10,192 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-04 07:53:10,262 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:10,263 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-04 07:53:10,276 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-04 07:53:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-04 07:53:10,333 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-03-04 07:53:10,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-03-04 07:53:10,367 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:53:10,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2025-03-04 07:53:10,488 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2025-03-04 07:53:10,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2025-03-04 07:53:10,554 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-03-04 07:53:10,554 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 64 [2025-03-04 07:53:10,703 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:53:10,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2025-03-04 07:53:10,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:53:10,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:53:10,750 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2025-03-04 07:53:10,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:10,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-04 07:53:10,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:10,999 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-04 07:53:11,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:11,004 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 190 treesize of output 189 [2025-03-04 07:53:11,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:53:11,011 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 88 treesize of output 80 [2025-03-04 07:53:11,015 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 34 treesize of output 30 [2025-03-04 07:53:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-04 07:53:15,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154227805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:53:15,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:53:15,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 38 [2025-03-04 07:53:15,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162706364] [2025-03-04 07:53:15,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:53:15,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:53:15,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:53:15,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:53:15,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1220, Unknown=9, NotChecked=72, Total=1482 [2025-03-04 07:53:15,919 INFO L87 Difference]: Start difference. First operand 243 states and 275 transitions. Second operand has 39 states, 38 states have (on average 3.1052631578947367) internal successors, (118), 39 states have internal predecessors, (118), 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-04 07:53:20,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:53:24,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:53:28,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:53:33,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:53:37,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 07:53:49,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:53:53,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:05,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:09,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:13,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:17,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:21,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 07:54:25,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]