./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:22:36,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:22:36,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:22:36,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:22:36,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:22:36,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:22:36,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:22:36,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:22:36,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:22:36,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:22:36,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:22:36,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:22:36,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:22:36,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:22:36,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:22:36,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:22:36,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:22:36,344 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:22:36,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:22:36,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:22:36,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:22:36,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:22:36,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:22:36,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:22:36,348 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-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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2025-03-17 11:22:36,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:22:36,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:22:36,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:22:36,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:22:36,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:22:36,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2025-03-17 11:22:37,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5771fd2/5714f506ba1945a0974a219f0ce7bd62/FLAG30a98a746 [2025-03-17 11:22:38,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:22:38,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2025-03-17 11:22:38,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5771fd2/5714f506ba1945a0974a219f0ce7bd62/FLAG30a98a746 [2025-03-17 11:22:38,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc5771fd2/5714f506ba1945a0974a219f0ce7bd62 [2025-03-17 11:22:38,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:22:38,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:22:38,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:22:38,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:22:38,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:22:38,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a4544d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38, skipping insertion in model container [2025-03-17 11:22:38,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:22:38,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:22:38,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:22:38,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:22:38,351 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:22:38,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38 WrapperNode [2025-03-17 11:22:38,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:22:38,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:22:38,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:22:38,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:22:38,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,380 INFO L138 Inliner]: procedures = 119, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2025-03-17 11:22:38,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:22:38,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:22:38,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:22:38,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:22:38,389 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,400 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-03-17 11:22:38,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:22:38,414 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:22:38,414 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:22:38,414 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:22:38,415 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (1/1) ... [2025-03-17 11:22:38,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:22:38,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:22:38,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:22:38,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 11:22:38,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:22:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:22:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:22:38,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:22:38,543 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:22:38,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:22:38,722 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 11:22:38,722 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:22:38,732 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:22:38,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:22:38,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:22:38 BoogieIcfgContainer [2025-03-17 11:22:38,733 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:22:38,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:22:38,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:22:38,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:22:38,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:22:38" (1/3) ... [2025-03-17 11:22:38,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b98b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:38, skipping insertion in model container [2025-03-17 11:22:38,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:22:38" (2/3) ... [2025-03-17 11:22:38,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b98b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:22:38, skipping insertion in model container [2025-03-17 11:22:38,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:22:38" (3/3) ... [2025-03-17 11:22:38,743 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2025-03-17 11:22:38,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:22:38,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-token-1.i that has 2 procedures, 49 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-17 11:22:38,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:22:38,800 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;@15426223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:22:38,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:22:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:22:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 11:22:38,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:38,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:38,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash 827494011, now seen corresponding path program 1 times [2025-03-17 11:22:38,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612561706] [2025-03-17 11:22:38,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:38,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:38,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 11:22:38,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 11:22:38,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:38,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:38,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612561706] [2025-03-17 11:22:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612561706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:38,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:22:38,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094246981] [2025-03-17 11:22:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:39,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:22:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:39,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:22:39,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:39,020 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 41 states have internal predecessors, (66), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:39,078 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-17 11:22:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:22:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-03-17 11:22:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:39,084 INFO L225 Difference]: With dead ends: 40 [2025-03-17 11:22:39,085 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 11:22:39,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:22:39,091 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:39,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 11:22:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-17 11:22:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 36 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-03-17 11:22:39,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2025-03-17 11:22:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:39,116 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-03-17 11:22:39,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-03-17 11:22:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 11:22:39,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:39,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:39,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:22:39,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,119 INFO L85 PathProgramCache]: Analyzing trace with hash -151522226, now seen corresponding path program 1 times [2025-03-17 11:22:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906234911] [2025-03-17 11:22:39,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:39,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 11:22:39,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 11:22:39,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906234911] [2025-03-17 11:22:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906234911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:39,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:22:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274432791] [2025-03-17 11:22:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:22:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:39,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:22:39,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:22:39,231 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-03-17 11:22:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:39,301 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2025-03-17 11:22:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:22:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-03-17 11:22:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:39,302 INFO L225 Difference]: With dead ends: 56 [2025-03-17 11:22:39,302 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 11:22:39,302 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-17 11:22:39,303 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:39,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 61 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:22:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 11:22:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2025-03-17 11:22:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-17 11:22:39,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 8 [2025-03-17 11:22:39,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:39,309 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-17 11:22:39,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-03-17 11:22:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-17 11:22:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:22:39,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:39,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:22:39,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1453026531, now seen corresponding path program 1 times [2025-03-17 11:22:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-17 11:22:39,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:22:39,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:22:39,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:22:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:22:39,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:22:39,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-17 11:22:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314506553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:22:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:22:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:22:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526765919] [2025-03-17 11:22:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:22:39,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 11:22:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:22:39,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 11:22:39,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:22:39,620 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:22:39,699 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-17 11:22:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 11:22:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2025-03-17 11:22:39,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:22:39,700 INFO L225 Difference]: With dead ends: 49 [2025-03-17 11:22:39,700 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 11:22:39,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:22:39,700 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:22:39,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 117 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:22:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 11:22:39,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2025-03-17 11:22:39,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-17 11:22:39,707 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 13 [2025-03-17 11:22:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:22:39,707 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-17 11:22:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:22:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-17 11:22:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 11:22:39,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:22:39,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:22:39,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:22:39,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:22:39,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:22:39,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1473073952, now seen corresponding path program 1 times [2025-03-17 11:22:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:22:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029992708] [2025-03-17 11:22:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:22:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:22:39,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:22:39,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:22:39,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:22:39,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 11:22:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 11:22:39,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 11:22:39,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:22:39,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 11:22:39,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 11:22:39,755 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 11:22:39,755 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-17 11:22:39,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-17 11:22:39,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:22:39,759 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 11:22:39,773 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:22:39,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:22:39 BoogieIcfgContainer [2025-03-17 11:22:39,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:22:39,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:22:39,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:22:39,777 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:22:39,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:22:38" (3/4) ... [2025-03-17 11:22:39,778 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 11:22:39,803 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-17 11:22:39,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:22:39,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:22:39,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:22:39,841 INFO L158 Benchmark]: Toolchain (without parser) took 1760.74ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 71.2MB in the end (delta: 49.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-17 11:22:39,841 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:22:39,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.89ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 103.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:22:39,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.95ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 102.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:22:39,842 INFO L158 Benchmark]: Boogie Preprocessor took 27.39ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 100.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:22:39,842 INFO L158 Benchmark]: IcfgBuilder took 319.02ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 84.6MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:22:39,842 INFO L158 Benchmark]: TraceAbstraction took 1040.95ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 77.2MB in the end (delta: 6.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-17 11:22:39,842 INFO L158 Benchmark]: Witness Printer took 63.65ms. Allocated memory is still 167.8MB. Free memory was 77.2MB in the beginning and 71.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:22:39,843 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.13ms. Allocated memory is still 209.7MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.89ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 103.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.95ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 102.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.39ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 100.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 319.02ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 84.6MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1040.95ms. Allocated memory is still 167.8MB. Free memory was 84.0MB in the beginning and 77.2MB in the end (delta: 6.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 63.65ms. Allocated memory is still 167.8MB. Free memory was 77.2MB in the beginning and 71.2MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 992]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND TRUE __VERIFIER_nondet_int() [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1026] COND TRUE 1 != x->data [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] COND TRUE 0 [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "sll-token-1.c", 12, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1000]: 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, 49 locations, 84 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 106 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 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-03-17 11:22:39,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)