./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-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 f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:48:44,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:48:44,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:48:44,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:48:44,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:48:44,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:48:44,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:48:44,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:48:44,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:48:44,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:48:44,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:48:44,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:48:44,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:48:44,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:48:44,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:44,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:48:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:48:44,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:48:44,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:48:44,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:48:44,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:48:44,076 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2025-02-08 05:48:44,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:48:44,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:48:44,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:48:44,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:48:44,297 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:48:44,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2025-02-08 05:48:45,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0cea3107/d217a9eef3084e9fb7c2c0bc5f000e00/FLAGeac23d7a9 [2025-02-08 05:48:45,935 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:48:45,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2025-02-08 05:48:45,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0cea3107/d217a9eef3084e9fb7c2c0bc5f000e00/FLAGeac23d7a9 [2025-02-08 05:48:46,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0cea3107/d217a9eef3084e9fb7c2c0bc5f000e00 [2025-02-08 05:48:46,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:48:46,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:48:46,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:46,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:48:46,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:48:46,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21906d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46, skipping insertion in model container [2025-02-08 05:48:46,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:48:46,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:46,428 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:48:46,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:48:46,505 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:48:46,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46 WrapperNode [2025-02-08 05:48:46,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:48:46,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:46,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:48:46,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:48:46,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,537 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-02-08 05:48:46,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:48:46,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:48:46,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:48:46,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:48:46,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,575 INFO L175 MemorySlicer]: Split 42 memory accesses to 5 slices as follows [2, 18, 8, 6, 8]. 43 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 0, 1, 0]. The 10 writes are split as follows [0, 7, 1, 1, 1]. [2025-02-08 05:48:46,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:48:46,587 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:48:46,587 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:48:46,587 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:48:46,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (1/1) ... [2025-02-08 05:48:46,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:46,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:46,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:48:46,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:48:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-02-08 05:48:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-02-08 05:48:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:48:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:48:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:48:46,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2025-02-08 05:48:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 05:48:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2025-02-08 05:48:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 05:48:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2025-02-08 05:48:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2025-02-08 05:48:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:48:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:48:46,724 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:48:46,725 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:48:46,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: call ULTIMATE.dealloc(main_~#p1~0#1.base, main_~#p1~0#1.offset);havoc main_~#p1~0#1.base, main_~#p1~0#1.offset;call ULTIMATE.dealloc(main_~#p2~0#1.base, main_~#p2~0#1.offset);havoc main_~#p2~0#1.base, main_~#p2~0#1.offset; [2025-02-08 05:48:46,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc create_sll_#t~mem11#1.base, create_sll_#t~mem11#1.offset;call ULTIMATE.dealloc(create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset);havoc create_sll_~#list~0#1.base, create_sll_~#list~0#1.offset; [2025-02-08 05:48:47,012 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-02-08 05:48:47,012 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:48:47,018 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:48:47,019 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:48:47,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:47 BoogieIcfgContainer [2025-02-08 05:48:47,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:48:47,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:48:47,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:48:47,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:48:47,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:48:46" (1/3) ... [2025-02-08 05:48:47,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29354a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:47, skipping insertion in model container [2025-02-08 05:48:47,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:48:46" (2/3) ... [2025-02-08 05:48:47,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29354a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:48:47, skipping insertion in model container [2025-02-08 05:48:47,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:47" (3/3) ... [2025-02-08 05:48:47,025 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2025-02-08 05:48:47,035 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:48:47,036 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_to_dll_rev-1.i that has 5 procedures, 107 locations, 1 initial locations, 21 loop locations, and 2 error locations. [2025-02-08 05:48:47,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:48:47,076 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;@3da99241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:48:47,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:48:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-08 05:48:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 05:48:47,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:47,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:47,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:47,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 767892334, now seen corresponding path program 1 times [2025-02-08 05:48:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-02-08 05:48:47,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:47,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 05:48:47,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 05:48:47,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:47,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-02-08 05:48:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016660619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:48:47,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:48:47,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:48:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955605913] [2025-02-08 05:48:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:48:47,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:48:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:48:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:48:47,227 INFO L87 Difference]: Start difference. First operand has 107 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:48:47,237 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2025-02-08 05:48:47,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:48:47,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-08 05:48:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:48:47,242 INFO L225 Difference]: With dead ends: 60 [2025-02-08 05:48:47,242 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 05:48:47,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:48:47,245 INFO L435 NwaCegarLoop]: 70 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, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:48:47,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:48:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 05:48:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 05:48:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.186046511627907) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:48:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-02-08 05:48:47,272 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 18 [2025-02-08 05:48:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:48:47,273 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-02-08 05:48:47,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:48:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-02-08 05:48:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:48:47,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:48:47,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:48:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:48:47,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:48:47,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:48:47,275 INFO L85 PathProgramCache]: Analyzing trace with hash 299688680, now seen corresponding path program 1 times [2025-02-08 05:48:47,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:48:47,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632409701] [2025-02-08 05:48:47,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:47,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:48:47,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:48:47,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:48:47,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:47,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:48:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:48:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632409701] [2025-02-08 05:48:48,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632409701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:48:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081836207] [2025-02-08 05:48:48,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:48:48,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:48:48,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:48:48,398 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-02-08 05:48:48,399 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-02-08 05:48:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:48:48,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:48:48,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:48:48,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:48:48,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 05:48:48,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:48:48,810 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 23 treesize of output 3 [2025-02-08 05:48:48,864 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 24 treesize of output 16 [2025-02-08 05:48:48,871 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 15 treesize of output 1 [2025-02-08 05:48:52,957 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 16 treesize of output 8 [2025-02-08 05:48:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:48:52,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:48:53,004 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 34 treesize of output 30 [2025-02-08 05:48:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:48:57,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081836207] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:48:57,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:48:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 16 [2025-02-08 05:48:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872074186] [2025-02-08 05:48:57,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:48:57,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 05:48:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:48:57,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 05:48:57,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=201, Unknown=2, NotChecked=0, Total=240 [2025-02-08 05:48:57,131 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:49:01,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:05,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:09,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:13,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:17,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:21,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:25,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:29,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:29,548 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2025-02-08 05:49:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:49:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2025-02-08 05:49:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:29,550 INFO L225 Difference]: With dead ends: 64 [2025-02-08 05:49:29,550 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 05:49:29,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=87, Invalid=463, Unknown=2, NotChecked=0, Total=552 [2025-02-08 05:49:29,550 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 90 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 22 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:29,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 274 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 365 Invalid, 8 Unknown, 0 Unchecked, 32.3s Time] [2025-02-08 05:49:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 05:49:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2025-02-08 05:49:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 51 states have internal predecessors, (54), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2025-02-08 05:49:29,556 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 36 [2025-02-08 05:49:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:29,556 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2025-02-08 05:49:29,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 05:49:29,556 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2025-02-08 05:49:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 05:49:29,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:29,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:29,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:49:29,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:29,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:29,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash -864550520, now seen corresponding path program 1 times [2025-02-08 05:49:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:29,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824217877] [2025-02-08 05:49:29,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:29,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:49:29,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:29,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:29,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:30,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:30,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824217877] [2025-02-08 05:49:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824217877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354746790] [2025-02-08 05:49:30,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:30,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:30,168 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-02-08 05:49:30,171 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-02-08 05:49:30,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:49:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:30,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 05:49:30,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:30,350 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 15 treesize of output 1 [2025-02-08 05:49:30,372 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 15 treesize of output 11 [2025-02-08 05:49:30,401 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 20 treesize of output 12 [2025-02-08 05:49:30,428 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 20 treesize of output 12 [2025-02-08 05:49:30,447 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 16 treesize of output 8 [2025-02-08 05:49:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:30,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:30,503 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 34 treesize of output 30 [2025-02-08 05:49:30,550 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 26 [2025-02-08 05:49:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354746790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:30,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 12 [2025-02-08 05:49:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87442715] [2025-02-08 05:49:30,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:30,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 05:49:30,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:30,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 05:49:30,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:49:30,567 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:49:34,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:38,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:42,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 05:49:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:42,835 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2025-02-08 05:49:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 05:49:42,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2025-02-08 05:49:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:42,837 INFO L225 Difference]: With dead ends: 80 [2025-02-08 05:49:42,837 INFO L226 Difference]: Without dead ends: 80 [2025-02-08 05:49:42,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:49:42,842 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:42,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 400 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 214 Invalid, 3 Unknown, 0 Unchecked, 12.2s Time] [2025-02-08 05:49:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-08 05:49:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2025-02-08 05:49:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 05:49:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2025-02-08 05:49:42,847 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 39 [2025-02-08 05:49:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:42,847 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2025-02-08 05:49:42,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 05:49:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2025-02-08 05:49:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 05:49:42,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:42,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:42,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:49:43,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:43,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 9405027, now seen corresponding path program 1 times [2025-02-08 05:49:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783744858] [2025-02-08 05:49:43,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:43,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:49:43,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:49:43,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:43,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:43,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:49:43,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:49:43,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:49:43,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:43,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:43,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:49:43,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:49:43,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 05:49:43,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 05:49:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:49:43,156 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:49:43,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:49:43,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:49:43 BoogieIcfgContainer [2025-02-08 05:49:43,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:49:43,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:49:43,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:49:43,187 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:49:43,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:48:47" (3/4) ... [2025-02-08 05:49:43,192 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:49:43,244 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 34. [2025-02-08 05:49:43,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:49:43,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:49:43,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:49:43,317 INFO L158 Benchmark]: Toolchain (without parser) took 57171.25ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 109.6MB in the beginning and 172.7MB in the end (delta: -63.1MB). Peak memory consumption was 89.7MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,318 INFO L158 Benchmark]: CDTParser took 3.37ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:43,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.27ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 91.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:43,318 INFO L158 Benchmark]: Boogie Preprocessor took 48.31ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,318 INFO L158 Benchmark]: IcfgBuilder took 432.40ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 60.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,319 INFO L158 Benchmark]: TraceAbstraction took 56166.19ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 59.5MB in the beginning and 181.1MB in the end (delta: -121.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,319 INFO L158 Benchmark]: Witness Printer took 130.04ms. Allocated memory is still 293.6MB. Free memory was 181.1MB in the beginning and 172.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:49:43,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.37ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.27ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 91.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.34ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.31ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 84.6MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 432.40ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 60.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 56166.19ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 59.5MB in the beginning and 181.1MB in the end (delta: -121.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 130.04ms. Allocated memory is still 293.6MB. Free memory was 181.1MB in the beginning and 172.7MB in the end (delta: 8.4MB). 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: [L639] const struct node *p1, *p2; [L640] CALL, EXPR create_sll(&p1, &p2) [L588] struct node *list = ((void *)0); [L588] struct node *list = ((void *)0); [L591] COND TRUE __VERIFIER_nondet_int() VAL [list={5:0}, pp1={3:0}, pp2={6:0}] [L590] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-1:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={5:0}] [L590] RET chain_node(&list) VAL [list={5:0}, pp1={3:0}, pp2={6:0}] [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND TRUE __VERIFIER_nondet_int() [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L598] COND TRUE __VERIFIER_nondet_int() VAL [list={5:0}] [L597] CALL chain_node(&list) [L582] CALL, EXPR alloc_node() [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) VAL [ptr={-2:0}] [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] RET, EXPR alloc_node() [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node VAL [\old(ppnode)={5:0}] [L597] RET chain_node(&list) VAL [list={5:0}] [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; VAL [\result={-2:0}] [L640] RET, EXPR create_sll(&p1, &p2) [L640] struct node *list = create_sll(&p1, &p2); [L641] COND TRUE 0 VAL [list={-2:0}, p1={3:0}, p2={6:0}] [L641] COND FALSE !(0) VAL [list={-2:0}, p1={3:0}, p2={6:0}] [L642] EXPR \read(*p1) [L642] EXPR \read(*p2) [L642] CALL check_seq_next(p1, p2) VAL [\old(beg)={-1:0}, \old(end)={-1:0}] [L626] COND TRUE 0 VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L626] COND FALSE !(!(beg)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L626] COND FALSE !(0) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND TRUE 0 VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(!(end)) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L627] COND FALSE !(0) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={-1:0}, end={-1:0}] [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE 0 VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] COND TRUE !(beg) VAL [\old(beg)={-1:0}, \old(end)={-1:0}, beg={0:0}, end={-1:0}] [L629] CALL fail() [L565] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "sll_to_dll_rev-1.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 637]: 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 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 56.1s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 44.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 744 SdHoareTripleChecker+Invalid, 44.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 591 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 579 IncrementalHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 153 mSDtfsCounter, 579 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 236 ConstructedInterpolants, 10 QuantifiedInterpolants, 1634 SizeOfPredicates, 19 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 5/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:49:43,339 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)