./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 551b0097 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/list-ext3-properties/dll_nullified-1.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 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:43:25,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:43:25,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-01-09 21:43:25,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:43:25,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:43:25,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:43:25,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:43:25,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:43:25,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:43:25,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:43:25,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:43:25,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:43:25,876 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:43:25,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:25,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:25,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:25,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:43:25,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:43:25,878 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 -> 7887c90df48e0e32a16c0ae4217eb11a41b3b1af1e02493e847dc25239198c19 [2025-01-09 21:43:26,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:43:26,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:43:26,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:43:26,095 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:43:26,095 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:43:26,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2025-01-09 21:43:27,227 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1bc3fee3/4d097f7b931c47bca45325d187b0c688/FLAGf40b7685b [2025-01-09 21:43:27,529 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:43:27,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2025-01-09 21:43:27,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1bc3fee3/4d097f7b931c47bca45325d187b0c688/FLAGf40b7685b [2025-01-09 21:43:27,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1bc3fee3/4d097f7b931c47bca45325d187b0c688 [2025-01-09 21:43:27,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:43:27,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:43:27,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:27,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:43:27,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:43:27,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:27" (1/1) ... [2025-01-09 21:43:27,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aec7605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:27, skipping insertion in model container [2025-01-09 21:43:27,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:27" (1/1) ... [2025-01-09 21:43:27,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:43:28,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:28,044 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:43:28,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:28,100 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:43:28,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28 WrapperNode [2025-01-09 21:43:28,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:28,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:28,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:43:28,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:43:28,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,138 INFO L138 Inliner]: procedures = 123, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 107 [2025-01-09 21:43:28,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:28,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:43:28,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:43:28,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:43:28,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,161 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 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-01-09 21:43:28,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:43:28,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:43:28,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:43:28,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:43:28,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (1/1) ... [2025-01-09 21:43:28,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:28,227 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-01-09 21:43:28,232 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-01-09 21:43:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:43:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:43:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:43:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:43:28,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:43:28,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:43:28,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:43:28,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:43:28,344 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:43:28,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:43:28,531 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 21:43:28,531 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:43:28,540 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:43:28,540 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 21:43:28,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:28 BoogieIcfgContainer [2025-01-09 21:43:28,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:43:28,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:43:28,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:43:28,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:43:28,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:27" (1/3) ... [2025-01-09 21:43:28,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166c0160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:28, skipping insertion in model container [2025-01-09 21:43:28,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:28" (2/3) ... [2025-01-09 21:43:28,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166c0160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:28, skipping insertion in model container [2025-01-09 21:43:28,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:28" (3/3) ... [2025-01-09 21:43:28,549 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2025-01-09 21:43:28,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:43:28,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_nullified-1.i that has 1 procedures, 30 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-01-09 21:43:28,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:43:28,592 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;@f97732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:43:28,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:43:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 21:43:28,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:28,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:28,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1822110784, now seen corresponding path program 1 times [2025-01-09 21:43:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:28,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820712159] [2025-01-09 21:43:28,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:28,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 21:43:28,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 21:43:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:28,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:28,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:28,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820712159] [2025-01-09 21:43:28,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820712159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:28,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:43:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283347493] [2025-01-09 21:43:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:28,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 21:43:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 21:43:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 21:43:28,742 INFO L87 Difference]: Start difference. First operand has 30 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 29 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:28,748 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-01-09 21:43:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 21:43:28,749 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 21:43:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:28,753 INFO L225 Difference]: With dead ends: 29 [2025-01-09 21:43:28,753 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 21:43:28,754 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-01-09 21:43:28,756 INFO L435 NwaCegarLoop]: 38 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, 38 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-01-09 21:43:28,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 21:43:28,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-09 21:43:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-01-09 21:43:28,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 7 [2025-01-09 21:43:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:28,774 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-01-09 21:43:28,775 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-01-09 21:43:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 21:43:28,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:28,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:43:28,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:28,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:28,776 INFO L85 PathProgramCache]: Analyzing trace with hash 650010583, now seen corresponding path program 1 times [2025-01-09 21:43:28,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:28,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747846290] [2025-01-09 21:43:28,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:28,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 21:43:28,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 21:43:28,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:28,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747846290] [2025-01-09 21:43:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747846290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:28,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:28,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:43:28,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570830590] [2025-01-09 21:43:28,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:28,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:28,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:28,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:28,836 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:28,851 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-01-09 21:43:28,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:28,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-09 21:43:28,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:28,852 INFO L225 Difference]: With dead ends: 45 [2025-01-09 21:43:28,852 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 21:43:28,852 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-01-09 21:43:28,852 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:28,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 21:43:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-01-09 21:43:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-01-09 21:43:28,859 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 8 [2025-01-09 21:43:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:28,860 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-01-09 21:43:28,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-01-09 21:43:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 21:43:28,861 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:28,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:28,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:43:28,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1666250205, now seen corresponding path program 1 times [2025-01-09 21:43:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276320804] [2025-01-09 21:43:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:28,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 21:43:28,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 21:43:28,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:28,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:28,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276320804] [2025-01-09 21:43:28,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276320804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:28,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:28,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852809390] [2025-01-09 21:43:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:28,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:28,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:28,963 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:28,993 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2025-01-09 21:43:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:28,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 21:43:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:28,993 INFO L225 Difference]: With dead ends: 39 [2025-01-09 21:43:28,994 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 21:43:28,994 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-01-09 21:43:28,994 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 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-01-09 21:43:28,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 21:43:28,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 21:43:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2025-01-09 21:43:28,997 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 13 [2025-01-09 21:43:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:28,997 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2025-01-09 21:43:28,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2025-01-09 21:43:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 21:43:28,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:28,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:28,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:43:28,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:28,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 856903579, now seen corresponding path program 1 times [2025-01-09 21:43:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:28,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388670713] [2025-01-09 21:43:28,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:29,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 21:43:29,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 21:43:29,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:29,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388670713] [2025-01-09 21:43:29,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388670713] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784812544] [2025-01-09 21:43:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:29,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:29,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:29,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:29,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:43:29,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 21:43:29,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 21:43:29,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:29,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:29,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 21:43:29,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:29,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:43:29,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784812544] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:29,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:29,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 21:43:29,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805022590] [2025-01-09 21:43:29,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:29,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:29,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:29,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:29,261 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:29,332 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-01-09 21:43:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:43:29,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 21:43:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:29,333 INFO L225 Difference]: With dead ends: 42 [2025-01-09 21:43:29,333 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 21:43:29,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:29,334 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:29,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 21:43:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 21:43:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-01-09 21:43:29,339 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 13 [2025-01-09 21:43:29,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:29,339 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-01-09 21:43:29,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-01-09 21:43:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 21:43:29,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:29,340 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:29,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:43:29,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:29,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:29,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash 38898137, now seen corresponding path program 1 times [2025-01-09 21:43:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:29,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036018302] [2025-01-09 21:43:29,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:29,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 21:43:29,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 21:43:29,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:29,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:29,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:29,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036018302] [2025-01-09 21:43:29,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036018302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:29,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:29,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:43:29,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886793876] [2025-01-09 21:43:29,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:29,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:43:29,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:29,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:43:29,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:43:29,771 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:29,898 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2025-01-09 21:43:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:43:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 21:43:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:29,899 INFO L225 Difference]: With dead ends: 58 [2025-01-09 21:43:29,899 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 21:43:29,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:29,900 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:29,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 21:43:29,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2025-01-09 21:43:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-09 21:43:29,902 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 28 [2025-01-09 21:43:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:29,903 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-09 21:43:29,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-09 21:43:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 21:43:29,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:29,903 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:29,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:43:29,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:29,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1265333529, now seen corresponding path program 1 times [2025-01-09 21:43:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:29,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923097054] [2025-01-09 21:43:29,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:29,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:29,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:43:29,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:43:29,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:29,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 21:43:29,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923097054] [2025-01-09 21:43:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923097054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:29,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:29,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789362183] [2025-01-09 21:43:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:29,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:43:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:29,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:43:29,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:43:29,977 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:29,986 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-09 21:43:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:43:29,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 21:43:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:29,989 INFO L225 Difference]: With dead ends: 46 [2025-01-09 21:43:29,989 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 21:43:29,989 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-01-09 21:43:29,989 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:29,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 21:43:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 21:43:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2025-01-09 21:43:29,996 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 33 [2025-01-09 21:43:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:29,996 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2025-01-09 21:43:29,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2025-01-09 21:43:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 21:43:29,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:29,996 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:29,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:43:29,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1265273947, now seen corresponding path program 1 times [2025-01-09 21:43:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307891796] [2025-01-09 21:43:29,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:30,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:43:30,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:43:30,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:30,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:43:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307891796] [2025-01-09 21:43:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307891796] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:30,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146941270] [2025-01-09 21:43:30,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:30,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:30,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:30,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:30,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:43:30,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:43:30,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:43:30,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:30,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:30,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:43:30,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:43:30,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:43:30,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146941270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:30,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:30,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-01-09 21:43:30,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454538049] [2025-01-09 21:43:30,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:30,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:30,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:30,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:30,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:30,488 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:30,577 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-01-09 21:43:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:43:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-01-09 21:43:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:30,578 INFO L225 Difference]: With dead ends: 51 [2025-01-09 21:43:30,578 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 21:43:30,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:30,582 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:30,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 21:43:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 21:43:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-01-09 21:43:30,584 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 33 [2025-01-09 21:43:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-01-09 21:43:30,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-01-09 21:43:30,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 21:43:30,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:30,588 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:30,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:43:30,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:30,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash -602080861, now seen corresponding path program 2 times [2025-01-09 21:43:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:30,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192174342] [2025-01-09 21:43:30,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:43:30,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:30,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 21:43:30,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:43:30,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:43:30,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 21:43:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192174342] [2025-01-09 21:43:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192174342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688309520] [2025-01-09 21:43:31,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:43:31,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:31,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:31,584 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:31,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:43:31,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-01-09 21:43:31,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:43:31,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:43:31,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:31,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 21:43:31,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:31,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:43:31,849 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:43:31,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:43:31,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-01-09 21:43:31,920 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 21:43:31,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2025-01-09 21:43:32,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-01-09 21:43:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 21:43:32,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:32,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:43:32,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2025-01-09 21:43:32,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-01-09 21:43:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 21:43:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688309520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:32,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-01-09 21:43:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869643973] [2025-01-09 21:43:32,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 21:43:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:32,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 21:43:32,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-01-09 21:43:32,323 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:33,067 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2025-01-09 21:43:33,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 21:43:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-09 21:43:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:33,068 INFO L225 Difference]: With dead ends: 59 [2025-01-09 21:43:33,068 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 21:43:33,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 21:43:33,069 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:33,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 371 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:43:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 21:43:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2025-01-09 21:43:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.1875) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-01-09 21:43:33,078 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2025-01-09 21:43:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:33,078 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-01-09 21:43:33,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-01-09 21:43:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 21:43:33,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:33,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:33,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:43:33,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:33,280 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash 942200243, now seen corresponding path program 1 times [2025-01-09 21:43:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709700714] [2025-01-09 21:43:33,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:33,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:43:33,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:43:33,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:33,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 21:43:33,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:33,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709700714] [2025-01-09 21:43:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709700714] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:43:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248663949] [2025-01-09 21:43:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:33,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:43:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:33,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:43:33,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:43:33,412 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:33,423 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-01-09 21:43:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:43:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 21:43:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:33,424 INFO L225 Difference]: With dead ends: 53 [2025-01-09 21:43:33,424 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 21:43:33,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:43:33,425 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 21:43:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 21:43:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2025-01-09 21:43:33,427 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 39 [2025-01-09 21:43:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:33,427 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2025-01-09 21:43:33,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2025-01-09 21:43:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 21:43:33,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:33,428 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:33,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:43:33,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:33,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 940353201, now seen corresponding path program 1 times [2025-01-09 21:43:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643122053] [2025-01-09 21:43:33,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:33,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:43:33,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:43:33,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:33,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643122053] [2025-01-09 21:43:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643122053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930077329] [2025-01-09 21:43:33,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:33,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:33,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:33,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:43:33,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:43:33,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:43:34,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:43:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:34,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:34,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 21:43:34,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:34,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:43:34,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:43:34,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:43:34,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-01-09 21:43:34,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-01-09 21:43:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:34,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:34,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2025-01-09 21:43:34,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 21:43:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930077329] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:34,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:34,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2025-01-09 21:43:34,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325575897] [2025-01-09 21:43:34,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 21:43:34,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:34,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 21:43:34,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=282, Unknown=11, NotChecked=0, Total=342 [2025-01-09 21:43:34,793 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:35,049 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-01-09 21:43:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:43:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-01-09 21:43:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:35,050 INFO L225 Difference]: With dead ends: 63 [2025-01-09 21:43:35,051 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 21:43:35,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=448, Unknown=11, NotChecked=0, Total=552 [2025-01-09 21:43:35,052 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:35,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 192 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:43:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 21:43:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2025-01-09 21:43:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2025-01-09 21:43:35,054 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 39 [2025-01-09 21:43:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2025-01-09 21:43:35,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:43:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2025-01-09 21:43:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 21:43:35,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:35,057 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:35,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:43:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 21:43:35,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:35,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1577759691, now seen corresponding path program 1 times [2025-01-09 21:43:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886301820] [2025-01-09 21:43:35,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:35,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:43:35,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:43:35,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:35,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:35,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:43:35,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:43:35,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:43:35,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:35,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:35,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:43:35,369 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:43:35,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 21:43:35,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 21:43:35,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:43:35,373 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:35,400 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:43:35,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:43:35 BoogieIcfgContainer [2025-01-09 21:43:35,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:43:35,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:43:35,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:43:35,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:43:35,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:28" (3/4) ... [2025-01-09 21:43:35,404 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:43:35,447 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-01-09 21:43:35,521 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:43:35,522 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:43:35,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:43:35,522 INFO L158 Benchmark]: Toolchain (without parser) took 7726.57ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 104.6MB in the beginning and 245.3MB in the end (delta: -140.7MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2025-01-09 21:43:35,522 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:35,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.06ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 87.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:43:35,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.31ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:35,523 INFO L158 Benchmark]: Boogie Preprocessor took 42.68ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:35,523 INFO L158 Benchmark]: RCFGBuilder took 358.78ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 68.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:43:35,523 INFO L158 Benchmark]: TraceAbstraction took 6859.31ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.8MB in the beginning and 98.2MB in the end (delta: -30.4MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. [2025-01-09 21:43:35,523 INFO L158 Benchmark]: Witness Printer took 118.69ms. Allocated memory is still 285.2MB. Free memory was 98.2MB in the beginning and 245.3MB in the end (delta: -147.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:35,524 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.24ms. Allocated memory is still 226.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.06ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 87.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.31ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 85.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.68ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.78ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 68.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6859.31ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 67.8MB in the beginning and 98.2MB in the end (delta: -30.4MB). Peak memory consumption was 113.7MB. Max. memory is 16.1GB. * Witness Printer took 118.69ms. Allocated memory is still 285.2MB. Free memory was 98.2MB in the beginning and 245.3MB in the end (delta: -147.1MB). 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: 12]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L599] const int len = 5; [L600] CALL, EXPR dll_create(len) [L579] DLL head = ((void *)0); VAL [head={0:0}, len=5] [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={0:0}, len=5, new_head={-1:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND FALSE !(\read(head)) [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-1:0}, len=4, new_head={-2:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-2:0}, len=3, new_head={-3:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-3:0}, len=2, new_head={-4:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) VAL [head={-4:0}, len=1, new_head={-5:0}] [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND FALSE !(len > 0) [L596] return head; VAL [\result={-5:0}] [L600] RET, EXPR dll_create(len) [L600] DLL head = dll_create(len); [L601] head->next [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 VAL [head={-5:0}] [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "dll_nullified-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 598]: 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 1 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 1135 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 767 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 289 mSDtfsCounter, 767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=10, InterpolantAutomatonStates: 61, 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, 10 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 479 ConstructedInterpolants, 7 QuantifiedInterpolants, 1501 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 431/566 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-01-09 21:43:35,543 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)