./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --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/verifythis/tree_max.c -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 e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:43:40,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:43:40,581 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:40,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:43:40,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:43:40,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:43:40,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:43:40,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:43:40,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 21:43:40,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 21:43:40,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:43:40,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:43:40,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:43:40,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 21:43:40,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:43:40,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:40,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:40,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:40,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:43:40,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:43:40,604 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 -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2025-01-09 21:43:40,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:43:40,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:43:40,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:43:40,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:43:40,821 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:43:40,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2025-01-09 21:43:41,910 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d695d80/30399e981cbe4d4eb03e8a39ee768454/FLAG1d201239d [2025-01-09 21:43:42,170 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:43:42,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-01-09 21:43:42,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d695d80/30399e981cbe4d4eb03e8a39ee768454/FLAG1d201239d [2025-01-09 21:43:42,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57d695d80/30399e981cbe4d4eb03e8a39ee768454 [2025-01-09 21:43:42,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:43:42,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:43:42,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:42,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:43:42,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:43:42,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:42" (1/1) ... [2025-01-09 21:43:42,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:42, skipping insertion in model container [2025-01-09 21:43:42,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:43:42" (1/1) ... [2025-01-09 21:43:42,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:43:42,305 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 21:43:42,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:42,325 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:43:42,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:43:42,355 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:43:42,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:42 WrapperNode [2025-01-09 21:43:42,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:43:42,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:42,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:43:42,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:43:42,363 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:42" (1/1) ... [2025-01-09 21:43:42,369 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:42" (1/1) ... [2025-01-09 21:43:42,388 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 40 [2025-01-09 21:43:42,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:43:42,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:43:42,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:43:42,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:43:42,396 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:42" (1/1) ... [2025-01-09 21:43:42,397 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:42" (1/1) ... [2025-01-09 21:43:42,399 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:42" (1/1) ... [2025-01-09 21:43:42,417 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 21:43:42,419 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:42" (1/1) ... [2025-01-09 21:43:42,419 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:42" (1/1) ... [2025-01-09 21:43:42,426 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:42" (1/1) ... [2025-01-09 21:43:42,431 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:42" (1/1) ... [2025-01-09 21:43:42,432 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:42" (1/1) ... [2025-01-09 21:43:42,433 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:42" (1/1) ... [2025-01-09 21:43:42,433 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:42" (1/1) ... [2025-01-09 21:43:42,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:43:42,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:43:42,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:43:42,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:43:42,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:42" (1/1) ... [2025-01-09 21:43:42,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:43:42,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:42,467 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:42,469 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:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 21:43:42,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-01-09 21:43:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-01-09 21:43:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-01-09 21:43:42,489 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 21:43:42,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 21:43:42,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 21:43:42,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:43:42,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:43:42,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:43:42,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 21:43:42,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 21:43:42,559 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:43:42,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:43:42,713 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-01-09 21:43:42,715 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:43:42,722 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:43:42,723 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:43:42,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:42 BoogieIcfgContainer [2025-01-09 21:43:42,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:43:42,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:43:42,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:43:42,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:43:42,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:43:42" (1/3) ... [2025-01-09 21:43:42,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522d580b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:42, skipping insertion in model container [2025-01-09 21:43:42,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:43:42" (2/3) ... [2025-01-09 21:43:42,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522d580b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:43:42, skipping insertion in model container [2025-01-09 21:43:42,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:43:42" (3/3) ... [2025-01-09 21:43:42,731 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-01-09 21:43:42,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:43:42,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_max.c that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-09 21:43:42,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:43:42,780 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;@34fd77d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:43:42,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 21:43:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 21:43:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 21:43:42,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:42,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:42,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:42,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1784882872, now seen corresponding path program 1 times [2025-01-09 21:43:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:42,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072040498] [2025-01-09 21:43:42,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:42,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 21:43:42,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 21:43:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:43,153 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:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072040498] [2025-01-09 21:43:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072040498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 21:43:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163178456] [2025-01-09 21:43:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 21:43:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:43,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 21:43:43,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 21:43:43,176 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:43:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:43,240 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-01-09 21:43:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 21:43:43,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-01-09 21:43:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:43,246 INFO L225 Difference]: With dead ends: 54 [2025-01-09 21:43:43,246 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 21:43:43,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:43:43,248 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:43,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 21:43:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-01-09 21:43:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-01-09 21:43:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-01-09 21:43:43,271 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 19 [2025-01-09 21:43:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:43,271 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-01-09 21:43:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 21:43:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-01-09 21:43:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 21:43:43,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:43,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:43,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:43:43,273 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1558539456, now seen corresponding path program 1 times [2025-01-09 21:43:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:43,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553953890] [2025-01-09 21:43:43,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:43,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 21:43:43,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 21:43:43,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:43,335 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:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:43,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553953890] [2025-01-09 21:43:43,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553953890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:43,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:43,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:43:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527431181] [2025-01-09 21:43:43,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:43:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:43,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:43:43,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:43:43,337 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:43:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:43,414 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-01-09 21:43:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:43:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-01-09 21:43:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:43,416 INFO L225 Difference]: With dead ends: 53 [2025-01-09 21:43:43,416 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 21:43:43,416 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:43,416 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:43,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 21:43:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 21:43:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 21:43:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2025-01-09 21:43:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-01-09 21:43:43,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2025-01-09 21:43:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:43,421 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-01-09 21:43:43,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 21:43:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-01-09 21:43:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 21:43:43,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:43,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:43,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:43:43,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:43,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash -583725959, now seen corresponding path program 1 times [2025-01-09 21:43:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61032020] [2025-01-09 21:43:43,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:43,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:43:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:43:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 21:43:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:43,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61032020] [2025-01-09 21:43:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61032020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:43:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:43:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959205240] [2025-01-09 21:43:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:43,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:43:43,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:43,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:43:43,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:43:43,586 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 21:43:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:43,626 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-01-09 21:43:43,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:43:43,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-01-09 21:43:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:43,627 INFO L225 Difference]: With dead ends: 45 [2025-01-09 21:43:43,627 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 21:43:43,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:43:43,628 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:43,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 21:43:43,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-09 21:43:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-01-09 21:43:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-01-09 21:43:43,632 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 31 [2025-01-09 21:43:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:43,632 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-01-09 21:43:43,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 21:43:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-01-09 21:43:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 21:43:43,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:43,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-01-09 21:43:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:43:43,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1389688533, now seen corresponding path program 1 times [2025-01-09 21:43:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032749367] [2025-01-09 21:43:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:43,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:43:43,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:43:43,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:43,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:43:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032749367] [2025-01-09 21:43:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032749367] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:44,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305237640] [2025-01-09 21:43:44,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:44,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:44,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:44,299 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:44,300 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:44,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:43:44,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:43:44,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:44,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:44,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 21:43:44,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:44,725 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 15 treesize of output 7 [2025-01-09 21:43:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 21:43:44,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:44,971 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 21:43:44,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 13 [2025-01-09 21:43:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:45,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305237640] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:45,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:45,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 22 [2025-01-09 21:43:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117269969] [2025-01-09 21:43:45,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:45,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 21:43:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:45,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 21:43:45,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-01-09 21:43:45,004 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 21:43:45,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:45,447 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-01-09 21:43:45,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 21:43:45,448 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2025-01-09 21:43:45,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:45,449 INFO L225 Difference]: With dead ends: 56 [2025-01-09 21:43:45,449 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 21:43:45,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-01-09 21:43:45,449 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:45,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 21:43:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 21:43:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 21:43:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 21:43:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2025-01-09 21:43:45,457 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 44 [2025-01-09 21:43:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:45,458 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-01-09 21:43:45,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-01-09 21:43:45,458 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2025-01-09 21:43:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 21:43:45,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:45,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 21:43:45,467 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:45,664 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:45,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 266098275, now seen corresponding path program 1 times [2025-01-09 21:43:45,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320327369] [2025-01-09 21:43:45,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:45,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:43:45,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:43:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:45,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 21:43:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320327369] [2025-01-09 21:43:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320327369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509095888] [2025-01-09 21:43:46,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:46,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:46,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:46,035 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:46,036 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:46,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:43:46,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:43:46,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:46,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:46,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 21:43:46,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 21:43:46,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 21:43:46,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509095888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:43:46,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 21:43:46,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2025-01-09 21:43:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630596457] [2025-01-09 21:43:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:43:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:43:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:46,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:43:46,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:43:46,172 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 21:43:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:46,212 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-01-09 21:43:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 21:43:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2025-01-09 21:43:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:46,213 INFO L225 Difference]: With dead ends: 60 [2025-01-09 21:43:46,213 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 21:43:46,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:43:46,214 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:46,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 21:43:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 21:43:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-01-09 21:43:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 21:43:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-01-09 21:43:46,218 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 46 [2025-01-09 21:43:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:46,219 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-01-09 21:43:46,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 21:43:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-01-09 21:43:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:43:46,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:46,220 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 21:43:46,225 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-01-09 21:43:46,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:46,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:46,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash 358548016, now seen corresponding path program 1 times [2025-01-09 21:43:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:46,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735788698] [2025-01-09 21:43:46,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:46,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:46,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:46,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:46,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:46,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735788698] [2025-01-09 21:43:46,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735788698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:46,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799878316] [2025-01-09 21:43:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:46,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:46,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:46,831 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:46,833 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:46,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:46,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:46,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:46,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:46,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 21:43:46,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:46,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:43:46,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:43:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:47,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:43:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799878316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:47,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 20 [2025-01-09 21:43:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859487735] [2025-01-09 21:43:47,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:47,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:43:47,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:47,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:43:47,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:43:47,347 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 21:43:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:47,627 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2025-01-09 21:43:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 21:43:47,628 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) Word has length 50 [2025-01-09 21:43:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:47,629 INFO L225 Difference]: With dead ends: 108 [2025-01-09 21:43:47,629 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 21:43:47,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-01-09 21:43:47,629 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 41 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:47,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 488 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 21:43:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 21:43:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2025-01-09 21:43:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 19 states have call successors, (19), 8 states have call predecessors, (19), 12 states have return successors, (28), 20 states have call predecessors, (28), 19 states have call successors, (28) [2025-01-09 21:43:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2025-01-09 21:43:47,640 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 50 [2025-01-09 21:43:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:47,640 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2025-01-09 21:43:47,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 13 states have internal predecessors, (47), 6 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 9 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 21:43:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2025-01-09 21:43:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 21:43:47,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:47,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 21:43:47,648 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:47,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:47,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:47,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash 242184370, now seen corresponding path program 1 times [2025-01-09 21:43:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:47,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-01-09 21:43:47,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:47,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:47,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:47,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:47,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 21:43:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111950466] [2025-01-09 21:43:48,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111950466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216931314] [2025-01-09 21:43:48,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:48,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:48,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:48,427 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:48,432 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:48,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:43:48,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:43:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:48,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:48,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 21:43:48,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:48,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:43:48,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:43:48,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 21:43:48,612 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 29 treesize of output 13 [2025-01-09 21:43:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 21:43:48,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 21:43:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216931314] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:49,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 29 [2025-01-09 21:43:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731507462] [2025-01-09 21:43:49,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:49,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 21:43:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:49,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 21:43:49,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2025-01-09 21:43:49,176 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 21:43:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:50,378 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2025-01-09 21:43:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 21:43:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) Word has length 50 [2025-01-09 21:43:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:50,380 INFO L225 Difference]: With dead ends: 206 [2025-01-09 21:43:50,380 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 21:43:50,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 21:43:50,381 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 190 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:50,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 348 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 21:43:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 21:43:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2025-01-09 21:43:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 140 states have internal predecessors, (165), 35 states have call successors, (35), 17 states have call predecessors, (35), 25 states have return successors, (68), 39 states have call predecessors, (68), 35 states have call successors, (68) [2025-01-09 21:43:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2025-01-09 21:43:50,400 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 50 [2025-01-09 21:43:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:50,400 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2025-01-09 21:43:50,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 22 states have internal predecessors, (62), 10 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (16), 11 states have call predecessors, (16), 8 states have call successors, (16) [2025-01-09 21:43:50,401 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2025-01-09 21:43:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 21:43:50,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:50,406 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 21:43:50,415 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:50,606 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,SelfDestructingSolverStorable6 [2025-01-09 21:43:50,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:50,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -677748063, now seen corresponding path program 2 times [2025-01-09 21:43:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780259873] [2025-01-09 21:43:50,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:43:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:50,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 21:43:50,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:43:50,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:43:50,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 21:43:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:43:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780259873] [2025-01-09 21:43:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780259873] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:43:51,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541827223] [2025-01-09 21:43:51,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:43:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:51,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:43:51,209 INFO L229 MonitoredProcess]: Starting monitored process 6 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:51,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:43:51,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 21:43:51,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:43:51,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:43:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:43:51,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 21:43:51,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:43:51,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 21:43:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:43:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 21:43:51,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:43:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 21:43:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541827223] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:43:52,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:43:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 43 [2025-01-09 21:43:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611751700] [2025-01-09 21:43:52,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:43:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 21:43:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:43:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 21:43:52,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1649, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 21:43:52,173 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 21:43:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 21:43:52,693 INFO L93 Difference]: Finished difference Result 296 states and 406 transitions. [2025-01-09 21:43:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 21:43:52,694 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) Word has length 62 [2025-01-09 21:43:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 21:43:52,697 INFO L225 Difference]: With dead ends: 296 [2025-01-09 21:43:52,699 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 21:43:52,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 21:43:52,700 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 52 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 21:43:52,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 790 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 21:43:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 21:43:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 241. [2025-01-09 21:43:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 167 states have (on average 1.215568862275449) internal successors, (203), 172 states have internal predecessors, (203), 41 states have call successors, (41), 21 states have call predecessors, (41), 31 states have return successors, (82), 47 states have call predecessors, (82), 41 states have call successors, (82) [2025-01-09 21:43:52,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 326 transitions. [2025-01-09 21:43:52,715 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 326 transitions. Word has length 62 [2025-01-09 21:43:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 21:43:52,715 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 326 transitions. [2025-01-09 21:43:52,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 34 states have internal predecessors, (75), 15 states have call successors, (18), 6 states have call predecessors, (18), 12 states have return successors, (17), 16 states have call predecessors, (17), 11 states have call successors, (17) [2025-01-09 21:43:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 326 transitions. [2025-01-09 21:43:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 21:43:52,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 21:43:52,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 21:43:52,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:43:52,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:43:52,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-01-09 21:43:52,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:43:52,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1572615861, now seen corresponding path program 1 times [2025-01-09 21:43:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:43:52,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437327838] [2025-01-09 21:43:52,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:43:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:43:52,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:43:52,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:43:52,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:52,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:52,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:43:52,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:43:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:43:52,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:43:52,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:43:52,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:43:52,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:43:52,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-01-09 21:43:52,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-01-09 21:43:52,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:43:52,969 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:43:52,998 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:43:53,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:43:52 BoogieIcfgContainer [2025-01-09 21:43:53,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:43:53,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:43:53,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:43:53,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:43:53,001 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:42" (3/4) ... [2025-01-09 21:43:53,001 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:43:53,040 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-01-09 21:43:53,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:43:53,090 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:43:53,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:43:53,091 INFO L158 Benchmark]: Toolchain (without parser) took 10904.04ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 105.8MB in the beginning and 317.3MB in the end (delta: -211.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2025-01-09 21:43:53,091 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:53,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 95.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:53,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.35ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:53,092 INFO L158 Benchmark]: Boogie Preprocessor took 47.03ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:53,093 INFO L158 Benchmark]: RCFGBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 77.2MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:43:53,093 INFO L158 Benchmark]: TraceAbstraction took 10274.71ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 76.7MB in the beginning and 321.5MB in the end (delta: -244.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2025-01-09 21:43:53,093 INFO L158 Benchmark]: Witness Printer took 90.25ms. Allocated memory is still 402.7MB. Free memory was 321.5MB in the beginning and 317.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:43:53,094 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.30ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 95.0MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.35ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 93.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.03ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 91.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 77.2MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10274.71ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 76.7MB in the beginning and 321.5MB in the end (delta: -244.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 90.25ms. Allocated memory is still 402.7MB. Free memory was 321.5MB in the beginning and 317.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L66] CALL, EXPR nondet_tree() [L24] COND FALSE !(__VERIFIER_nondet_bool()) [L27] struct node *n = (struct node *)malloc(sizeof(struct node)); [L28] n->data = __VERIFIER_nondet_int() [L29] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [n={-1:0}] [L29] n->left = nondet_tree() [L30] CALL, EXPR nondet_tree() [L24] COND TRUE __VERIFIER_nondet_bool() [L25] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->right = nondet_tree() [L31] return n; VAL [\result={-1:0}] [L66] RET, EXPR nondet_tree() [L66] CALL task(nondet_tree()) [L61] CALL, EXPR max(n) VAL [\old(n)={-1:0}] [L36] COND FALSE !(!n) [L39] EXPR n->data [L39] int a = n->data; [L40] EXPR n->left VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] CALL, EXPR max(n->left) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L40] RET, EXPR max(n->left) VAL [\old(n)={-1:0}, a=-2147483648, n={-1:0}] [L40] int b = max(n->left); [L41] EXPR n->right VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] CALL, EXPR max(n->right) VAL [\old(n)={0:0}] [L36] COND TRUE !n [L37] return -2147483648; VAL [\old(n)={0:0}, \result=-2147483648] [L41] RET, EXPR max(n->right) VAL [\old(n)={-1:0}, a=-2147483648, b=-2147483648] [L41] int c = max(n->right); [L42] COND TRUE b >= a && b >= c [L42] return b; VAL [\old(n)={-1:0}, \result=-2147483648] [L61] RET, EXPR max(n) VAL [n={-1:0}] [L61] int a = max(n); [L62] CALL check(n, a) [L49] COND TRUE \read(*n) [L50] EXPR n->data [L50] CALL __VERIFIER_assert(n->data <= a) [L15] COND FALSE !(!cond) [L50] RET __VERIFIER_assert(n->data <= a) [L52] COND FALSE !(__VERIFIER_nondet_bool()) [L55] EXPR n->right VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L55] CALL check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={0:0}] [L49] COND FALSE !(\read(*n)) [L55] RET check(n->right, a) VAL [\old(a)=-2147483648, \old(n)={-1:0}, a=-2147483648] [L62] RET check(n, a) VAL [a=-2147483648, n={-1:0}] [L66] RET task(nondet_tree()) - UnprovableResult [Line: 13]: 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 4 procedures, 44 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 2752 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2473 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3007 IncrementalHoareTripleChecker+Invalid, 3167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 279 mSDtfsCounter, 3007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 416 SyntacticMatches, 9 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=8, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 764 ConstructedInterpolants, 65 QuantifiedInterpolants, 4968 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 399/471 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:53,113 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)