./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:48:55,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:48:55,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:48:55,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:48:55,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:48:55,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:48:55,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:48:55,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:48:55,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:48:55,745 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:48:55,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:48:55,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:48:55,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:48:55,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:48:55,746 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:48:55,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:48:55,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:48:55,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:48:55,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:48:55,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:55,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:48:55,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:48:55,748 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-jdk21/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-memcleanup) ) 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2025-02-08 05:48:55,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:48:55,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:48:55,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:48:55,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:48:55,953 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:48:55,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-2.i [2025-02-08 05:48:57,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81f694085/ab26efb9c8004e8a8dcedd0a700a6006/FLAG977005b09 [2025-02-08 05:48:57,453 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:48:57,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i [2025-02-08 05:48:57,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81f694085/ab26efb9c8004e8a8dcedd0a700a6006/FLAG977005b09 [2025-02-08 05:48:57,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81f694085/ab26efb9c8004e8a8dcedd0a700a6006 [2025-02-08 05:48:57,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:48:57,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:48:57,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:57,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:48:57,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:48:57,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@220d7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57, skipping insertion in model container [2025-02-08 05:48:57,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:48:57,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:57,756 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:48:57,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:57,798 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:48:57,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57 WrapperNode [2025-02-08 05:48:57,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:57,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:57,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:48:57,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:48:57,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,841 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2025-02-08 05:48:57,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:57,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:48:57,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:48:57,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:48:57,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,858 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,868 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-08 05:48:57,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:48:57,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:48:57,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:48:57,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:48:57,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (1/1) ... [2025-02-08 05:48:57,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:57,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:48:57,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:48:57,923 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 05:48:57,924 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:48:57,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:48:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:48:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:48:57,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:48:57,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:48:57,993 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:48:57,994 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:48:58,165 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-08 05:48:58,165 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:48:58,171 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:48:58,171 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:48:58,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:58 BoogieIcfgContainer [2025-02-08 05:48:58,172 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:48:58,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:48:58,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:48:58,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:48:58,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:48:57" (1/3) ... [2025-02-08 05:48:58,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11524830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:58, skipping insertion in model container [2025-02-08 05:48:58,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:57" (2/3) ... [2025-02-08 05:48:58,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11524830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:58, skipping insertion in model container [2025-02-08 05:48:58,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:58" (3/3) ... [2025-02-08 05:48:58,181 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2025-02-08 05:48:58,191 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:48:58,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-circular-2.i that has 2 procedures, 40 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-02-08 05:48:58,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:48:58,234 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;@3afd6cc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:48:58,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:48:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:48:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 05:48:58,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1627289146, now seen corresponding path program 1 times [2025-02-08 05:48:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084869577] [2025-02-08 05:48:58,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 05:48:58,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 05:48:58,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:58,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084869577] [2025-02-08 05:48:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084869577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:58,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087811852] [2025-02-08 05:48:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:58,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:48:58,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:58,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:48:58,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:48:58,415 INFO L87 Difference]: Start difference. First operand has 40 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 35 states have internal predecessors, (55), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:58,424 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-02-08 05:48:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:48:58,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 05:48:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:58,429 INFO L225 Difference]: With dead ends: 35 [2025-02-08 05:48:58,429 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 05:48:58,431 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-02-08 05:48:58,433 INFO L435 NwaCegarLoop]: 43 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, 43 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-02-08 05:48:58,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 05:48:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 05:48:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-08 05:48:58,458 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 8 [2025-02-08 05:48:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:58,459 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-08 05:48:58,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-02-08 05:48:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 05:48:58,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:48:58,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 311980307, now seen corresponding path program 1 times [2025-02-08 05:48:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595252918] [2025-02-08 05:48:58,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 05:48:58,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 05:48:58,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:58,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:58,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595252918] [2025-02-08 05:48:58,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595252918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:58,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:48:58,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298112032] [2025-02-08 05:48:58,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:58,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:48:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:58,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:48:58,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:48:58,723 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:58,787 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2025-02-08 05:48:58,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:48:58,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 05:48:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:58,788 INFO L225 Difference]: With dead ends: 47 [2025-02-08 05:48:58,788 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 05:48:58,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:48:58,788 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:48:58,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 68 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:48:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 05:48:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2025-02-08 05:48:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.303030303030303) internal successors, (43), 35 states have internal predecessors, (43), 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-02-08 05:48:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2025-02-08 05:48:58,795 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 9 [2025-02-08 05:48:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2025-02-08 05:48:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2025-02-08 05:48:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 05:48:58,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:48:58,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1139696307, now seen corresponding path program 1 times [2025-02-08 05:48:58,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499375034] [2025-02-08 05:48:58,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 05:48:58,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 05:48:58,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499375034] [2025-02-08 05:48:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499375034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220059177] [2025-02-08 05:48:58,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:48:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:58,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:48:58,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:48:58,854 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:58,866 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2025-02-08 05:48:58,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:48:58,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 05:48:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:58,867 INFO L225 Difference]: With dead ends: 46 [2025-02-08 05:48:58,867 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 05:48:58,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:48:58,868 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:48:58,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 05:48:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-02-08 05:48:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 43 states have internal predecessors, (53), 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-02-08 05:48:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2025-02-08 05:48:58,872 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 12 [2025-02-08 05:48:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:58,872 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2025-02-08 05:48:58,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2025-02-08 05:48:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 05:48:58,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:58,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:58,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:48:58,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:58,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1627735945, now seen corresponding path program 1 times [2025-02-08 05:48:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:58,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922718776] [2025-02-08 05:48:58,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:58,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 05:48:58,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 05:48:58,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:48:58,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:48:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 05:48:58,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 05:48:58,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:58,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:48:58,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:48:58,922 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:48:58,922 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 05:48:58,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 05:48:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:48:58,926 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:48:58,942 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:48:58,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:48:58 BoogieIcfgContainer [2025-02-08 05:48:58,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:48:58,947 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:48:58,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:48:58,948 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:48:58,948 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:58" (3/4) ... [2025-02-08 05:48:58,949 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:48:58,981 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-02-08 05:48:59,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:48:59,017 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:48:59,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:48:59,018 INFO L158 Benchmark]: Toolchain (without parser) took 1522.34ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 53.7MB in the end (delta: 102.8MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2025-02-08 05:48:59,018 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 218.1MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:48:59,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.44ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 139.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:48:59,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.70ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 137.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:48:59,018 INFO L158 Benchmark]: Boogie Preprocessor took 35.01ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 135.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:48:59,019 INFO L158 Benchmark]: IcfgBuilder took 294.95ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 120.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:48:59,019 INFO L158 Benchmark]: TraceAbstraction took 773.38ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 59.4MB in the end (delta: 60.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-08 05:48:59,019 INFO L158 Benchmark]: Witness Printer took 69.94ms. Allocated memory is still 201.3MB. Free memory was 59.4MB in the beginning and 53.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:48:59,021 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.19ms. Allocated memory is still 218.1MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.44ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 139.2MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.70ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 137.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.01ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 135.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.95ms. Allocated memory is still 201.3MB. Free memory was 135.7MB in the beginning and 120.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 773.38ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 59.4MB in the end (delta: 60.6MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 69.94ms. Allocated memory is still 201.3MB. Free memory was 59.4MB in the beginning and 53.7MB in the end (delta: 5.6MB). 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 - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND TRUE __VERIFIER_nondet_int() [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state [L1027] EXPR head->next [L1027] x = head->next [L1028] COND TRUE 0 VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1028] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1030] COND TRUE x->data != 0 [L1030] EXPR x->data [L1030] COND TRUE x->data != 0 [L1032] COND TRUE 0 [L1032] EXPR x->next [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, x={-1:0}] [L1032] EXPR x->next->data != 0 && x->data > x->next->data [L1032] EXPR x->data [L1032] EXPR x->next [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, x={-1:0}] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] CALL reach_error() [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-circular-2.c", 14, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 179 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 109 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:48:59,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)