./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strchr_short.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-dietlibc/strchr_short.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash b9f420c703006a20f84c0f072fc483abdc031419ba97e1947a58423e06686a36 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:48:25,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:48:25,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 11:48:25,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:48:25,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:48:25,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:48:25,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:48:25,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:48:25,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:48:25,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:48:25,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:48:25,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:48:25,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:48:25,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:48:25,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:48:25,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:48:25,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:48:25,902 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9f420c703006a20f84c0f072fc483abdc031419ba97e1947a58423e06686a36 [2025-03-17 11:48:26,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:48:26,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:48:26,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:48:26,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:48:26,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:48:26,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strchr_short.i [2025-03-17 11:48:27,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de31f5915/93c9d8ddc52f4254b1efa3636d6898bf/FLAG1fefd138e [2025-03-17 11:48:27,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:48:27,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strchr_short.i [2025-03-17 11:48:27,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de31f5915/93c9d8ddc52f4254b1efa3636d6898bf/FLAG1fefd138e [2025-03-17 11:48:27,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de31f5915/93c9d8ddc52f4254b1efa3636d6898bf [2025-03-17 11:48:27,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:48:27,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:48:27,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:48:27,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:48:27,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:48:27,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:27,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e85379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27, skipping insertion in model container [2025-03-17 11:48:27,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:27,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:48:27,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:48:27,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:48:27,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:48:27,997 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:48:27,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27 WrapperNode [2025-03-17 11:48:27,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:48:27,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:48:27,998 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:48:27,998 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:48:28,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,026 INFO L138 Inliner]: procedures = 113, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 48 [2025-03-17 11:48:28,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:48:28,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:48:28,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:48:28,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:48:28,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,047 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-03-17 11:48:28,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:48:28,055 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:48:28,055 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:48:28,055 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:48:28,056 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (1/1) ... [2025-03-17 11:48:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:48:28,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:28,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:48:28,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:48:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:48:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:48:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:48:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:48:28,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:48:28,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:48:28,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:48:28,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:48:28,290 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L520: havoc main_#t~ret8#1.base, main_#t~ret8#1.offset;call ULTIMATE.dealloc(main_#t~malloc6#1.base, main_#t~malloc6#1.offset);havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; [2025-03-17 11:48:28,298 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-17 11:48:28,299 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:48:28,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:48:28,304 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:48:28,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:48:28 BoogieIcfgContainer [2025-03-17 11:48:28,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:48:28,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:48:28,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:48:28,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:48:28,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:48:27" (1/3) ... [2025-03-17 11:48:28,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39303c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:48:28, skipping insertion in model container [2025-03-17 11:48:28,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:27" (2/3) ... [2025-03-17 11:48:28,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39303c7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:48:28, skipping insertion in model container [2025-03-17 11:48:28,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:48:28" (3/3) ... [2025-03-17 11:48:28,312 INFO L128 eAbstractionObserver]: Analyzing ICFG strchr_short.i [2025-03-17 11:48:28,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:48:28,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strchr_short.i that has 1 procedures, 20 locations, 1 initial locations, 1 loop locations, and 7 error locations. [2025-03-17 11:48:28,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:48:28,370 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;@6b48aaac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:48:28,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 11:48:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:28,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:28,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:28,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:28,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 59459, now seen corresponding path program 1 times [2025-03-17 11:48:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:28,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171604606] [2025-03-17 11:48:28,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:28,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:28,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:28,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:28,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:28,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171604606] [2025-03-17 11:48:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171604606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:28,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:48:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140206208] [2025-03-17 11:48:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:48:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:28,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:48:28,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:28,524 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 19 states have internal predecessors, (23), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 11:48:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:28,555 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-17 11:48:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:48:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 11:48:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:28,560 INFO L225 Difference]: With dead ends: 21 [2025-03-17 11:48:28,560 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 11:48:28,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:28,563 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:28,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 11:48:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 11:48:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-17 11:48:28,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 3 [2025-03-17 11:48:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:28,588 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-17 11:48:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 11:48:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-17 11:48:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:28,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:28,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:28,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:48:28,589 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:28,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 59543, now seen corresponding path program 1 times [2025-03-17 11:48:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:28,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239173546] [2025-03-17 11:48:28,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:28,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:28,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:28,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:28,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:28,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:28,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239173546] [2025-03-17 11:48:28,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239173546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:28,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:28,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:28,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652088639] [2025-03-17 11:48:28,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:28,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:48:28,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:28,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:48:28,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:28,652 INFO L87 Difference]: Start difference. First operand 18 states and 19 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-17 11:48:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:28,667 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-03-17 11:48:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:48:28,667 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-17 11:48:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:28,668 INFO L225 Difference]: With dead ends: 17 [2025-03-17 11:48:28,668 INFO L226 Difference]: Without dead ends: 17 [2025-03-17 11:48:28,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:28,669 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:28,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-17 11:48:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-17 11:48:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2025-03-17 11:48:28,672 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 3 [2025-03-17 11:48:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:28,672 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-03-17 11:48:28,672 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-17 11:48:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2025-03-17 11:48:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:28,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:28,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:28,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:48:28,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:28,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 59544, now seen corresponding path program 1 times [2025-03-17 11:48:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031984652] [2025-03-17 11:48:28,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:28,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:28,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:28,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:28,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:28,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:28,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031984652] [2025-03-17 11:48:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031984652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:28,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039201153] [2025-03-17 11:48:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:28,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:48:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:28,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:48:28,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:28,824 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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-17 11:48:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:28,833 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-03-17 11:48:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:48:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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-17 11:48:28,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:28,835 INFO L225 Difference]: With dead ends: 16 [2025-03-17 11:48:28,835 INFO L226 Difference]: Without dead ends: 16 [2025-03-17 11:48:28,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:28,836 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:28,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-17 11:48:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 11:48:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-03-17 11:48:28,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 3 [2025-03-17 11:48:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:28,840 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-03-17 11:48:28,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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-17 11:48:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-03-17 11:48:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:48:28,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:28,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:48:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:48:28,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash 57220531, now seen corresponding path program 1 times [2025-03-17 11:48:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399654824] [2025-03-17 11:48:28,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:28,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:48:28,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:48:28,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:28,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399654824] [2025-03-17 11:48:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399654824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:48:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911187034] [2025-03-17 11:48:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:28,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:48:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:28,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:48:28,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:28,915 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:28,947 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2025-03-17 11:48:28,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:48:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-17 11:48:28,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:28,948 INFO L225 Difference]: With dead ends: 15 [2025-03-17 11:48:28,948 INFO L226 Difference]: Without dead ends: 15 [2025-03-17 11:48:28,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:28,949 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:28,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-17 11:48:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-03-17 11:48:28,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-17 11:48:28,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2025-03-17 11:48:28,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:28,951 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-17 11:48:28,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-17 11:48:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:48:28,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:28,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:48:28,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:48:28,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash 57220532, now seen corresponding path program 1 times [2025-03-17 11:48:28,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:28,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334256666] [2025-03-17 11:48:28,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:28,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:48:28,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:48:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:29,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:29,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334256666] [2025-03-17 11:48:29,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334256666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:29,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:48:29,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655376963] [2025-03-17 11:48:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:29,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:48:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:29,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:48:29,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:48:29,149 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:29,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:29,186 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2025-03-17 11:48:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:48:29,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 5 [2025-03-17 11:48:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:29,186 INFO L225 Difference]: With dead ends: 20 [2025-03-17 11:48:29,187 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:48:29,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:48:29,187 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:29,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:48:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2025-03-17 11:48:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-17 11:48:29,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 5 [2025-03-17 11:48:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-17 11:48:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-17 11:48:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:48:29,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:29,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:29,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:48:29,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash -916035306, now seen corresponding path program 1 times [2025-03-17 11:48:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:29,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757672338] [2025-03-17 11:48:29,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:29,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:48:29,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:48:29,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:29,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:29,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757672338] [2025-03-17 11:48:29,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757672338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:29,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376663641] [2025-03-17 11:48:29,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:29,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:29,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:48:29,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:48:29,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:48:29,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:29,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:29,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 11:48:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:29,578 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 14 treesize of output 10 [2025-03-17 11:48:29,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:48:29,770 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 18 treesize of output 19 [2025-03-17 11:48:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:29,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:30,012 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 13 treesize of output 11 [2025-03-17 11:48:30,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-17 11:48:30,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:48:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376663641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:30,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:30,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2025-03-17 11:48:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647096414] [2025-03-17 11:48:30,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:48:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:30,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:48:30,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:48:30,039 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:30,325 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-03-17 11:48:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:48:30,326 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 11:48:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:30,327 INFO L225 Difference]: With dead ends: 26 [2025-03-17 11:48:30,327 INFO L226 Difference]: Without dead ends: 26 [2025-03-17 11:48:30,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:48:30,328 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:30,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:48:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-17 11:48:30,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2025-03-17 11:48:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-17 11:48:30,330 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2025-03-17 11:48:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:30,330 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-17 11:48:30,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-17 11:48:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 11:48:30,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:30,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:30,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:48:30,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 11:48:30,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:30,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash -916071098, now seen corresponding path program 1 times [2025-03-17 11:48:30,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:30,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095927899] [2025-03-17 11:48:30,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:30,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:30,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 11:48:30,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 11:48:30,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:30,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:30,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:30,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095927899] [2025-03-17 11:48:30,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095927899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:30,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:30,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:30,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751175175] [2025-03-17 11:48:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:30,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:48:30,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:30,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:48:30,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:30,597 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:30,607 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2025-03-17 11:48:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:48:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-03-17 11:48:30,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:30,607 INFO L225 Difference]: With dead ends: 17 [2025-03-17 11:48:30,607 INFO L226 Difference]: Without dead ends: 14 [2025-03-17 11:48:30,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:30,608 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:30,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-17 11:48:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-17 11:48:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-03-17 11:48:30,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 9 [2025-03-17 11:48:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-03-17 11:48:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-03-17 11:48:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:48:30,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:30,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:48:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:48:30,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:30,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:30,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1865102200, now seen corresponding path program 2 times [2025-03-17 11:48:30,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:30,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987461932] [2025-03-17 11:48:30,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:48:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:30,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 11:48:30,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:48:30,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:48:30,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:30,915 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-17 11:48:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987461932] [2025-03-17 11:48:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987461932] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132135200] [2025-03-17 11:48:30,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:48:30,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:30,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:30,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:30,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:48:30,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 11:48:30,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:48:30,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:48:30,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:30,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 11:48:30,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:30,983 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 14 treesize of output 10 [2025-03-17 11:48:35,211 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-03-17 11:48:35,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2025-03-17 11:48:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:35,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:35,510 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 21 treesize of output 17 [2025-03-17 11:48:35,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 11:48:35,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2025-03-17 11:48:35,568 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-17 11:48:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132135200] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:35,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-17 11:48:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003034983] [2025-03-17 11:48:35,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:48:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:35,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:48:35,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=400, Unknown=1, NotChecked=0, Total=462 [2025-03-17 11:48:35,570 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:40,738 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] [2025-03-17 11:48:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:41,595 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2025-03-17 11:48:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:48:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 11:48:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:41,596 INFO L225 Difference]: With dead ends: 29 [2025-03-17 11:48:41,596 INFO L226 Difference]: Without dead ends: 29 [2025-03-17 11:48:41,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=147, Invalid=842, Unknown=3, NotChecked=0, Total=992 [2025-03-17 11:48:41,597 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:41,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 58 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 11:48:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-17 11:48:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2025-03-17 11:48:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-03-17 11:48:41,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-03-17 11:48:41,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:41,599 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-03-17 11:48:41,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:41,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-03-17 11:48:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 11:48:41,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:41,600 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-17 11:48:41,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:48:41,800 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,SelfDestructingSolverStorable7 [2025-03-17 11:48:41,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-17 11:48:41,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -344224610, now seen corresponding path program 3 times [2025-03-17 11:48:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245449729] [2025-03-17 11:48:41,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:48:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:41,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-03-17 11:48:41,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:48:41,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:48:41,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245449729] [2025-03-17 11:48:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245449729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:48:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445651633] [2025-03-17 11:48:42,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:48:42,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:42,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:42,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:48:42,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:48:42,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 6 equivalence classes. [2025-03-17 11:48:42,310 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 11:48:42,310 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-17 11:48:42,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:42,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 11:48:42,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:48:42,331 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 14 treesize of output 10 [2025-03-17 11:48:42,929 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-03-17 11:48:42,929 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 26 treesize of output 39 [2025-03-17 11:48:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 11:48:43,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:48:44,136 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 66 treesize of output 56 [2025-03-17 11:48:44,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:48:44,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2025-03-17 11:48:44,242 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 15 treesize of output 11 [2025-03-17 11:48:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:48:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445651633] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:48:44,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:48:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 14] total 29 [2025-03-17 11:48:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530039576] [2025-03-17 11:48:44,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:48:44,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 11:48:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:44,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 11:48:44,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2025-03-17 11:48:44,359 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:44,797 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2025-03-17 11:48:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:48:44,797 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 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-17 11:48:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:44,797 INFO L225 Difference]: With dead ends: 25 [2025-03-17 11:48:44,797 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:48:44,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=338, Invalid=1384, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:48:44,798 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:44,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:48:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:48:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:48:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:48:44,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-03-17 11:48:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:44,799 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:48:44,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 30 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:48:44,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2025-03-17 11:48:44,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2025-03-17 11:48:44,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:48:45,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:48:45,007 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:45,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:48:45,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:48:45 BoogieIcfgContainer [2025-03-17 11:48:45,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:48:45,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:48:45,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:48:45,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:48:45,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:48:28" (3/4) ... [2025-03-17 11:48:45,021 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:48:45,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-17 11:48:45,033 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:48:45,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:48:45,034 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:48:45,082 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:48:45,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:48:45,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:48:45,083 INFO L158 Benchmark]: Toolchain (without parser) took 17345.47ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.5MB in the beginning and 150.3MB in the end (delta: -44.8MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2025-03-17 11:48:45,084 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:45,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.76ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:48:45,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.27ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 88.2MB in the end (delta: 998.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:45,084 INFO L158 Benchmark]: Boogie Preprocessor took 27.53ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 87.2MB in the end (delta: 997.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:45,085 INFO L158 Benchmark]: IcfgBuilder took 249.83ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 74.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:48:45,086 INFO L158 Benchmark]: TraceAbstraction took 16712.11ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.5MB in the beginning and 155.1MB in the end (delta: -81.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2025-03-17 11:48:45,086 INFO L158 Benchmark]: Witness Printer took 63.94ms. Allocated memory is still 285.2MB. Free memory was 155.1MB in the beginning and 150.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:48:45,089 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.76ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 89.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.27ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 88.2MB in the end (delta: 998.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.53ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 87.2MB in the end (delta: 997.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.83ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 74.5MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16712.11ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.5MB in the beginning and 155.1MB in the end (delta: -81.6MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * Witness Printer took 63.94ms. Allocated memory is still 285.2MB. Free memory was 155.1MB in the beginning and 150.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 514]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 23 edges, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 519 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 97 mSDtfsCounter, 519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 154 ConstructedInterpolants, 50 QuantifiedInterpolants, 3373 SizeOfPredicates, 17 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 36/156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:48:45,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE