./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:06:05,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:06:05,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:06:05,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:06:05,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:06:05,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:06:05,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:06:05,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:06:05,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:06:05,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:06:05,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:06:05,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:06:05,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:06:05,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:06:05,792 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:06:05,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:06:05,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:06:05,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:06:05,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:06:05,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:06:05,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:06:05,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:06:05,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2025-03-08 23:06:06,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:06:06,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:06:06,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:06:06,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:06:06,048 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:06:06,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2025-03-08 23:06:07,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e073ce333/c117a6c0f6a6486daa29e0ce3152498a/FLAGe79694b20 [2025-03-08 23:06:07,494 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:06:07,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2025-03-08 23:06:07,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e073ce333/c117a6c0f6a6486daa29e0ce3152498a/FLAGe79694b20 [2025-03-08 23:06:07,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e073ce333/c117a6c0f6a6486daa29e0ce3152498a [2025-03-08 23:06:07,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:06:07,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:06:07,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:06:07,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:06:07,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:06:07,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:06:07" (1/1) ... [2025-03-08 23:06:07,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729e3dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:07, skipping insertion in model container [2025-03-08 23:06:07,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:06:07" (1/1) ... [2025-03-08 23:06:07,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:06:08,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:06:08,017 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:06:08,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:06:08,074 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:06:08,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08 WrapperNode [2025-03-08 23:06:08,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:06:08,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:06:08,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:06:08,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:06:08,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,097 INFO L138 Inliner]: procedures = 124, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-03-08 23:06:08,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:06:08,097 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:06:08,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:06:08,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:06:08,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,113 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-08 23:06:08,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:06:08,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:06:08,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:06:08,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:06:08,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (1/1) ... [2025-03-08 23:06:08,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:06:08,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:08,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:06:08,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:06:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 23:06:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 23:06:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 23:06:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 23:06:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 23:06:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 23:06:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:06:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:06:08,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:06:08,255 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:06:08,270 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 23:06:08,419 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-08 23:06:08,419 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:06:08,429 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:06:08,430 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:06:08,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:08 BoogieIcfgContainer [2025-03-08 23:06:08,430 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:06:08,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:06:08,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:06:08,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:06:08,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:06:07" (1/3) ... [2025-03-08 23:06:08,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1636d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:06:08, skipping insertion in model container [2025-03-08 23:06:08,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:08" (2/3) ... [2025-03-08 23:06:08,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1636d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:06:08, skipping insertion in model container [2025-03-08 23:06:08,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:08" (3/3) ... [2025-03-08 23:06:08,440 INFO L128 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2025-03-08 23:06:08,450 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:06:08,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_flag-2.i that has 2 procedures, 61 locations, 1 initial locations, 3 loop locations, and 22 error locations. [2025-03-08 23:06:08,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:06:08,494 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;@59433e44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:06:08,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 23:06:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:06:08,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:08,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:06:08,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:08,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1308026363, now seen corresponding path program 1 times [2025-03-08 23:06:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:06:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828349543] [2025-03-08 23:06:08,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:08,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:06:08,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:06:08,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:06:08,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:08,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:06:08,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828349543] [2025-03-08 23:06:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828349543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:06:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66917211] [2025-03-08 23:06:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:06:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:06:08,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:06:08,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:06:08,629 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:08,640 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-08 23:06:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:06:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:08,644 INFO L225 Difference]: With dead ends: 59 [2025-03-08 23:06:08,645 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 23:06:08,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:06:08,647 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:08,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:06:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 23:06:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 23:06:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 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-08 23:06:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-03-08 23:06:08,675 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 6 [2025-03-08 23:06:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:08,675 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-03-08 23:06:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-03-08 23:06:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:06:08,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:08,677 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:06:08,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:08,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1894111827, now seen corresponding path program 1 times [2025-03-08 23:06:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:06:08,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229703023] [2025-03-08 23:06:08,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:08,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:06:08,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:06:08,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:06:08,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:06:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229703023] [2025-03-08 23:06:08,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229703023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:08,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:08,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:06:08,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027079852] [2025-03-08 23:06:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:06:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:06:08,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:06:08,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:06:08,785 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:08,879 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-08 23:06:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:06:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:06:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:08,881 INFO L225 Difference]: With dead ends: 56 [2025-03-08 23:06:08,881 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 23:06:08,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:06:08,882 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:06:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 23:06:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 23:06:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-08 23:06:08,886 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 7 [2025-03-08 23:06:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:08,886 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-08 23:06:08,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-08 23:06:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:06:08,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:08,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:08,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:06:08,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:08,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1894111826, now seen corresponding path program 1 times [2025-03-08 23:06:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:06:08,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327630319] [2025-03-08 23:06:08,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:08,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:06:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:06:08,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:06:08,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:08,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:08,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:06:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327630319] [2025-03-08 23:06:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327630319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:06:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989289486] [2025-03-08 23:06:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:08,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:06:08,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:06:08,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:06:08,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:06:08,995 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:09,091 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-08 23:06:09,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:06:09,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:06:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:09,092 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:06:09,092 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 23:06:09,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:06:09,094 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:09,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:06:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 23:06:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 23:06:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:09,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-03-08 23:06:09,101 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 7 [2025-03-08 23:06:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-03-08 23:06:09,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-03-08 23:06:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:06:09,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:09,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:09,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:06:09,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:09,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash -974084911, now seen corresponding path program 1 times [2025-03-08 23:06:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:06:09,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083532454] [2025-03-08 23:06:09,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:06:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:09,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:09,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:09,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:06:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083532454] [2025-03-08 23:06:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083532454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:06:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023454860] [2025-03-08 23:06:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:09,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:06:09,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:06:09,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:06:09,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:06:09,228 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-08 23:06:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:09,383 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-03-08 23:06:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 23:06:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Word has length 14 [2025-03-08 23:06:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:09,384 INFO L225 Difference]: With dead ends: 98 [2025-03-08 23:06:09,384 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 23:06:09,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 23:06:09,385 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:09,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 202 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:06:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 23:06:09,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 77. [2025-03-08 23:06:09,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 76 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2025-03-08 23:06:09,389 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 14 [2025-03-08 23:06:09,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:09,389 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2025-03-08 23:06:09,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-08 23:06:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2025-03-08 23:06:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:06:09,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:09,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:09,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:06:09,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -974059107, now seen corresponding path program 1 times [2025-03-08 23:06:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:06:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670976653] [2025-03-08 23:06:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:06:09,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:09,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:09,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 23:06:09,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 23:06:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:09,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:09,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:09,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 23:06:09,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 23:06:09,433 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 23:06:09,434 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2025-03-08 23:06:09,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (20 of 22 remaining) [2025-03-08 23:06:09,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2025-03-08 23:06:09,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2025-03-08 23:06:09,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2025-03-08 23:06:09,437 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2025-03-08 23:06:09,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2025-03-08 23:06:09,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2025-03-08 23:06:09,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2025-03-08 23:06:09,438 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2025-03-08 23:06:09,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2025-03-08 23:06:09,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2025-03-08 23:06:09,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2025-03-08 23:06:09,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2025-03-08 23:06:09,439 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2025-03-08 23:06:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:06:09,442 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 23:06:09,456 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:06:09,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:06:09 BoogieIcfgContainer [2025-03-08 23:06:09,459 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:06:09,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:06:09,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:06:09,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:06:09,460 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:08" (3/4) ... [2025-03-08 23:06:09,462 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 23:06:09,462 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:06:09,463 INFO L158 Benchmark]: Toolchain (without parser) took 1678.19ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 65.8MB in the end (delta: 46.5MB). Peak memory consumption was 47.8MB. Max. memory is 16.1GB. [2025-03-08 23:06:09,463 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:09,463 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.58ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 95.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 23:06:09,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.52ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:09,463 INFO L158 Benchmark]: Boogie Preprocessor took 25.09ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:09,464 INFO L158 Benchmark]: IcfgBuilder took 307.17ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 23:06:09,464 INFO L158 Benchmark]: TraceAbstraction took 1026.91ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 65.8MB in the end (delta: 9.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-03-08 23:06:09,464 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:09,465 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.93ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.58ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 95.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.52ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 93.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.09ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 307.17ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1026.91ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 65.8MB in the end (delta: 9.0MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 65.8MB in the end (delta: 27.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1] [L536] p = a VAL [a={-1:0}, flag=1, p={-1:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 [L549] p = a VAL [flag=1, p={-1:0}] [L550] COND TRUE \read(flag) [L551] EXPR p->h [L551] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) - UnprovableResult [Line: 12]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 75 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 178 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=4, InterpolantAutomatonStates: 20, 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, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1/1 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 could not prove your program: unable to determine feasibility of some traces [2025-03-08 23:06:09,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:06:11,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:06:11,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-08 23:06:11,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:06:11,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:06:11,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:06:11,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:06:11,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:06:11,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:06:11,430 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:06:11,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:06:11,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:06:11,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:06:11,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:06:11,431 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:06:11,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:06:11,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:06:11,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:06:11,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:06:11,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:06:11,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:06:11,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:06:11,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:06:11,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2025-03-08 23:06:11,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:06:11,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:06:11,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:06:11,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:06:11,693 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:06:11,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2025-03-08 23:06:12,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956eedacf/89f088d7eac444b692bc9b44050854a8/FLAG4daa32f1e [2025-03-08 23:06:13,060 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:06:13,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2025-03-08 23:06:13,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956eedacf/89f088d7eac444b692bc9b44050854a8/FLAG4daa32f1e [2025-03-08 23:06:13,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/956eedacf/89f088d7eac444b692bc9b44050854a8 [2025-03-08 23:06:13,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:06:13,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:06:13,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:06:13,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:06:13,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:06:13,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a98188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13, skipping insertion in model container [2025-03-08 23:06:13,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:06:13,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:06:13,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:06:13,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:06:13,343 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:06:13,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13 WrapperNode [2025-03-08 23:06:13,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:06:13,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:06:13,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:06:13,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:06:13,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,370 INFO L138 Inliner]: procedures = 127, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2025-03-08 23:06:13,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:06:13,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:06:13,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:06:13,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:06:13,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,386 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-03-08 23:06:13,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:06:13,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:06:13,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:06:13,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:06:13,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (1/1) ... [2025-03-08 23:06:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:06:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:13,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:06:13,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-08 23:06:13,456 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 23:06:13,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:06:13,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:06:13,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:06:13,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:06:13,571 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-08 23:06:13,794 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2025-03-08 23:06:13,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:06:13,801 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:06:13,802 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:06:13,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:13 BoogieIcfgContainer [2025-03-08 23:06:13,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:06:13,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:06:13,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:06:13,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:06:13,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:06:13" (1/3) ... [2025-03-08 23:06:13,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38273d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:06:13, skipping insertion in model container [2025-03-08 23:06:13,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:06:13" (2/3) ... [2025-03-08 23:06:13,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38273d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:06:13, skipping insertion in model container [2025-03-08 23:06:13,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:13" (3/3) ... [2025-03-08 23:06:13,811 INFO L128 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2025-03-08 23:06:13,821 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:06:13,822 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list_flag-2.i that has 2 procedures, 61 locations, 1 initial locations, 3 loop locations, and 22 error locations. [2025-03-08 23:06:13,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:06:13,860 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;@5f1cbf59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:06:13,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-08 23:06:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:06:13,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:13,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:06:13,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1308026363, now seen corresponding path program 1 times [2025-03-08 23:06:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:06:13,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644861933] [2025-03-08 23:06:13,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:13,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:13,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:13,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:06:13,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 23:06:13,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:06:13,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:06:13,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:13,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 23:06:13,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:06:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:13,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:06:13,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:06:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644861933] [2025-03-08 23:06:13,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644861933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:13,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:13,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:06:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706351617] [2025-03-08 23:06:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:13,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:06:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:06:14,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:06:14,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:06:14,006 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 58 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:14,017 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2025-03-08 23:06:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:06:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:14,022 INFO L225 Difference]: With dead ends: 59 [2025-03-08 23:06:14,023 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 23:06:14,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:06:14,026 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:14,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:06:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 23:06:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-08 23:06:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 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-08 23:06:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-03-08 23:06:14,053 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 6 [2025-03-08 23:06:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:14,053 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-03-08 23:06:14,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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-08 23:06:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-03-08 23:06:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:06:14,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:14,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:14,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 23:06:14,258 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 [2025-03-08 23:06:14,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:14,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:14,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1894111827, now seen corresponding path program 1 times [2025-03-08 23:06:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:06:14,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448613417] [2025-03-08 23:06:14,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:14,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:14,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:14,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:06:14,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 23:06:14,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:06:14,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:06:14,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:14,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:14,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 23:06:14,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:06:14,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-08 23:06:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:14,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:06:14,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:06:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448613417] [2025-03-08 23:06:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448613417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:06:14,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609517917] [2025-03-08 23:06:14,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:14,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:06:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:06:14,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:06:14,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:06:14,386 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:14,559 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-08 23:06:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:06:14,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:06:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:14,561 INFO L225 Difference]: With dead ends: 56 [2025-03-08 23:06:14,561 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 23:06:14,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:06:14,561 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:14,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 48 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:06:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 23:06:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 23:06:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-08 23:06:14,569 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 7 [2025-03-08 23:06:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-08 23:06:14,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-08 23:06:14,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 23:06:14,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:14,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:14,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 23:06:14,770 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 [2025-03-08 23:06:14,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:14,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1894111826, now seen corresponding path program 1 times [2025-03-08 23:06:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:06:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1630800935] [2025-03-08 23:06:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:14,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:06:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 23:06:14,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 23:06:14,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 23:06:14,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:14,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:14,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 23:06:14,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:06:14,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-08 23:06:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:14,875 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:06:14,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:06:14,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630800935] [2025-03-08 23:06:14,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630800935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:14,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:14,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:06:14,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903377266] [2025-03-08 23:06:14,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:14,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 23:06:14,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:06:14,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 23:06:14,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 23:06:14,876 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:15,008 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-08 23:06:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 23:06:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-08 23:06:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:15,010 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:06:15,010 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 23:06:15,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 23:06:15,010 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:15,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 65 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 23:06:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 23:06:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-08 23:06:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-03-08 23:06:15,014 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 7 [2025-03-08 23:06:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:15,014 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-03-08 23:06:15,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2025-03-08 23:06:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:06:15,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:15,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:15,021 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-08 23:06:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:15,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:15,216 INFO L85 PathProgramCache]: Analyzing trace with hash -974084911, now seen corresponding path program 1 times [2025-03-08 23:06:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:06:15,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098418420] [2025-03-08 23:06:15,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:15,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:06:15,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 23:06:15,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:15,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:15,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:15,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:06:15,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 23:06:15,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 23:06:15,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 23:06:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:06:15,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 23:06:15,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 23:06:15,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098418420] [2025-03-08 23:06:15,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098418420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:06:15,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:06:15,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 23:06:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814419949] [2025-03-08 23:06:15,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:06:15,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 23:06:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 23:06:15,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 23:06:15,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 23:06:15,335 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-08 23:06:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:06:15,506 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-03-08 23:06:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 23:06:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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) Word has length 14 [2025-03-08 23:06:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:06:15,507 INFO L225 Difference]: With dead ends: 73 [2025-03-08 23:06:15,508 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 23:06:15,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 23:06:15,508 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 23:06:15,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 158 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 23:06:15,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 23:06:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-08 23:06:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.5) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:06:15,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-03-08 23:06:15,524 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2025-03-08 23:06:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:06:15,524 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-03-08 23:06:15,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-08 23:06:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-03-08 23:06:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:06:15,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:06:15,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:06:15,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 23:06:15,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:15,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-03-08 23:06:15,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:06:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash -974059107, now seen corresponding path program 1 times [2025-03-08 23:06:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 23:06:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689432431] [2025-03-08 23:06:15,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:06:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:06:15,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 23:06:15,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 23:06:15,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:15,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:15,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:15,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 23:06:15,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 23:06:15,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:06:15,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:06:15,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:06:15,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 23:06:15,794 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-08 23:06:15,794 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 23:06:15,795 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2025-03-08 23:06:15,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (20 of 22 remaining) [2025-03-08 23:06:15,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 22 remaining) [2025-03-08 23:06:15,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2025-03-08 23:06:15,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2025-03-08 23:06:15,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2025-03-08 23:06:15,797 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2025-03-08 23:06:15,801 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2025-03-08 23:06:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2025-03-08 23:06:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2025-03-08 23:06:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2025-03-08 23:06:15,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2025-03-08 23:06:15,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 23:06:16,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 23:06:16,004 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 23:06:16,017 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:06:16,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:06:16 BoogieIcfgContainer [2025-03-08 23:06:16,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:06:16,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:06:16,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:06:16,020 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:06:16,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:06:13" (3/4) ... [2025-03-08 23:06:16,021 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 23:06:16,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:06:16,022 INFO L158 Benchmark]: Toolchain (without parser) took 2926.02ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 50.1MB in the end (delta: 9.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-03-08 23:06:16,022 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.78ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 41.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: Boogie Preprocessor took 33.77ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 37.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: IcfgBuilder took 397.67ms. Allocated memory is still 83.9MB. Free memory was 37.8MB in the beginning and 56.0MB in the end (delta: -18.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: TraceAbstraction took 2214.12ms. Allocated memory is still 83.9MB. Free memory was 55.4MB in the beginning and 50.7MB in the end (delta: 4.7MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-03-08 23:06:16,023 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 83.9MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 5.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:06:16,024 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.80ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.78ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 41.2MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.77ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 37.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 397.67ms. Allocated memory is still 83.9MB. Free memory was 37.8MB in the beginning and 56.0MB in the end (delta: -18.2MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2214.12ms. Allocated memory is still 83.9MB. Free memory was 55.4MB in the beginning and 50.7MB in the end (delta: 4.7MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 83.9MB. Free memory was 50.1MB in the beginning and 50.1MB in the end (delta: 5.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={3:0}] [L536] p = a VAL [a={3:0}, p={3:0}] [L537] COND TRUE __VERIFIER_nondet_int() [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 [L549] p = a VAL [p={3:0}] [L550] COND TRUE \read(flag) [L551] EXPR p->h [L551] COND FALSE !(p->h == 1) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) - UnprovableResult [Line: 12]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 75 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 164 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=4, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 138 SizeOfPredicates, 6 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1/1 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 could not prove your program: unable to determine feasibility of some traces [2025-03-08 23:06:16,037 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: UNKNOWN: Overapproximated counterexample