./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strcat.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/strcat.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 02cb0b7d003c65b862775c945403a999f88317049d254b45ea895999d5c859dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:48:19,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:48:19,159 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:19,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:48:19,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:48:19,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:48:19,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:48:19,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:48:19,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:48:19,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:48:19,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:48:19,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:48:19,184 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:48:19,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:48:19,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:48:19,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:48:19,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:48:19,187 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 -> 02cb0b7d003c65b862775c945403a999f88317049d254b45ea895999d5c859dc [2025-03-17 11:48:19,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:48:19,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:48:19,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:48:19,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:48:19,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:48:19,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcat.i [2025-03-17 11:48:20,527 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30228ea2e/24d6607404e446d79d280f18bbb48465/FLAG945f97535 [2025-03-17 11:48:20,792 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:48:20,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcat.i [2025-03-17 11:48:20,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30228ea2e/24d6607404e446d79d280f18bbb48465/FLAG945f97535 [2025-03-17 11:48:20,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30228ea2e/24d6607404e446d79d280f18bbb48465 [2025-03-17 11:48:20,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:48:20,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:48:20,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:48:20,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:48:20,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:48:20,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:48:20" (1/1) ... [2025-03-17 11:48:20,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f47ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:20, skipping insertion in model container [2025-03-17 11:48:20,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:48:20" (1/1) ... [2025-03-17 11:48:20,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:48:21,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:48:21,066 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:48:21,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:48:21,127 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:48:21,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:21 WrapperNode [2025-03-17 11:48:21,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:48:21,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:48:21,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:48:21,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:48:21,133 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:21" (1/1) ... [2025-03-17 11:48:21,140 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:21" (1/1) ... [2025-03-17 11:48:21,155 INFO L138 Inliner]: procedures = 114, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2025-03-17 11:48:21,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:48:21,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:48:21,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:48:21,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:48:21,162 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:21" (1/1) ... [2025-03-17 11:48:21,162 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:21" (1/1) ... [2025-03-17 11:48:21,164 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:21" (1/1) ... [2025-03-17 11:48:21,174 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 6 writes are split as follows [1, 5]. [2025-03-17 11:48:21,174 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:21" (1/1) ... [2025-03-17 11:48:21,174 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:21" (1/1) ... [2025-03-17 11:48:21,179 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:21" (1/1) ... [2025-03-17 11:48:21,179 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:21" (1/1) ... [2025-03-17 11:48:21,180 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:21" (1/1) ... [2025-03-17 11:48:21,181 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:21" (1/1) ... [2025-03-17 11:48:21,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:48:21,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:48:21,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:48:21,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:48:21,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:21" (1/1) ... [2025-03-17 11:48:21,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:48:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:48:21,210 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:21,211 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:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:48:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:48:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:48:21,297 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:48:21,299 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:48:21,535 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: havoc main_#t~ret23#1.base, main_#t~ret23#1.offset;call ULTIMATE.dealloc(main_#t~malloc19#1.base, main_#t~malloc19#1.offset);havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;call ULTIMATE.dealloc(main_#t~malloc22#1.base, main_#t~malloc22#1.offset);havoc main_#t~malloc22#1.base, main_#t~malloc22#1.offset; [2025-03-17 11:48:21,547 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-03-17 11:48:21,548 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:48:21,557 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:48:21,558 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:48:21,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:48:21 BoogieIcfgContainer [2025-03-17 11:48:21,558 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:48:21,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:48:21,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:48:21,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:48:21,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:48:20" (1/3) ... [2025-03-17 11:48:21,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73149fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:48:21, skipping insertion in model container [2025-03-17 11:48:21,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:48:21" (2/3) ... [2025-03-17 11:48:21,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73149fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:48:21, skipping insertion in model container [2025-03-17 11:48:21,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:48:21" (3/3) ... [2025-03-17 11:48:21,564 INFO L128 eAbstractionObserver]: Analyzing ICFG strcat.i [2025-03-17 11:48:21,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:48:21,576 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG strcat.i that has 1 procedures, 52 locations, 1 initial locations, 2 loop locations, and 23 error locations. [2025-03-17 11:48:21,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:48:21,617 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;@84139b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:48:21,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-17 11:48:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 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:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:21,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:21,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:21,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:21,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash 114019, now seen corresponding path program 1 times [2025-03-17 11:48:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:21,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272783061] [2025-03-17 11:48:21,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:21,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:21,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:21,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:21,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:21,736 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:21,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:21,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272783061] [2025-03-17 11:48:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272783061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:48:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087386728] [2025-03-17 11:48:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:21,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:48:21,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:21,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:48:21,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:21,762 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 51 states have internal predecessors, (62), 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:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:21,814 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2025-03-17 11:48:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:48:21,816 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:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:21,821 INFO L225 Difference]: With dead ends: 53 [2025-03-17 11:48:21,821 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 11:48:21,822 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:21,827 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:21,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 11:48:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 11:48:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 2.111111111111111) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-03-17 11:48:21,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 3 [2025-03-17 11:48:21,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:21,856 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-03-17 11:48:21,856 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:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-03-17 11:48:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:21,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:21,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:48:21,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 114158, now seen corresponding path program 1 times [2025-03-17 11:48:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530923331] [2025-03-17 11:48:21,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:21,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:21,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:21,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:21,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:21,946 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:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530923331] [2025-03-17 11:48:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530923331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:21,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634057948] [2025-03-17 11:48:21,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:48:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:21,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:48:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:21,948 INFO L87 Difference]: Start difference. First operand 50 states and 57 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:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:21,993 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-17 11:48:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:48:21,994 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:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:21,994 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:48:21,994 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:48:21,994 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:21,995 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:21,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:48:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 11:48:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 2.074074074074074) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-17 11:48:21,998 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 3 [2025-03-17 11:48:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:21,998 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-17 11:48:21,999 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:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-17 11:48:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:48:21,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:21,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:48:21,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:48:21,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:22,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash 114159, now seen corresponding path program 1 times [2025-03-17 11:48:22,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:22,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894489671] [2025-03-17 11:48:22,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:22,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:22,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:48:22,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:48:22,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:22,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:22,138 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:22,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:22,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894489671] [2025-03-17 11:48:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894489671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:22,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:22,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525489772] [2025-03-17 11:48:22,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:22,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:48:22,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:22,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:48:22,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:22,140 INFO L87 Difference]: Start difference. First operand 49 states and 56 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:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:22,194 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2025-03-17 11:48:22,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:48:22,197 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:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:22,197 INFO L225 Difference]: With dead ends: 50 [2025-03-17 11:48:22,197 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 11:48:22,198 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:22,198 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:22,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 11:48:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2025-03-17 11:48:22,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 2.037037037037037) internal successors, (55), 47 states have internal predecessors, (55), 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:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-03-17 11:48:22,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 3 [2025-03-17 11:48:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:22,201 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-03-17 11:48:22,201 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:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-03-17 11:48:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:48:22,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:22,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:48:22,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:48:22,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:22,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -894040809, now seen corresponding path program 1 times [2025-03-17 11:48:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564284004] [2025-03-17 11:48:22,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:48:22,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:48:22,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:22,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:22,288 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:22,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:22,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564284004] [2025-03-17 11:48:22,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564284004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045465563] [2025-03-17 11:48:22,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:48:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:22,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:48:22,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:48:22,289 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:22,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:22,353 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-17 11:48:22,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:48:22,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:48:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:22,354 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:48:22,354 INFO L226 Difference]: Without dead ends: 48 [2025-03-17 11:48:22,354 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:22,355 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:22,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:48:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-17 11:48:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-17 11:48:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.962962962962963) internal successors, (53), 47 states have internal predecessors, (53), 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:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-03-17 11:48:22,369 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 6 [2025-03-17 11:48:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-03-17 11:48:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-03-17 11:48:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:48:22,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:22,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:22,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:48:22,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:22,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1945457178, now seen corresponding path program 1 times [2025-03-17 11:48:22,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913480296] [2025-03-17 11:48:22,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:22,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:22,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:48:22,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:48:22,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:22,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:48:22,416 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:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:48:22,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913480296] [2025-03-17 11:48:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913480296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:48:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:48:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:48:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018330197] [2025-03-17 11:48:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:48:22,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:48:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:48:22,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:48:22,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:48:22,417 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:48:22,453 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-03-17 11:48:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:48:22,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 11:48:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:48:22,455 INFO L225 Difference]: With dead ends: 47 [2025-03-17 11:48:22,455 INFO L226 Difference]: Without dead ends: 47 [2025-03-17 11:48:22,456 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:22,456 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:48:22,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:48:22,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-17 11:48:22,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-17 11:48:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 46 states have internal predecessors, (52), 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:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-03-17 11:48:22,462 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2025-03-17 11:48:22,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:48:22,462 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-03-17 11:48:22,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:48:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-03-17 11:48:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:48:22,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:48:22,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:48:22,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:48:22,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2025-03-17 11:48:22,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:48:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1945457177, now seen corresponding path program 1 times [2025-03-17 11:48:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:48:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988109548] [2025-03-17 11:48:22,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:48:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:48:22,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:48:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:48:22,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:22,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:48:22,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:48:22,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:48:22,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:48:22,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:48:22,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:48:22,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:48:22,512 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:48:22,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 23 remaining) [2025-03-17 11:48:22,515 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 23 remaining) [2025-03-17 11:48:22,517 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 23 remaining) [2025-03-17 11:48:22,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 23 remaining) [2025-03-17 11:48:22,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:48:22,521 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 11:48:22,535 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:48:22,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:48:22 BoogieIcfgContainer [2025-03-17 11:48:22,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:48:22,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:48:22,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:48:22,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:48:22,539 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:21" (3/4) ... [2025-03-17 11:48:22,539 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:48:22,572 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-03-17 11:48:22,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:48:22,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:48:22,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:48:22,608 INFO L158 Benchmark]: Toolchain (without parser) took 1794.82ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 100.1MB in the end (delta: 22.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-03-17 11:48:22,609 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:22,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.55ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:48:22,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.66ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:22,610 INFO L158 Benchmark]: Boogie Preprocessor took 25.82ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:22,610 INFO L158 Benchmark]: IcfgBuilder took 375.53ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 82.8MB in the end (delta: 19.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 11:48:22,610 INFO L158 Benchmark]: TraceAbstraction took 978.11ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 105.8MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:48:22,611 INFO L158 Benchmark]: Witness Printer took 69.29ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 100.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:48:22,612 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.14ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.55ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 105.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.66ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 103.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.82ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 101.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 375.53ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 82.8MB in the end (delta: 19.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 978.11ms. Allocated memory is still 167.8MB. Free memory was 81.9MB in the beginning and 105.8MB in the end (delta: -23.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.29ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 100.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L525] int in_len = __VERIFIER_nondet_int(); [L526] COND FALSE !(in_len < 1) [L527] char* in = __builtin_alloca (in_len); VAL [in={4:0}, in_len=7] [L528] in[in_len-1]=0 [L529] int out_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(out_len < 1) [L531] int out_end = __VERIFIER_nondet_int(); [L532] COND FALSE !(out_len < out_end+in_len) [L533] char* out = __builtin_alloca (out_len); VAL [in={4:0}, out={3:0}, out_end=-2] [L534] out[out_end]=0 - UnprovableResult [Line: 524]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 62 edges, 23 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 178 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 256 mSDtfsCounter, 178 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 11:48:22,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)