./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/verifythis/tree_max.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 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/verifythis/tree_max.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:41:34,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:41:34,069 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:41:34,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:41:34,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:41:34,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:41:34,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:41:34,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:41:34,091 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:41:34,091 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:41:34,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:41:34,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:41:34,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:41:34,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:41:34,091 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:41:34,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:41:34,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:41:34,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:41:34,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:41:34,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:41:34,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:41:34,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:41:34,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:41:34,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:41:34,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:41:34,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:41:34,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:41:34,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:41:34,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:41:34,099 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e98a60ea9ee0c00575c08606ce8b95d0660c5b235c5932147dfee4b13512f57c [2025-02-06 09:41:34,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:41:34,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:41:34,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:41:34,407 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:41:34,408 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:41:34,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_max.c [2025-02-06 09:41:35,584 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a1ebdab/3f8d201eedbf42d89a515dfdabe23a27/FLAG4b0a110fa [2025-02-06 09:41:35,916 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:41:35,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_max.c [2025-02-06 09:41:35,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a1ebdab/3f8d201eedbf42d89a515dfdabe23a27/FLAG4b0a110fa [2025-02-06 09:41:35,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a1ebdab/3f8d201eedbf42d89a515dfdabe23a27 [2025-02-06 09:41:35,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:41:35,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:41:35,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:41:35,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:41:35,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:41:35,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:41:35" (1/1) ... [2025-02-06 09:41:35,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:35, skipping insertion in model container [2025-02-06 09:41:35,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:41:35" (1/1) ... [2025-02-06 09:41:35,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:41:36,057 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:41:36,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:41:36,075 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:41:36,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:41:36,104 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:41:36,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36 WrapperNode [2025-02-06 09:41:36,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:41:36,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:41:36,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:41:36,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:41:36,111 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:41:36" (1/1) ... [2025-02-06 09:41:36,119 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:41:36" (1/1) ... [2025-02-06 09:41:36,133 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 40 [2025-02-06 09:41:36,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:41:36,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:41:36,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:41:36,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:41:36,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,142 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,159 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-06 09:41:36,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:41:36,175 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:41:36,175 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:41:36,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:41:36,176 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (1/1) ... [2025-02-06 09:41:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:41:36,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:36,210 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:41:36,213 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:41:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:41:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:41:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:41:36,232 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-02-06 09:41:36,232 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-02-06 09:41:36,232 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-02-06 09:41:36,232 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-02-06 09:41:36,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:41:36,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure check [2025-02-06 09:41:36,233 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:41:36,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:41:36,289 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:41:36,291 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:41:36,350 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L38: havoc ~a~0, ~b~0, ~c~0; [2025-02-06 09:41:36,371 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: havoc ~n~0.base, ~n~0.offset; [2025-02-06 09:41:36,413 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-06 09:41:36,413 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:41:36,420 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:41:36,420 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:41:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:41:36 BoogieIcfgContainer [2025-02-06 09:41:36,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:41:36,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:41:36,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:41:36,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:41:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:41:35" (1/3) ... [2025-02-06 09:41:36,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c6902d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:41:36, skipping insertion in model container [2025-02-06 09:41:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:41:36" (2/3) ... [2025-02-06 09:41:36,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c6902d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:41:36, skipping insertion in model container [2025-02-06 09:41:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:41:36" (3/3) ... [2025-02-06 09:41:36,427 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_max.c [2025-02-06 09:41:36,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:41:36,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_max.c that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-06 09:41:36,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:41:36,495 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;@5d4a9ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:41:36,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:41:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 09:41:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 09:41:36,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:36,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:36,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:36,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:36,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1053845485, now seen corresponding path program 1 times [2025-02-06 09:41:36,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:36,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272719848] [2025-02-06 09:41:36,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:36,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:36,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 09:41:36,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 09:41:36,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:36,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272719848] [2025-02-06 09:41:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272719848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:41:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:41:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 09:41:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267821924] [2025-02-06 09:41:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:41:36,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:41:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:36,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:41:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:41:36,886 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 31 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:41:36,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:36,978 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2025-02-06 09:41:36,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 09:41:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-06 09:41:36,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:36,986 INFO L225 Difference]: With dead ends: 54 [2025-02-06 09:41:36,986 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 09:41:36,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:41:36,991 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:36,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:41:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 09:41:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2025-02-06 09:41:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2025-02-06 09:41:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2025-02-06 09:41:37,025 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 19 [2025-02-06 09:41:37,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:37,025 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2025-02-06 09:41:37,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 09:41:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2025-02-06 09:41:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 09:41:37,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:37,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:37,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:41:37,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash 867874381, now seen corresponding path program 1 times [2025-02-06 09:41:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488704297] [2025-02-06 09:41:37,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:37,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 09:41:37,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 09:41:37,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:37,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:41:37,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:37,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488704297] [2025-02-06 09:41:37,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488704297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:41:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:41:37,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:41:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398232988] [2025-02-06 09:41:37,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:41:37,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:41:37,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:37,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:41:37,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:41:37,099 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:41:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:37,193 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-06 09:41:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:41:37,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2025-02-06 09:41:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:37,197 INFO L225 Difference]: With dead ends: 53 [2025-02-06 09:41:37,197 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 09:41:37,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:41:37,198 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:37,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:41:37,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 09:41:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 09:41:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2025-02-06 09:41:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-02-06 09:41:37,208 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2025-02-06 09:41:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:37,209 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-02-06 09:41:37,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 09:41:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-02-06 09:41:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 09:41:37,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:37,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:37,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:41:37,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -573450985, now seen corresponding path program 1 times [2025-02-06 09:41:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580709522] [2025-02-06 09:41:37,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:37,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 09:41:37,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 09:41:37,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:37,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:37,431 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:41:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:37,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580709522] [2025-02-06 09:41:37,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580709522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:41:37,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:41:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:41:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444570334] [2025-02-06 09:41:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:41:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:41:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:41:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:41:37,433 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 09:41:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:37,488 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-02-06 09:41:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 09:41:37,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-02-06 09:41:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:37,489 INFO L225 Difference]: With dead ends: 45 [2025-02-06 09:41:37,489 INFO L226 Difference]: Without dead ends: 45 [2025-02-06 09:41:37,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:41:37,490 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:37,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:41:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-06 09:41:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-06 09:41:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 32 states have internal predecessors, (36), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-02-06 09:41:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2025-02-06 09:41:37,496 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 31 [2025-02-06 09:41:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:37,497 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2025-02-06 09:41:37,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 09:41:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2025-02-06 09:41:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 09:41:37,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:37,498 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:37,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:41:37,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:37,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -675231019, now seen corresponding path program 1 times [2025-02-06 09:41:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:37,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267636176] [2025-02-06 09:41:37,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:37,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:41:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:41:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-06 09:41:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267636176] [2025-02-06 09:41:38,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267636176] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:41:38,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142490305] [2025-02-06 09:41:38,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:38,219 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:41:38,221 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:41:38,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 09:41:38,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 09:41:38,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:38,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:38,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 09:41:38,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:38,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 09:41:38,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 09:41:38,601 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 09:41:38,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 09:41:38,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142490305] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:38,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 10] total 23 [2025-02-06 09:41:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659895994] [2025-02-06 09:41:38,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:38,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:41:38,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:38,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:41:38,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:41:38,883 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 09:41:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:39,329 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2025-02-06 09:41:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 09:41:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) Word has length 44 [2025-02-06 09:41:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:39,331 INFO L225 Difference]: With dead ends: 56 [2025-02-06 09:41:39,332 INFO L226 Difference]: Without dead ends: 56 [2025-02-06 09:41:39,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2025-02-06 09:41:39,334 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:39,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 200 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 09:41:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-06 09:41:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-02-06 09:41:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 40 states have internal predecessors, (46), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-06 09:41:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2025-02-06 09:41:39,344 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 44 [2025-02-06 09:41:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:39,345 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions. [2025-02-06 09:41:39,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.1) internal successors, (42), 18 states have internal predecessors, (42), 8 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 8 states have call predecessors, (14), 6 states have call successors, (14) [2025-02-06 09:41:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions. [2025-02-06 09:41:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 09:41:39,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:39,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:39,354 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:41:39,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:39,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:39,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash -355843953, now seen corresponding path program 1 times [2025-02-06 09:41:39,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:39,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256573684] [2025-02-06 09:41:39,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:39,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:41:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:41:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 09:41:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256573684] [2025-02-06 09:41:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256573684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:41:39,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:41:39,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 09:41:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798686960] [2025-02-06 09:41:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:41:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 09:41:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:39,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 09:41:39,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:41:39,658 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 09:41:39,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:41:39,707 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2025-02-06 09:41:39,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 09:41:39,707 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2025-02-06 09:41:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:41:39,708 INFO L225 Difference]: With dead ends: 60 [2025-02-06 09:41:39,712 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 09:41:39,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 09:41:39,713 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 09:41:39,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 09:41:39,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 09:41:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2025-02-06 09:41:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 11 states have call successors, (11), 4 states have call predecessors, (11), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-06 09:41:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-02-06 09:41:39,720 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 46 [2025-02-06 09:41:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:41:39,720 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-02-06 09:41:39,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 09:41:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-02-06 09:41:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 09:41:39,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:41:39,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:41:39,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:41:39,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting checkErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:41:39,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:41:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1360114033, now seen corresponding path program 1 times [2025-02-06 09:41:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:41:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185441041] [2025-02-06 09:41:39,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:41:39,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:41:39,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:41:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 09:41:40,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:41:40,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185441041] [2025-02-06 09:41:40,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185441041] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:41:40,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660160499] [2025-02-06 09:41:40,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:41:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:41:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:41:40,411 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:41:40,414 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:41:40,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:41:40,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:41:40,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:41:40,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:41:40,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-02-06 09:41:40,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:41:40,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 09:41:40,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 09:41:40,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 09:41:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:41:41,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:41:41,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-06 09:41:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 09:41:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660160499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:41:41,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:41:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 47 [2025-02-06 09:41:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964300866] [2025-02-06 09:41:41,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:41:41,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 09:41:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:41:41,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 09:41:41,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1996, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 09:41:41,847 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 47 states, 40 states have (on average 2.025) internal successors, (81), 37 states have internal predecessors, (81), 16 states have call successors, (19), 9 states have call predecessors, (19), 14 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2025-02-06 09:41:48,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:41:52,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:41:56,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:42:00,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:42:04,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:42:32,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:42:36,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:42:40,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:43:08,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:43:12,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:43:16,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 09:43:20,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]