./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c00e63dc 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/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:40:07,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:40:07,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-06 09:40:07,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:40:07,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:40:07,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:40:07,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:40:07,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:40:07,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:40:07,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:40:07,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:40:07,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:40:07,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:40:07,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:40:07,154 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:40:07,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:40:07,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:40:07,154 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:40:07,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:40:07,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:40:07,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:40:07,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:07,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:40:07,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:40:07,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:40:07,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:40:07,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:40:07,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:40:07,157 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-02-06 09:40:07,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:40:07,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:40:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:40:07,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:40:07,458 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:40:07,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-02-06 09:40:08,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fffce4c4/1f11c80fdc334ce784d9d28c4fee5f90/FLAGa8385060a [2025-02-06 09:40:08,933 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:40:08,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-02-06 09:40:08,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fffce4c4/1f11c80fdc334ce784d9d28c4fee5f90/FLAGa8385060a [2025-02-06 09:40:09,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fffce4c4/1f11c80fdc334ce784d9d28c4fee5f90 [2025-02-06 09:40:09,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:40:09,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:40:09,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:09,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:40:09,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:40:09,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09, skipping insertion in model container [2025-02-06 09:40:09,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:40:09,384 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:40:09,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:09,398 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:40:09,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:09,460 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:40:09,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09 WrapperNode [2025-02-06 09:40:09,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:09,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:09,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:40:09,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:40:09,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,494 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 79 [2025-02-06 09:40:09,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:09,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:40:09,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:40:09,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:40:09,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,512 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-06 09:40:09,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:40:09,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:40:09,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:40:09,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:40:09,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (1/1) ... [2025-02-06 09:40:09,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:09,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:09,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:40:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:40:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:40:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:40:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:40:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-02-06 09:40:09,574 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 09:40:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:40:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:40:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:40:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:40:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:40:09,682 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:40:09,684 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:40:09,812 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-06 09:40:09,812 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:40:09,818 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:40:09,818 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:40:09,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:09 BoogieIcfgContainer [2025-02-06 09:40:09,818 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:40:09,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:40:09,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:40:09,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:40:09,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:40:09" (1/3) ... [2025-02-06 09:40:09,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0023f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:09, skipping insertion in model container [2025-02-06 09:40:09,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:09" (2/3) ... [2025-02-06 09:40:09,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0023f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:09, skipping insertion in model container [2025-02-06 09:40:09,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:09" (3/3) ... [2025-02-06 09:40:09,825 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-02-06 09:40:09,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:40:09,839 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 09:40:09,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:40:09,880 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;@57d3c90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:40:09,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 09:40:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 09:40:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 09:40:09,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:09,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:09,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:09,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1843807398, now seen corresponding path program 1 times [2025-02-06 09:40:09,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:09,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-06 09:40:09,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:09,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:40:09,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:40:09,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:09,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:40:10,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717213671] [2025-02-06 09:40:10,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717213671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833253570] [2025-02-06 09:40:10,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:10,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:10,117 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:10,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:40:10,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:40:10,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:40:10,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:10,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:10,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 09:40:10,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:10,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833253570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:10,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 09:40:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759096479] [2025-02-06 09:40:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:10,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:10,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:10,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:40:10,240 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:10,259 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-02-06 09:40:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:10,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2025-02-06 09:40:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:10,264 INFO L225 Difference]: With dead ends: 29 [2025-02-06 09:40:10,264 INFO L226 Difference]: Without dead ends: 27 [2025-02-06 09:40:10,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:40:10,267 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:10,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-06 09:40:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-02-06 09:40:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 09:40:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-02-06 09:40:10,291 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 19 [2025-02-06 09:40:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:10,291 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-06 09:40:10,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-02-06 09:40:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 09:40:10,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:10,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:10,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:40:10,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 09:40:10,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:10,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:10,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2145230472, now seen corresponding path program 1 times [2025-02-06 09:40:10,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:10,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361407695] [2025-02-06 09:40:10,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:10,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:40:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:40:10,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:10,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-06 09:40:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361407695] [2025-02-06 09:40:10,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361407695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86460493] [2025-02-06 09:40:10,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:10,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:10,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:10,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:10,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:40:10,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 09:40:10,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 09:40:10,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:10,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:10,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:40:10,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 09:40:10,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86460493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 09:40:10,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101780352] [2025-02-06 09:40:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:10,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:40:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:10,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:40:10,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:10,743 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:10,776 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2025-02-06 09:40:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:40:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-02-06 09:40:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:10,778 INFO L225 Difference]: With dead ends: 32 [2025-02-06 09:40:10,778 INFO L226 Difference]: Without dead ends: 30 [2025-02-06 09:40:10,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:10,779 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:10,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:10,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-06 09:40:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-06 09:40:10,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2025-02-06 09:40:10,784 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 28 [2025-02-06 09:40:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:10,784 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2025-02-06 09:40:10,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2025-02-06 09:40:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 09:40:10,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:10,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:10,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:40:10,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:10,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:10,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2072158492, now seen corresponding path program 1 times [2025-02-06 09:40:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:10,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054947771] [2025-02-06 09:40:10,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:11,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:40:11,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:40:11,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 09:40:11,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:11,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054947771] [2025-02-06 09:40:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054947771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101842856] [2025-02-06 09:40:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:11,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:11,067 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-02-06 09:40:11,069 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-02-06 09:40:11,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:40:11,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:40:11,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:11,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:11,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:40:11,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:40:11,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 09:40:11,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101842856] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:11,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:40:11,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2025-02-06 09:40:11,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-02-06 09:40:11,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:11,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:11,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:11,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:11,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:11,205 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 09:40:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:11,226 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2025-02-06 09:40:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:11,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 31 [2025-02-06 09:40:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:11,227 INFO L225 Difference]: With dead ends: 34 [2025-02-06 09:40:11,227 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 09:40:11,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:11,228 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:11,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 09:40:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 09:40:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2025-02-06 09:40:11,233 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 31 [2025-02-06 09:40:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2025-02-06 09:40:11,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 09:40:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2025-02-06 09:40:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 09:40:11,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:11,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:11,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:40:11,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:11,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1891170124, now seen corresponding path program 1 times [2025-02-06 09:40:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-02-06 09:40:11,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:11,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:40:11,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:40:11,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:11,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 09:40:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-02-06 09:40:11,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821752938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040230450] [2025-02-06 09:40:11,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:11,644 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-02-06 09:40:11,645 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-02-06 09:40:11,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 09:40:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 09:40:11,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:11,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:11,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 09:40:11,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 09:40:11,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040230450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:11,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:11,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 09:40:11,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039062390] [2025-02-06 09:40:11,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:11,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:11,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:11,756 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:11,761 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2025-02-06 09:40:11,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:11,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-02-06 09:40:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:11,762 INFO L225 Difference]: With dead ends: 33 [2025-02-06 09:40:11,762 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 09:40:11,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:11,762 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:11,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 09:40:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 09:40:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2025-02-06 09:40:11,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 37 [2025-02-06 09:40:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:11,767 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2025-02-06 09:40:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2025-02-06 09:40:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 09:40:11,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:11,768 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:11,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:40:11,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:11,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1157875068, now seen corresponding path program 1 times [2025-02-06 09:40:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-02-06 09:40:11,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:11,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:11,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:11,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:11,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:40:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-02-06 09:40:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18989616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733163330] [2025-02-06 09:40:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:12,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:12,053 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-02-06 09:40:12,054 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-02-06 09:40:12,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:12,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:12,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 09:40:12,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:12,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:40:12,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:12,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733163330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:12,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:12,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 09:40:12,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303699264] [2025-02-06 09:40:12,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:12,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:12,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:12,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:12,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:40:12,287 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:12,325 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2025-02-06 09:40:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:12,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-06 09:40:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:12,326 INFO L225 Difference]: With dead ends: 34 [2025-02-06 09:40:12,326 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 09:40:12,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:40:12,327 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:12,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 09:40:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 09:40:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2025-02-06 09:40:12,331 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 39 [2025-02-06 09:40:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:12,331 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-02-06 09:40:12,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:12,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2025-02-06 09:40:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 09:40:12,332 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:12,332 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:12,340 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-02-06 09:40:12,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:12,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:12,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:12,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1586386812, now seen corresponding path program 1 times [2025-02-06 09:40:12,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:12,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-02-06 09:40:12,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:12,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:12,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:12,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:12,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 09:40:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:40:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446556976] [2025-02-06 09:40:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446556976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708344666] [2025-02-06 09:40:12,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:12,655 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:12,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 09:40:12,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:12,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:12,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:12,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:12,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 09:40:12,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 09:40:12,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708344666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2025-02-06 09:40:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-02-06 09:40:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:40:12,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:12,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:12,821 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:12,886 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2025-02-06 09:40:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:40:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-06 09:40:12,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:12,890 INFO L225 Difference]: With dead ends: 58 [2025-02-06 09:40:12,890 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 09:40:12,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:40:12,891 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 40 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:12,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 09:40:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-02-06 09:40:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-02-06 09:40:12,898 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 39 [2025-02-06 09:40:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:12,901 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-02-06 09:40:12,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-02-06 09:40:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 09:40:12,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:12,904 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:12,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 09:40:13,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 09:40:13,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:13,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:13,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1575070685, now seen corresponding path program 1 times [2025-02-06 09:40:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:40:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484279832] [2025-02-06 09:40:13,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:13,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:40:13,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:13,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:13,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:13,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:13,121 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:40:13,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:13,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:13,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:13,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:13,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 09:40:13,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:40:13,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 1 remaining) [2025-02-06 09:40:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:40:13,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:13,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:40:13,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:40:13 BoogieIcfgContainer [2025-02-06 09:40:13,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:40:13,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:40:13,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:40:13,193 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:40:13,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:09" (3/4) ... [2025-02-06 09:40:13,195 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 09:40:13,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:40:13,196 INFO L158 Benchmark]: Toolchain (without parser) took 4010.10ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 105.1MB in the end (delta: 16.5MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-02-06 09:40:13,196 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 192.9MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:13,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 101.9MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:40:13,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:13,197 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:13,197 INFO L158 Benchmark]: IcfgBuilder took 292.66ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 83.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:40:13,197 INFO L158 Benchmark]: TraceAbstraction took 3371.31ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 105.1MB in the end (delta: -22.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:13,198 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:13,199 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.25ms. Allocated memory is still 192.9MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.45ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 101.9MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 167.8MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 167.8MB. Free memory was 99.8MB in the beginning and 98.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 292.66ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 83.7MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3371.31ms. Allocated memory is still 167.8MB. Free memory was 83.0MB in the beginning and 105.1MB in the end (delta: -22.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 33.1kB). 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 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=2, state=1] [L692] COND FALSE !(i < 2) [L723] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=2, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c2") VAL [commands={6:0}, global={-3:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-3:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 7, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 241 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 166 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 221 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 1203 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 280/357 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 could not prove your program: unable to determine feasibility of some traces [2025-02-06 09:40:13,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/memsafety-bftpd/bftpd_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.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 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:40:15,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:40:15,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2025-02-06 09:40:15,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:40:15,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:40:15,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:40:15,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:40:15,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:40:15,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:40:15,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:40:15,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:40:15,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:40:15,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:40:15,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:40:15,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:40:15,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:15,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:40:15,120 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 09:40:15,121 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 09:40:15,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:40:15,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:40:15,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:40:15,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:40:15,121 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 -> 7c883b81b24ce5a721aa9a1ff13aef8a0d532ba87d9e130e470a0b88a1f8e93e [2025-02-06 09:40:15,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:40:15,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:40:15,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:40:15,392 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:40:15,392 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:40:15,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-02-06 09:40:16,582 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67809324d/f120fde2be4d4f87b69dee6006039c59/FLAG09ed440f0 [2025-02-06 09:40:16,792 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:40:16,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_2.i [2025-02-06 09:40:16,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67809324d/f120fde2be4d4f87b69dee6006039c59/FLAG09ed440f0 [2025-02-06 09:40:16,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67809324d/f120fde2be4d4f87b69dee6006039c59 [2025-02-06 09:40:16,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:40:16,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:40:16,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:16,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:40:16,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:40:16,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:16" (1/1) ... [2025-02-06 09:40:16,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a67435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:16, skipping insertion in model container [2025-02-06 09:40:16,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:40:16" (1/1) ... [2025-02-06 09:40:16,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:40:17,078 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 09:40:17,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:17,092 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:40:17,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:40:17,168 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:40:17,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17 WrapperNode [2025-02-06 09:40:17,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:40:17,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:17,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:40:17,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:40:17,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,206 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-02-06 09:40:17,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:40:17,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:40:17,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:40:17,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:40:17,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,233 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [9, 6, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-06 09:40:17,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:40:17,251 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:40:17,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:40:17,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:40:17,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (1/1) ... [2025-02-06 09:40:17,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:40:17,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:17,293 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:40:17,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:40:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 09:40:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 09:40:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 09:40:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2025-02-06 09:40:17,313 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2025-02-06 09:40:17,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 09:40:17,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:40:17,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:40:17,411 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:40:17,413 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:40:17,562 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-02-06 09:40:17,562 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:40:17,568 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:40:17,569 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:40:17,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:17 BoogieIcfgContainer [2025-02-06 09:40:17,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:40:17,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:40:17,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:40:17,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:40:17,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:40:16" (1/3) ... [2025-02-06 09:40:17,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554999c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:17, skipping insertion in model container [2025-02-06 09:40:17,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:40:17" (2/3) ... [2025-02-06 09:40:17,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554999c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:40:17, skipping insertion in model container [2025-02-06 09:40:17,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:17" (3/3) ... [2025-02-06 09:40:17,577 INFO L128 eAbstractionObserver]: Analyzing ICFG bftpd_2.i [2025-02-06 09:40:17,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:40:17,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bftpd_2.i that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 09:40:17,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:40:17,624 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;@3d4ffb35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:40:17,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 09:40:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 09:40:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 09:40:17,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:17,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:17,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:17,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1843807398, now seen corresponding path program 1 times [2025-02-06 09:40:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536951018] [2025-02-06 09:40:17,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:17,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:17,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:17,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:40:17,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:40:17,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:40:17,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:17,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:17,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:40:17,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 09:40:17,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:17,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536951018] [2025-02-06 09:40:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536951018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467082633] [2025-02-06 09:40:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:17,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:40:17,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:17,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:40:17,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:40:17,856 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:17,919 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-02-06 09:40:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:40:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 19 [2025-02-06 09:40:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:17,925 INFO L225 Difference]: With dead ends: 33 [2025-02-06 09:40:17,925 INFO L226 Difference]: Without dead ends: 29 [2025-02-06 09:40:17,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-02-06 09:40:17,928 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:17,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-06 09:40:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-06 09:40:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2025-02-06 09:40:17,951 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 19 [2025-02-06 09:40:17,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:17,951 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2025-02-06 09:40:17,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2025-02-06 09:40:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 09:40:17,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:17,953 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] [2025-02-06 09:40:17,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 09:40:18,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:18,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 444906724, now seen corresponding path program 1 times [2025-02-06 09:40:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269158366] [2025-02-06 09:40:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:18,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:18,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:18,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:40:18,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:40:18,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:40:18,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:18,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:18,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 09:40:18,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:18,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:18,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:18,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269158366] [2025-02-06 09:40:18,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269158366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:18,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:18,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27313955] [2025-02-06 09:40:18,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:18,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:18,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:18,268 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:18,277 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2025-02-06 09:40:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-02-06 09:40:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:18,279 INFO L225 Difference]: With dead ends: 29 [2025-02-06 09:40:18,279 INFO L226 Difference]: Without dead ends: 29 [2025-02-06 09:40:18,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:18,280 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:18,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-06 09:40:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-06 09:40:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-02-06 09:40:18,284 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 25 [2025-02-06 09:40:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:18,284 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-02-06 09:40:18,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2025-02-06 09:40:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 09:40:18,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:18,286 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] [2025-02-06 09:40:18,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:40:18,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:18,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1564330700, now seen corresponding path program 1 times [2025-02-06 09:40:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588381395] [2025-02-06 09:40:18,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:18,492 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-02-06 09:40:18,493 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-02-06 09:40:18,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 09:40:18,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 09:40:18,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:18,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:18,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:40:18,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:18,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:18,573 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:18,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588381395] [2025-02-06 09:40:18,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588381395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:18,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:18,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:18,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171628220] [2025-02-06 09:40:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:18,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:18,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:18,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:18,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:18,574 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:18,579 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2025-02-06 09:40:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-02-06 09:40:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:18,579 INFO L225 Difference]: With dead ends: 28 [2025-02-06 09:40:18,580 INFO L226 Difference]: Without dead ends: 28 [2025-02-06 09:40:18,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:18,580 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:18,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-06 09:40:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-06 09:40:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-02-06 09:40:18,588 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 25 [2025-02-06 09:40:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:18,588 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-02-06 09:40:18,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-02-06 09:40:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 09:40:18,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:18,590 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] [2025-02-06 09:40:18,599 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-02-06 09:40:18,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:18,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:18,797 INFO L85 PathProgramCache]: Analyzing trace with hash -411339388, now seen corresponding path program 1 times [2025-02-06 09:40:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227209368] [2025-02-06 09:40:18,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:18,799 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-02-06 09:40:18,801 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-02-06 09:40:18,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 09:40:18,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 09:40:18,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:18,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 09:40:18,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:19,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:19,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227209368] [2025-02-06 09:40:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227209368] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 09:40:19,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:40:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 09:40:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453923185] [2025-02-06 09:40:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:19,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:19,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:19,367 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:19,397 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2025-02-06 09:40:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:19,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2025-02-06 09:40:19,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:19,399 INFO L225 Difference]: With dead ends: 46 [2025-02-06 09:40:19,400 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 09:40:19,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:19,401 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:19,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 09:40:19,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-02-06 09:40:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-02-06 09:40:19,409 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 27 [2025-02-06 09:40:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-02-06 09:40:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:40:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-02-06 09:40:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 09:40:19,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:19,410 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] [2025-02-06 09:40:19,419 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-02-06 09:40:19,611 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 [2025-02-06 09:40:19,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:19,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1331470947, now seen corresponding path program 1 times [2025-02-06 09:40:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910139635] [2025-02-06 09:40:19,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:19,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:19,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:19,614 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-02-06 09:40:19,616 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-02-06 09:40:19,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 09:40:19,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 09:40:19,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:19,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:19,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 09:40:19,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 09:40:19,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:19,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:19,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910139635] [2025-02-06 09:40:19,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910139635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:19,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:19,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:40:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633856432] [2025-02-06 09:40:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:19,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:40:19,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:19,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:40:19,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:19,698 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:19,721 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2025-02-06 09:40:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:40:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-06 09:40:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:19,723 INFO L225 Difference]: With dead ends: 51 [2025-02-06 09:40:19,723 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 09:40:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:40:19,724 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:19,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 09:40:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-02-06 09:40:19,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2025-02-06 09:40:19,727 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 27 [2025-02-06 09:40:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:19,727 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2025-02-06 09:40:19,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2025-02-06 09:40:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 09:40:19,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:19,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:19,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 09:40:19,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:19,934 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:19,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1492125283, now seen corresponding path program 1 times [2025-02-06 09:40:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:19,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290846409] [2025-02-06 09:40:19,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:19,937 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:19,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 09:40:19,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 09:40:20,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 09:40:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:20,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:20,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:40:20,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 09:40:20,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:40:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-06 09:40:20,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:20,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290846409] [2025-02-06 09:40:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290846409] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:40:20,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 09:40:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-06 09:40:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448246424] [2025-02-06 09:40:20,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 09:40:20,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:40:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:20,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:40:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:20,053 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 09:40:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:20,086 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2025-02-06 09:40:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:20,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2025-02-06 09:40:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:20,087 INFO L225 Difference]: With dead ends: 59 [2025-02-06 09:40:20,089 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 09:40:20,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:40:20,090 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:20,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 09:40:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2025-02-06 09:40:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-02-06 09:40:20,097 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 33 [2025-02-06 09:40:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:20,098 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-02-06 09:40:20,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 09:40:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-02-06 09:40:20,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 09:40:20,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:20,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:20,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 09:40:20,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:20,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1146558941, now seen corresponding path program 1 times [2025-02-06 09:40:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057408945] [2025-02-06 09:40:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:40:20,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:20,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:20,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:20,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 09:40:20,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:20,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:20,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:40:20,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:40:20,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:40:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 09:40:20,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:40:20,509 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 09:40:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057408945] [2025-02-06 09:40:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057408945] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:40:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:40:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:40:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014453190] [2025-02-06 09:40:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:40:20,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:40:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 09:40:20,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:40:20,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:20,510 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:40:20,562 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2025-02-06 09:40:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:40:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-06 09:40:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:40:20,564 INFO L225 Difference]: With dead ends: 55 [2025-02-06 09:40:20,564 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 09:40:20,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:40:20,564 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:40:20,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:40:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 09:40:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 09:40:20,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-06 09:40:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-02-06 09:40:20,571 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 39 [2025-02-06 09:40:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:40:20,571 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-02-06 09:40:20,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 09:40:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-02-06 09:40:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 09:40:20,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:40:20,572 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:20,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 09:40:20,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:20,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:40:20,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:40:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1575070685, now seen corresponding path program 2 times [2025-02-06 09:40:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 09:40:20,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [596421579] [2025-02-06 09:40:20,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:40:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:40:20,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:40:20,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 09:40:20,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 09:40:20,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:20,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 09:40:20,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:20,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 09:40:20,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 09:40:20,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 09:40:20,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:40:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 09:40:20,915 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 09:40:20,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 09:40:20,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 1 remaining) [2025-02-06 09:40:20,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 09:40:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:40:21,121 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2025-02-06 09:40:21,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:40:21,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:40:21 BoogieIcfgContainer [2025-02-06 09:40:21,164 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:40:21,165 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:40:21,165 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:40:21,165 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:40:21,166 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:40:17" (3/4) ... [2025-02-06 09:40:21,167 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 09:40:21,168 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:40:21,169 INFO L158 Benchmark]: Toolchain (without parser) took 4341.55ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 58.3MB in the beginning and 73.1MB in the end (delta: -14.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-02-06 09:40:21,169 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:21,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.90ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 37.9MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:40:21,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 83.9MB. Free memory was 37.9MB in the beginning and 35.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:40:21,170 INFO L158 Benchmark]: Boogie Preprocessor took 42.04ms. Allocated memory is still 83.9MB. Free memory was 35.9MB in the beginning and 34.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:21,170 INFO L158 Benchmark]: IcfgBuilder took 319.33ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 56.1MB in the end (delta: -22.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2025-02-06 09:40:21,171 INFO L158 Benchmark]: TraceAbstraction took 3592.11ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 55.6MB in the beginning and 73.1MB in the end (delta: -17.6MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2025-02-06 09:40:21,171 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 8.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:40:21,172 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 83.9MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.90ms. Allocated memory is still 83.9MB. Free memory was 58.3MB in the beginning and 37.9MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 83.9MB. Free memory was 37.9MB in the beginning and 35.9MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.04ms. Allocated memory is still 83.9MB. Free memory was 35.9MB in the beginning and 34.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 319.33ms. Allocated memory is still 83.9MB. Free memory was 34.1MB in the beginning and 56.1MB in the end (delta: -22.0MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3592.11ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 55.6MB in the beginning and 73.1MB in the end (delta: -17.6MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 100.7MB. Free memory was 73.1MB in the beginning and 73.1MB in the end (delta: 8.4kB). 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 - UnprovableResult [Line: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; VAL [commands={6:0}, global={0:0}, state=0] [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={7:0}] [L709] global = x [L710] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, state=1] [L692] COND FALSE !(i < 2) [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L692] COND TRUE i < 2 [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=1, state=1] [L693] COND FALSE !(strcmp(commands[i].name,input) == 0) [L692] i++ VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=2, state=1] [L692] COND FALSE !(i < 2) [L724] RET parse_input("c2") VAL [commands={6:0}, global={7:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={7:0}, state=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 432 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 195 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=7, InterpolantAutomatonStates: 28, 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, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 2 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 130/144 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 could not prove your program: unable to determine feasibility of some traces [2025-02-06 09:40:21,185 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 Result: UNKNOWN: Overapproximated counterexample