./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/du-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:39,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:39,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:24:39,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:39,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:39,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:39,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:39,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:39,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:39,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:39,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:39,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:39,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:39,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:39,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:39,984 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:39,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:39,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:39,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:39,985 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 [2025-02-08 13:24:40,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:40,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:40,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:40,201 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:40,202 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:40,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-02-08 13:24:41,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8543bac6e/3f3ea62624074e5d8269eddf189eddc6/FLAG4cd6f8787 [2025-02-08 13:24:41,742 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:41,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-02-08 13:24:41,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8543bac6e/3f3ea62624074e5d8269eddf189eddc6/FLAG4cd6f8787 [2025-02-08 13:24:41,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8543bac6e/3f3ea62624074e5d8269eddf189eddc6 [2025-02-08 13:24:41,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:41,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:41,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:41,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:41,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:41,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bda6925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:41, skipping insertion in model container [2025-02-08 13:24:41,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:41" (1/1) ... [2025-02-08 13:24:41,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:42,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:42,927 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:43,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:43,351 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:43,364 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:43,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43 WrapperNode [2025-02-08 13:24:43,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:43,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:43,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:43,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:43,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,746 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11035 [2025-02-08 13:24:43,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:43,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:43,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:43,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:43,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,826 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:24:43,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:43,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:44,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:44,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:44,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:44,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:44,207 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:44,207 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:44,207 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:44,208 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (1/1) ... [2025-02-08 13:24:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:44,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:24:44,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:24:44,260 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-08 13:24:44,260 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-08 13:24:44,260 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-02-08 13:24:44,260 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-02-08 13:24:44,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:44,260 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-02-08 13:24:44,260 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-02-08 13:24:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-02-08 13:24:44,261 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-02-08 13:24:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:24:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:24:44,261 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:24:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:24:44,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:24:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:24:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:24:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-02-08 13:24:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-02-08 13:24:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:24:44,264 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:24:44,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:24:44,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:44,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:45,052 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: assume 46 == concat_subpath_file_#t~mem84#1;havoc concat_subpath_file_#t~mem84#1;call concat_subpath_file_#t~mem85#1 := read~int(concat_subpath_file_~f#1.base, 1 + concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: assume !(46 == concat_subpath_file_#t~mem84#1);havoc concat_subpath_file_#t~mem84#1; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3479: warn_opendir_#t~ret278#1.base, warn_opendir_#t~ret278#1.offset := opendir_#res#1.base, opendir_#res#1.offset;havoc opendir_#t~mem309#1, opendir_#t~nondet310#1, opendir_#t~nondet311#1, opendir_#t~mem312#1, opendir_~name#1.base, opendir_~name#1.offset;havoc opendir_#in~name#1.base, opendir_#in~name#1.offset;assume { :end_inline_opendir } true;warn_opendir_~dp~0#1.base, warn_opendir_~dp~0#1.offset := warn_opendir_#t~ret278#1.base, warn_opendir_#t~ret278#1.offset;havoc warn_opendir_#t~ret278#1.base, warn_opendir_#t~ret278#1.offset; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835: assume ~entry~0#1.base == 0 && ~entry~0#1.offset == 0; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835: assume !(~entry~0#1.base == 0 && ~entry~0#1.offset == 0);assume { :begin_inline_concat_subpath_file } true;concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset, concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset := ~filename#1.base, ~filename#1.offset, ~entry~0#1.base, 19 + ~entry~0#1.offset;havoc concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset;havoc concat_subpath_file_#t~mem84#1, concat_subpath_file_#t~mem85#1, concat_subpath_file_#t~mem86#1, concat_subpath_file_#t~mem87#1, concat_subpath_file_#t~ret88#1.base, concat_subpath_file_#t~ret88#1.offset, concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, concat_subpath_file_~tmp_if_expr$2~2#1, concat_subpath_file_~tmp_if_expr$1~0#1, concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset := concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset;concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset := concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset;havoc concat_subpath_file_~tmp_if_expr$2~2#1;havoc concat_subpath_file_~tmp_if_expr$1~0#1; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc add_to_ino_dev_hashtable_~return_value_strlen$1~0#1;add_to_ino_dev_hashtable_~return_value_strlen$1~0#1 := add_to_ino_dev_hashtable_#t~nondet38#1;havoc add_to_ino_dev_hashtable_#t~nondet38#1;havoc add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.base, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.offset; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: concat_subpath_file_#t~ret88#1.base, concat_subpath_file_#t~ret88#1.offset := concat_path_file_#res#1.base, concat_path_file_#res#1.offset;havoc concat_path_file_#t~ret80#1.base, concat_path_file_#t~ret80#1.offset, concat_path_file_#t~mem81#1, concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset, concat_path_file_#t~ret83#1.base, concat_path_file_#t~ret83#1.offset, concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset, concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;havoc concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset, concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset;assume { :end_inline_concat_path_file } true;concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset := concat_subpath_file_#t~ret88#1.base, concat_subpath_file_#t~ret88#1.offset;havoc concat_subpath_file_#t~ret88#1.base, concat_subpath_file_#t~ret88#1.offset;concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset := concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2827: assume ~dir~0#1.base == 0 && ~dir~0#1.offset == 0;call write~int(1, ~#bb_common_bufsiz1~0.base, 12 + ~#bb_common_bufsiz1~0.offset, 1);#res#1 := ~sum~0#1;call ULTIMATE.dealloc(~#statbuf~0#1.base, ~#statbuf~0#1.offset);havoc ~#statbuf~0#1.base, ~#statbuf~0#1.offset; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2827: assume !(~dir~0#1.base == 0 && ~dir~0#1.offset == 0); [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: assume #t~mem113#1 - 1 <= 2147483647;call write~int(#t~mem113#1 - 1, ~#bb_common_bufsiz1~0.base, 17 + ~#bb_common_bufsiz1~0.offset, 4);havoc #t~mem113#1;call ULTIMATE.dealloc(~newfile~0#1.base, ~newfile~0#1.offset);havoc ~return_value_du$4~0#1; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: assume !(#t~mem113#1 - 1 <= 2147483647); [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume ~ino_dev_hashtable~0.base == 0 && ~ino_dev_hashtable~0.offset == 0; [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: assume !(~ino_dev_hashtable~0.base == 0 && ~ino_dev_hashtable~0.offset == 0); [2025-02-08 13:24:45,053 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: assume #t~mem113#1 - 1 >= -2147483648; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: assume !(#t~mem113#1 - 1 >= -2147483648); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480: assume warn_opendir_~dp~0#1.base == 0 && warn_opendir_~dp~0#1.offset == 0;call warn_opendir_#t~varargs279#1.base, warn_opendir_#t~varargs279#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(warn_opendir_~path#1.base, warn_opendir_~path#1.offset, warn_opendir_#t~varargs279#1.base, warn_opendir_#t~varargs279#1.offset, 8); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480: assume !(warn_opendir_~dp~0#1.base == 0 && warn_opendir_~dp~0#1.offset == 0); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3381-1: last_char_is_#res#1.base, last_char_is_#res#1.offset := 0, 0; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: assume concat_path_file_~path#1.base == 0 && concat_path_file_~path#1.offset == 0;concat_path_file_~path#1.base, concat_path_file_~path#1.offset := 8, 0; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: assume !(concat_path_file_~path#1.base == 0 && concat_path_file_~path#1.offset == 0); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: assume 0 != readdir_#t~nondet313#1;havoc readdir_#t~nondet313#1;readdir_#res#1.base, readdir_#res#1.offset := 0, 0; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: assume !(0 != readdir_#t~nondet313#1);havoc readdir_#t~nondet313#1;havoc readdir_#t~nondet314#1;assume -2147483648 <= readdir_#t~nondet314#1 && readdir_#t~nondet314#1 <= 2147483647; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: concat_subpath_file_~tmp_if_expr$2~2#1 := (if 0 == (if 0 != (if 0 != concat_subpath_file_~tmp_if_expr$1~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: assume 0 == concat_subpath_file_#t~mem85#1;havoc concat_subpath_file_#t~mem85#1;concat_subpath_file_~tmp_if_expr$2~2#1 := 1; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: assume !(0 == concat_subpath_file_#t~mem85#1);havoc concat_subpath_file_#t~mem85#1;call concat_subpath_file_#t~mem86#1 := read~int(concat_subpath_file_~f#1.base, 1 + concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3481: SUMMARY for call bb_perror_msg(21, 0, warn_opendir_#t~varargs279#1.base, warn_opendir_#t~varargs279#1.offset); srcloc: null [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2837: #t~ret110#1.base, #t~ret110#1.offset := concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset;havoc concat_subpath_file_#t~mem84#1, concat_subpath_file_#t~mem85#1, concat_subpath_file_#t~mem86#1, concat_subpath_file_#t~mem87#1, concat_subpath_file_#t~ret88#1.base, concat_subpath_file_#t~ret88#1.offset, concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, concat_subpath_file_~tmp_if_expr$2~2#1, concat_subpath_file_~tmp_if_expr$1~0#1, concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;havoc concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset, concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset;assume { :end_inline_concat_subpath_file } true;~newfile~0#1.base, ~newfile~0#1.offset := #t~ret110#1.base, #t~ret110#1.offset;havoc #t~ret110#1.base, #t~ret110#1.offset; [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: assume -2147483648 <= xasprintf_#t~ret280#1 && xasprintf_#t~ret280#1 <= 2147483647;xasprintf_~r~0#1 := xasprintf_#t~ret280#1;havoc xasprintf_#t~ret280#1;call ULTIMATE.dealloc(xasprintf_~p~4#1.base, 0); [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490-1: SUMMARY for call xasprintf_#t~ret280#1 := vasprintf(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset); srcloc: null [2025-02-08 13:24:45,054 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590: add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.base, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.offset := add_to_ino_dev_hashtable_#t~ret43#1.base, add_to_ino_dev_hashtable_#t~ret43#1.offset;havoc add_to_ino_dev_hashtable_#t~ret43#1.base, add_to_ino_dev_hashtable_#t~ret43#1.offset;~ino_dev_hashtable~0.base, ~ino_dev_hashtable~0.offset := add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.base, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.offset; [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590-1: SUMMARY for call add_to_ino_dev_hashtable_#t~ret43#1.base, add_to_ino_dev_hashtable_#t~ret43#1.offset := xzalloc(2488); srcloc: null [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3482-1: warn_opendir_#res#1.base, warn_opendir_#res#1.offset := warn_opendir_~dp~0#1.base, warn_opendir_~dp~0#1.offset; [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: assume 0 != closedir_#t~nondet306#1;havoc closedir_#t~nondet306#1;havoc closedir_#t~nondet307#1;assume -2147483648 <= closedir_#t~nondet307#1 && closedir_#t~nondet307#1 <= 2147483647;call write~int(closedir_#t~nondet307#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc closedir_#t~nondet307#1;call closedir_#t~mem308#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3606: assume !(0 != closedir_#t~nondet306#1);havoc closedir_#t~nondet306#1;closedir_#res#1 := 0; [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2838: assume !(~newfile~0#1.base == 0 && ~newfile~0#1.offset == 0);call #t~mem111#1 := read~int(~#bb_common_bufsiz1~0.base, 17 + ~#bb_common_bufsiz1~0.offset, 4); [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2838: assume !!(~newfile~0#1.base == 0 && ~newfile~0#1.offset == 0); [2025-02-08 13:24:45,055 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582: add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.base, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.offset := add_to_ino_dev_hashtable_#t~ret39#1.base, add_to_ino_dev_hashtable_#t~ret39#1.offset;havoc add_to_ino_dev_hashtable_#t~ret39#1.base, add_to_ino_dev_hashtable_#t~ret39#1.offset;add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset := add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.base, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.offset;call add_to_ino_dev_hashtable_#t~mem40#1 := read~int(add_to_ino_dev_hashtable_~statbuf#1.base, 8 + add_to_ino_dev_hashtable_~statbuf#1.offset, 8);call write~int(add_to_ino_dev_hashtable_#t~mem40#1, add_to_ino_dev_hashtable_~bucket~0#1.base, 8 + add_to_ino_dev_hashtable_~bucket~0#1.offset, 8);havoc add_to_ino_dev_hashtable_#t~mem40#1;call add_to_ino_dev_hashtable_#t~mem41#1 := read~int(add_to_ino_dev_hashtable_~statbuf#1.base, add_to_ino_dev_hashtable_~statbuf#1.offset, 8);call write~int(add_to_ino_dev_hashtable_#t~mem41#1, add_to_ino_dev_hashtable_~bucket~0#1.base, 16 + add_to_ino_dev_hashtable_~bucket~0#1.offset, 8);havoc add_to_ino_dev_hashtable_#t~mem41#1; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582-1: SUMMARY for call add_to_ino_dev_hashtable_#t~ret39#1.base, add_to_ino_dev_hashtable_#t~ret39#1.offset := xmalloc(25 + add_to_ino_dev_hashtable_~return_value_strlen$1~0#1); srcloc: null [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: assume { :begin_inline_last_char_is } true;last_char_is_#in~s#1.base, last_char_is_#in~s#1.offset, last_char_is_#in~c#1 := concat_path_file_~path#1.base, concat_path_file_~path#1.offset, 47;havoc last_char_is_#res#1.base, last_char_is_#res#1.offset;havoc last_char_is_#t~mem257#1, last_char_is_#t~nondet258#1, last_char_is_#t~mem259#1, last_char_is_~sz~0#1, last_char_is_~return_value_strlen$1~2#1, last_char_is_~s#1.base, last_char_is_~s#1.offset, last_char_is_~c#1;last_char_is_~s#1.base, last_char_is_~s#1.offset := last_char_is_#in~s#1.base, last_char_is_#in~s#1.offset;last_char_is_~c#1 := last_char_is_#in~c#1; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: concat_path_file_#t~ret80#1.base, concat_path_file_#t~ret80#1.offset := last_char_is_#res#1.base, last_char_is_#res#1.offset;havoc last_char_is_#t~mem257#1, last_char_is_#t~nondet258#1, last_char_is_#t~mem259#1, last_char_is_~sz~0#1, last_char_is_~return_value_strlen$1~2#1, last_char_is_~s#1.base, last_char_is_~s#1.offset, last_char_is_~c#1;havoc last_char_is_#in~s#1.base, last_char_is_#in~s#1.offset, last_char_is_#in~c#1;assume { :end_inline_last_char_is } true;concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset := concat_path_file_#t~ret80#1.base, concat_path_file_#t~ret80#1.offset;havoc concat_path_file_#t~ret80#1.base, concat_path_file_#t~ret80#1.offset; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: assume !(0 == concat_subpath_file_~tmp_if_expr$2~2#1 % 256);concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset := 0, 0; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2764: assume !!(0 == concat_subpath_file_~tmp_if_expr$2~2#1 % 256); [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3640: havoc readdir_#t~mem320#1;readdir_~i~3#1 := 0; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3640-1: SUMMARY for call assume_abort_if_not((if (if readdir_#t~mem320#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem320#1 % 65536 % 4294967296 else readdir_#t~mem320#1 % 65536 % 4294967296 - 4294967296) % 18446744073709551616 < 255 then 1 else 0)); srcloc: null [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: assume true;call concat_path_file_#t~mem81#1 := read~int(concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, 1); [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: assume !true; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740-2: assume !(47 == concat_path_file_#t~mem81#1);havoc concat_path_file_#t~mem81#1; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740-2: assume 47 == concat_path_file_#t~mem81#1;havoc concat_path_file_#t~mem81#1;concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset := concat_path_file_~filename#1.base, 1 + concat_path_file_~filename#1.offset; [2025-02-08 13:24:45,056 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3632: assume 0 != readdir_#t~nondet314#1;havoc readdir_#t~nondet314#1;havoc readdir_#t~nondet315#1;assume -2147483648 <= readdir_#t~nondet315#1 && readdir_#t~nondet315#1 <= 2147483647;call write~int(readdir_#t~nondet315#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc readdir_#t~nondet315#1;call readdir_#t~mem316#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3632: assume !(0 != readdir_#t~nondet314#1);havoc readdir_#t~nondet314#1;havoc readdir_#t~nondet317#1;assume -9223372036854775808 <= readdir_#t~nondet317#1 && readdir_#t~nondet317#1 <= 9223372036854775807;call write~int(readdir_#t~nondet317#1, ~#ret~0.base, ~#ret~0.offset, 8);havoc readdir_#t~nondet317#1;havoc readdir_#t~nondet318#1;assume -9223372036854775808 <= readdir_#t~nondet318#1 && readdir_#t~nondet318#1 <= 9223372036854775807;call write~int(readdir_#t~nondet318#1, ~#ret~0.base, 8 + ~#ret~0.offset, 8);havoc readdir_#t~nondet318#1;havoc readdir_#t~nondet319#1;assume -32768 <= readdir_#t~nondet319#1 && readdir_#t~nondet319#1 <= 32767;call write~int(readdir_#t~nondet319#1, ~#ret~0.base, 16 + ~#ret~0.offset, 2);havoc readdir_#t~nondet319#1;call readdir_#t~mem320#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3368: assume !(last_char_is_~s#1.base == 0 && last_char_is_~s#1.offset == 0);call last_char_is_#t~mem257#1 := read~int(last_char_is_~s#1.base, last_char_is_~s#1.offset, 1); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3368: assume !!(last_char_is_~s#1.base == 0 && last_char_is_~s#1.offset == 0); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3492: assume xasprintf_~r~0#1 < 0;call xasprintf_#t~varargs281#1.base, xasprintf_#t~varargs281#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3492: assume !(xasprintf_~r~0#1 < 0); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3682: havoc lstat_#t~ret345#1; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2815: #t~ret105#1.base, #t~ret105#1.offset := is_in_ino_dev_hashtable_#res#1.base, is_in_ino_dev_hashtable_#res#1.offset;havoc is_in_ino_dev_hashtable_#t~mem250#1, is_in_ino_dev_hashtable_#t~mem251#1.base, is_in_ino_dev_hashtable_#t~mem251#1.offset, is_in_ino_dev_hashtable_#t~mem252#1, is_in_ino_dev_hashtable_#t~mem253#1, is_in_ino_dev_hashtable_#t~mem254#1, is_in_ino_dev_hashtable_#t~mem255#1, is_in_ino_dev_hashtable_#t~mem256#1.base, is_in_ino_dev_hashtable_#t~mem256#1.offset, is_in_ino_dev_hashtable_~statbuf#1.base, is_in_ino_dev_hashtable_~statbuf#1.offset, is_in_ino_dev_hashtable_~bucket~1#1.base, is_in_ino_dev_hashtable_~bucket~1#1.offset;havoc is_in_ino_dev_hashtable_#in~statbuf#1.base, is_in_ino_dev_hashtable_#in~statbuf#1.offset;assume { :end_inline_is_in_ino_dev_hashtable } true;~return_value_is_in_ino_dev_hashtable$3~0#1.base, ~return_value_is_in_ino_dev_hashtable$3~0#1.offset := #t~ret105#1.base, #t~ret105#1.offset;havoc #t~ret105#1.base, #t~ret105#1.offset; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608: havoc closedir_#t~mem308#1;closedir_#res#1 := -1; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: assume 1 + #t~mem111#1 <= 2147483647;call write~int(1 + #t~mem111#1, ~#bb_common_bufsiz1~0.base, 17 + ~#bb_common_bufsiz1~0.offset, 4);havoc #t~mem111#1;havoc ~return_value_du$4~0#1; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: assume !(1 + #t~mem111#1 <= 2147483647); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-1: assume true;call readdir_#t~mem321#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2); [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-1: assume !true; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641: havoc readdir_~i~3#1;call readdir_#t~mem324#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2);call write~int(0, ~#ret~0.base, 19 + ~#ret~0.offset + (if readdir_#t~mem324#1 % 65536 % 18446744073709551616 <= 9223372036854775807 then readdir_#t~mem324#1 % 65536 % 18446744073709551616 else readdir_#t~mem324#1 % 65536 % 18446744073709551616 - 18446744073709551616), 1);havoc readdir_#t~mem324#1;readdir_#res#1.base, readdir_#res#1.offset := ~#ret~0.base, ~#ret~0.offset; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774: call ULTIMATE.dealloc(~#statbuf~0#1.base, ~#statbuf~0#1.offset);havoc ~#statbuf~0#1.base, ~#statbuf~0#1.offset; [2025-02-08 13:24:45,057 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-3: assume 1 + readdir_~i~3#1 >= -2147483648; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-3: assume !(1 + readdir_~i~3#1 >= -2147483648); [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3608-1: SUMMARY for call assume_abort_if_not((if 0 != closedir_#t~mem308#1 then 1 else 0)); srcloc: null [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840-1: assume 1 + #t~mem111#1 >= -2147483648; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840-1: assume !(1 + #t~mem111#1 >= -2147483648); [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-2: assume 1 + readdir_~i~3#1 <= 2147483647;readdir_#t~pre323#1 := 1 + readdir_~i~3#1;readdir_~i~3#1 := 1 + readdir_~i~3#1;havoc readdir_#t~pre323#1; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-2: assume !(1 + readdir_~i~3#1 <= 2147483647); [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-4: assume !(readdir_~i~3#1 < (if readdir_#t~mem321#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem321#1 % 65536 % 4294967296 else readdir_#t~mem321#1 % 65536 % 4294967296 - 4294967296));havoc readdir_#t~mem321#1; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3641-4: assume readdir_~i~3#1 < (if readdir_#t~mem321#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem321#1 % 65536 % 4294967296 else readdir_#t~mem321#1 % 65536 % 4294967296 - 4294967296);havoc readdir_#t~mem321#1;havoc readdir_#t~nondet322#1;assume -128 <= readdir_#t~nondet322#1 && readdir_#t~nondet322#1 <= 127;call write~int(readdir_#t~nondet322#1, ~#ret~0.base, 19 + ~#ret~0.offset + readdir_~i~3#1, 1); [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832: assume true;assume { :begin_inline_readdir } true;readdir_#in~d#1.base, readdir_#in~d#1.offset := ~dir~0#1.base, ~dir~0#1.offset;havoc readdir_#res#1.base, readdir_#res#1.offset;havoc readdir_#t~nondet313#1, readdir_#t~nondet314#1, readdir_#t~nondet315#1, readdir_#t~mem316#1, readdir_#t~nondet317#1, readdir_#t~nondet318#1, readdir_#t~nondet319#1, readdir_#t~mem320#1, readdir_#t~mem321#1, readdir_#t~nondet322#1, readdir_#t~pre323#1, readdir_~i~3#1, readdir_#t~mem324#1, readdir_~d#1.base, readdir_~d#1.offset;readdir_~d#1.base, readdir_~d#1.offset := readdir_#in~d#1.base, readdir_#in~d#1.offset;havoc readdir_#t~nondet313#1;assume -2147483648 <= readdir_#t~nondet313#1 && readdir_#t~nondet313#1 <= 2147483647; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832: assume !true; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377: assume last_char_is_#t~mem259#1 == last_char_is_~c#1;havoc last_char_is_#t~mem259#1;last_char_is_#res#1.base, last_char_is_#res#1.offset := last_char_is_~s#1.base, last_char_is_~s#1.offset; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377: assume !(last_char_is_#t~mem259#1 == last_char_is_~c#1);havoc last_char_is_#t~mem259#1;havoc last_char_is_~sz~0#1, last_char_is_~return_value_strlen$1~2#1; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832-1: assume true; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832-1: assume !true; [2025-02-08 13:24:45,058 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2758: assume 46 == concat_subpath_file_#t~mem86#1;havoc concat_subpath_file_#t~mem86#1;call concat_subpath_file_#t~mem87#1 := read~int(concat_subpath_file_~f#1.base, 2 + concat_subpath_file_~f#1.offset, 1);concat_subpath_file_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if !(0 != concat_subpath_file_#t~mem87#1) then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2758: assume !(46 == concat_subpath_file_#t~mem86#1);havoc concat_subpath_file_#t~mem86#1;concat_subpath_file_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: SUMMARY for call bb_error_msg_and_die(~#bb_msg_memory_exhausted~0.base, ~#bb_msg_memory_exhausted~0.offset, xasprintf_#t~varargs281#1.base, xasprintf_#t~varargs281#1.offset); srcloc: null [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849-1: assume { :begin_inline_closedir } true;closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset := ~dir~0#1.base, ~dir~0#1.offset;havoc closedir_#res#1;havoc closedir_#t~nondet306#1, closedir_#t~nondet307#1, closedir_#t~mem308#1, closedir_~dirp#1.base, closedir_~dirp#1.offset;closedir_~dirp#1.base, closedir_~dirp#1.offset := closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset;havoc closedir_#t~nondet306#1;assume -2147483648 <= closedir_#t~nondet306#1 && closedir_#t~nondet306#1 <= 2147483647; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2816: assume !(~return_value_is_in_ino_dev_hashtable$3~0#1.base == 0 && ~return_value_is_in_ino_dev_hashtable$3~0#1.offset == 0);#res#1 := 0;call ULTIMATE.dealloc(~#statbuf~0#1.base, ~#statbuf~0#1.offset);havoc ~#statbuf~0#1.base, ~#statbuf~0#1.offset; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2816: assume !!(~return_value_is_in_ino_dev_hashtable$3~0#1.base == 0 && ~return_value_is_in_ino_dev_hashtable$3~0#1.offset == 0);assume { :begin_inline_add_to_ino_dev_hashtable } true;add_to_ino_dev_hashtable_#in~statbuf#1.base, add_to_ino_dev_hashtable_#in~statbuf#1.offset, add_to_ino_dev_hashtable_#in~name#1.base, add_to_ino_dev_hashtable_#in~name#1.offset := ~#statbuf~0#1.base, ~#statbuf~0#1.offset, 0, 0;havoc add_to_ino_dev_hashtable_#t~mem37#1, add_to_ino_dev_hashtable_#t~nondet38#1, add_to_ino_dev_hashtable_#t~ret39#1.base, add_to_ino_dev_hashtable_#t~ret39#1.offset, add_to_ino_dev_hashtable_#t~mem40#1, add_to_ino_dev_hashtable_#t~mem41#1, add_to_ino_dev_hashtable_#t~strcpy~res42#1.base, add_to_ino_dev_hashtable_#t~strcpy~res42#1.offset, add_to_ino_dev_hashtable_#t~ret43#1.base, add_to_ino_dev_hashtable_#t~ret43#1.offset, add_to_ino_dev_hashtable_#t~mem44#1.base, add_to_ino_dev_hashtable_#t~mem44#1.offset, add_to_ino_dev_hashtable_~statbuf#1.base, add_to_ino_dev_hashtable_~statbuf#1.offset, add_to_ino_dev_hashtable_~name#1.base, add_to_ino_dev_hashtable_~name#1.offset, add_to_ino_dev_hashtable_~i~0#1, add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset, add_to_ino_dev_hashtable_~return_value_strlen$1~0#1, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.base, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.offset, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.base, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.offset;add_to_ino_dev_hashtable_~statbuf#1.base, add_to_ino_dev_hashtable_~statbuf#1.offset := add_to_ino_dev_hashtable_#in~statbuf#1.base, add_to_ino_dev_hashtable_#in~statbuf#1.offset;add_to_ino_dev_hashtable_~name#1.base, add_to_ino_dev_hashtable_~name#1.offset := add_to_ino_dev_hashtable_#in~name#1.base, add_to_ino_dev_hashtable_#in~name#1.offset;havoc add_to_ino_dev_hashtable_~i~0#1;havoc add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset;call add_to_ino_dev_hashtable_#t~mem37#1 := read~int(add_to_ino_dev_hashtable_~statbuf#1.base, 8 + add_to_ino_dev_hashtable_~statbuf#1.offset, 8);add_to_ino_dev_hashtable_~i~0#1 := (if add_to_ino_dev_hashtable_#t~mem37#1 % 18446744073709551616 % 311 % 18446744073709551616 % 4294967296 <= 2147483647 then add_to_ino_dev_hashtable_#t~mem37#1 % 18446744073709551616 % 311 % 18446744073709551616 % 4294967296 else add_to_ino_dev_hashtable_#t~mem37#1 % 18446744073709551616 % 311 % 18446744073709551616 % 4294967296 - 4294967296);havoc add_to_ino_dev_hashtable_#t~mem37#1; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849: #t~ret114#1 := closedir_#res#1;havoc closedir_#t~nondet306#1, closedir_#t~nondet307#1, closedir_#t~mem308#1, closedir_~dirp#1.base, closedir_~dirp#1.offset;havoc closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset;assume { :end_inline_closedir } true;assume -2147483648 <= #t~ret114#1 && #t~ret114#1 <= 2147483647;havoc ~dir~0#1.base, ~dir~0#1.offset, ~entry~0#1.base, ~entry~0#1.offset, ~newfile~0#1.base, ~newfile~0#1.offset;havoc #t~ret114#1; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2593: call add_to_ino_dev_hashtable_#t~mem44#1.base, add_to_ino_dev_hashtable_#t~mem44#1.offset := read~$Pointer$(~ino_dev_hashtable~0.base, ~ino_dev_hashtable~0.offset + 8 * add_to_ino_dev_hashtable_~i~0#1, 8);call write~$Pointer$(add_to_ino_dev_hashtable_#t~mem44#1.base, add_to_ino_dev_hashtable_#t~mem44#1.offset, add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset, 8);havoc add_to_ino_dev_hashtable_#t~mem44#1.base, add_to_ino_dev_hashtable_#t~mem44#1.offset;call write~$Pointer$(add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset, ~ino_dev_hashtable~0.base, ~ino_dev_hashtable~0.offset + 8 * add_to_ino_dev_hashtable_~i~0#1, 8);havoc add_to_ino_dev_hashtable_#t~mem37#1, add_to_ino_dev_hashtable_#t~nondet38#1, add_to_ino_dev_hashtable_#t~ret39#1.base, add_to_ino_dev_hashtable_#t~ret39#1.offset, add_to_ino_dev_hashtable_#t~mem40#1, add_to_ino_dev_hashtable_#t~mem41#1, add_to_ino_dev_hashtable_#t~strcpy~res42#1.base, add_to_ino_dev_hashtable_#t~strcpy~res42#1.offset, add_to_ino_dev_hashtable_#t~ret43#1.base, add_to_ino_dev_hashtable_#t~ret43#1.offset, add_to_ino_dev_hashtable_#t~mem44#1.base, add_to_ino_dev_hashtable_#t~mem44#1.offset, add_to_ino_dev_hashtable_~statbuf#1.base, add_to_ino_dev_hashtable_~statbuf#1.offset, add_to_ino_dev_hashtable_~name#1.base, add_to_ino_dev_hashtable_~name#1.offset, add_to_ino_dev_hashtable_~i~0#1, add_to_ino_dev_hashtable_~bucket~0#1.base, add_to_ino_dev_hashtable_~bucket~0#1.offset, add_to_ino_dev_hashtable_~return_value_strlen$1~0#1, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.base, add_to_ino_dev_hashtable_~return_value_xmalloc$2~0#1.offset, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.base, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.offset;havoc add_to_ino_dev_hashtable_#in~statbuf#1.base, add_to_ino_dev_hashtable_#in~statbuf#1.offset, add_to_ino_dev_hashtable_#in~name#1.base, add_to_ino_dev_hashtable_#in~name#1.offset;assume { :end_inline_add_to_ino_dev_hashtable } true;havoc ~return_value_is_in_ino_dev_hashtable$3~0#1.base, ~return_value_is_in_ino_dev_hashtable$3~0#1.offset; [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2750: assume !(concat_subpath_file_~f#1.base == 0 && concat_subpath_file_~f#1.offset == 0);call concat_subpath_file_#t~mem84#1 := read~int(concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:24:45,059 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2750: assume !!(concat_subpath_file_~f#1.base == 0 && concat_subpath_file_~f#1.offset == 0); [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2742: havoc concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;call concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset, 8);call write~$Pointer$((if concat_path_file_~lc~0#1.base == 0 && concat_path_file_~lc~0#1.offset == 0 then 10 else 11), (if concat_path_file_~lc~0#1.base == 0 && concat_path_file_~lc~0#1.offset == 0 then 0 else 0), concat_path_file_#t~varargs82#1.base, 8 + concat_path_file_#t~varargs82#1.offset, 8);call write~$Pointer$(concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_#t~varargs82#1.base, 16 + concat_path_file_#t~varargs82#1.offset, 8);assume { :begin_inline_xasprintf } true;xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset := 9, 0, concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset;havoc xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret280#1, xasprintf_#t~varargs281#1.base, xasprintf_#t~varargs281#1.offset, xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~0#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;xasprintf_~format#1.base, xasprintf_~format#1.offset := xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset;havoc xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset;havoc xasprintf_~r~0#1;call xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset := #Ultimate.allocOnStack(8);xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset := xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3634: havoc readdir_#t~mem316#1;readdir_#res#1.base, readdir_#res#1.offset := 0, 0; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3634-1: SUMMARY for call assume_abort_if_not((if 0 != readdir_#t~mem316#1 then 1 else 0)); srcloc: null [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume add_to_ino_dev_hashtable_~name#1.base == 0 && add_to_ino_dev_hashtable_~name#1.offset == 0;add_to_ino_dev_hashtable_~name#1.base, add_to_ino_dev_hashtable_~name#1.offset := 4, 0; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2577: assume !(add_to_ino_dev_hashtable_~name#1.base == 0 && add_to_ino_dev_hashtable_~name#1.offset == 0); [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3370: assume !(0 == last_char_is_#t~mem257#1);havoc last_char_is_#t~mem257#1;havoc last_char_is_~sz~0#1;havoc last_char_is_~return_value_strlen$1~2#1;last_char_is_~return_value_strlen$1~2#1 := last_char_is_#t~nondet258#1;havoc last_char_is_#t~nondet258#1;last_char_is_~sz~0#1 := last_char_is_~return_value_strlen$1~2#1 - 1;last_char_is_~s#1.base, last_char_is_~s#1.offset := last_char_is_~s#1.base, last_char_is_~s#1.offset + (if last_char_is_~sz~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then last_char_is_~sz~0#1 % 18446744073709551616 % 18446744073709551616 else last_char_is_~sz~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);call last_char_is_#t~mem259#1 := read~int(last_char_is_~s#1.base, last_char_is_~s#1.offset, 1); [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3370: assume !!(0 == last_char_is_#t~mem257#1);havoc last_char_is_#t~mem257#1; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;concat_path_file_#t~ret83#1.base, concat_path_file_#t~ret83#1.offset := xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret280#1, xasprintf_#t~varargs281#1.base, xasprintf_#t~varargs281#1.offset, xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~0#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;havoc xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset;assume { :end_inline_xasprintf } true;concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset := concat_path_file_#t~ret83#1.base, concat_path_file_#t~ret83#1.offset;havoc concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset;havoc concat_path_file_#t~ret83#1.base, concat_path_file_#t~ret83#1.offset;concat_path_file_#res#1.base, concat_path_file_#res#1.offset := concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494-2: call xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset := read~$Pointer$(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset, 8);xasprintf_#res#1.base, xasprintf_#res#1.offset := xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset;havoc xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2842: ~return_value_du$4~0#1 := #t~ret112#1;havoc #t~ret112#1;~sum~0#1 := ~sum~0#1 + ~return_value_du$4~0#1;call #t~mem113#1 := read~int(~#bb_common_bufsiz1~0.base, 17 + ~#bb_common_bufsiz1~0.offset, 4); [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586: havoc add_to_ino_dev_hashtable_#t~strcpy~res42#1.base, add_to_ino_dev_hashtable_#t~strcpy~res42#1.offset;havoc add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.base, add_to_ino_dev_hashtable_~return_value_xzalloc$3~0#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2842-1: SUMMARY for call #t~ret112#1 := du(~newfile~0#1.base, ~newfile~0#1.offset); srcloc: null [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586-1: SUMMARY for call add_to_ino_dev_hashtable_#t~strcpy~res42#1.base, add_to_ino_dev_hashtable_#t~strcpy~res42#1.offset := #Ultimate.C_strcpy(add_to_ino_dev_hashtable_~bucket~0#1.base, 24 + add_to_ino_dev_hashtable_~bucket~0#1.offset, add_to_ino_dev_hashtable_~name#1.base, add_to_ino_dev_hashtable_~name#1.offset); srcloc: null [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2834: #t~ret109#1.base, #t~ret109#1.offset := readdir_#res#1.base, readdir_#res#1.offset;havoc readdir_#t~nondet313#1, readdir_#t~nondet314#1, readdir_#t~nondet315#1, readdir_#t~mem316#1, readdir_#t~nondet317#1, readdir_#t~nondet318#1, readdir_#t~nondet319#1, readdir_#t~mem320#1, readdir_#t~mem321#1, readdir_#t~nondet322#1, readdir_#t~pre323#1, readdir_~i~3#1, readdir_#t~mem324#1, readdir_~d#1.base, readdir_~d#1.offset;havoc readdir_#in~d#1.base, readdir_#in~d#1.offset;assume { :end_inline_readdir } true;~entry~0#1.base, ~entry~0#1.offset := #t~ret109#1.base, #t~ret109#1.offset;havoc #t~ret109#1.base, #t~ret109#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2768: havoc concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;assume { :begin_inline_concat_path_file } true;concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset, concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset := concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset;havoc concat_path_file_#res#1.base, concat_path_file_#res#1.offset;havoc concat_path_file_#t~ret80#1.base, concat_path_file_#t~ret80#1.offset, concat_path_file_#t~mem81#1, concat_path_file_#t~varargs82#1.base, concat_path_file_#t~varargs82#1.offset, concat_path_file_#t~ret83#1.base, concat_path_file_#t~ret83#1.offset, concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset, concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;concat_path_file_~path#1.base, concat_path_file_~path#1.offset := concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset;concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset := concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset;havoc concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset; [2025-02-08 13:24:45,060 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826: #t~ret108#1.base, #t~ret108#1.offset := warn_opendir_#res#1.base, warn_opendir_#res#1.offset;havoc warn_opendir_#t~ret278#1.base, warn_opendir_#t~ret278#1.offset, warn_opendir_#t~varargs279#1.base, warn_opendir_#t~varargs279#1.offset, warn_opendir_~path#1.base, warn_opendir_~path#1.offset, warn_opendir_~dp~0#1.base, warn_opendir_~dp~0#1.offset;havoc warn_opendir_#in~path#1.base, warn_opendir_#in~path#1.offset;assume { :end_inline_warn_opendir } true;~dir~0#1.base, ~dir~0#1.offset := #t~ret108#1.base, #t~ret108#1.offset;havoc #t~ret108#1.base, #t~ret108#1.offset; [2025-02-08 13:24:45,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3678: havoc #t~ret344#1; [2025-02-08 13:24:45,470 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-1: assume full_write_~total~1#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-1: assume !(full_write_~total~1#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942: assume !(0 == full_write_~total~1#1);full_write_#res#1 := full_write_~total~1#1; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2942: assume !!(0 == full_write_~total~1#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3467: safe_write_#t~ret276#1 := write_#res#1;havoc write_#t~nondet377#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~2#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret276#1 && safe_write_#t~ret276#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret276#1;havoc safe_write_#t~ret276#1; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: #t~ret76#1 := full_write_#res#1;havoc full_write_#t~ret140#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~1#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret76#1 && #t~ret76#1 <= 9223372036854775807;havoc #t~mem75#1.base, #t~mem75#1.offset;havoc #t~ret76#1; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2939: full_write_#t~ret140#1 := safe_write_#res#1;havoc safe_write_#t~ret276#1, safe_write_#t~mem277#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret140#1 && full_write_#t~ret140#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret140#1;havoc full_write_#t~ret140#1; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem277#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem277#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: assume full_write_~cc~0#1 < 0; [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2940: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:24:45,471 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet377#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~2#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet377#1;assume -9223372036854775808 <= write_#t~nondet377#1 && write_#t~nondet377#1 <= 9223372036854775807;write_~ret~2#1 := write_#t~nondet377#1;havoc write_#t~nondet377#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: assume !true; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3742: write_#res#1 := write_~ret~2#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3742-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~2#1 || (write_~ret~2#1 >= 0 && write_~ret~2#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret276#1, safe_write_#t~mem277#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~2#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~1#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3474-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2727: #t~ret74#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet137#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret74#1 && #t~ret74#1 <= 2147483647;havoc #t~ret74#1;call #t~mem75#1.base, #t~mem75#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem75#1.base, #t~mem75#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret140#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~1#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~1#1 := 0; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume full_write_~total~1#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~1#1 := full_write_~total~1#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:24:45,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume !(full_write_~total~1#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:25:05,401 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3570: assume !(4294967295 / (xstrtou_range_sfx_#t~mem298#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem298#1; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3570: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem298#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem298#1;call xstrtou_range_sfx_#t~mem299#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_~r~1#1 * xstrtou_range_sfx_#t~mem299#1;havoc xstrtou_range_sfx_#t~mem299#1; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc xstrtou_range_sfx_~tmp_if_expr$3~1#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275-1: assume true; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275-1: assume !true; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2912: havoc __main_#t~mem136#1; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:25:05,402 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:25:05,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3541: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:25:05,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3541: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem290#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:25:05,403 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3278: assume -1 == getopt32_~c~0#1; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3278: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3576: assume 0 == xstrtou_range_sfx_#t~mem301#1;havoc xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset;havoc xstrtou_range_sfx_#t~mem301#1; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3576: assume !(0 == xstrtou_range_sfx_#t~mem301#1);havoc xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset;havoc xstrtou_range_sfx_#t~mem301#1; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3576-1: call xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem301#1 := read~int(xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset, 1); [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3545-1: assume xstrtou_range_sfx_#t~mem290#1 - 9 >= -2147483648; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3545-1: assume !(xstrtou_range_sfx_#t~mem290#1 - 9 >= -2147483648); [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3545: assume xstrtou_range_sfx_#t~mem290#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem290#1 - 9;havoc xstrtou_range_sfx_#t~mem290#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3545: assume !(xstrtou_range_sfx_#t~mem290#1 - 9 <= 2147483647); [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282: assume true;call getopt32_#t~mem218#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282: assume !true; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282-2: assume !!((if getopt32_#t~mem218#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem218#1 % 256 % 4294967296 else getopt32_#t~mem218#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem218#1; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3282-2: assume !((if getopt32_#t~mem218#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem218#1 % 256 % 4294967296 else getopt32_#t~mem218#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem218#1;call getopt32_#t~mem219#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3580: assume xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:25:05,404 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3580: assume !(xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:25:05,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: assume 0 == (if getopt32_#t~mem219#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem219#1 % 256 % 4294967296 else getopt32_#t~mem219#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem219#1; [2025-02-08 13:25:05,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: assume !(0 == (if getopt32_#t~mem219#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem219#1 % 256 % 4294967296 else getopt32_#t~mem219#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem219#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:25:05,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~1#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:25:05,405 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3549: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-1: [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume 0 != getopt32_#t~bitwise221#1 % 4294967296;havoc getopt32_#t~mem220#1;havoc getopt32_#t~bitwise221#1; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume !(0 != getopt32_#t~bitwise221#1 % 4294967296);havoc getopt32_#t~mem220#1;havoc getopt32_#t~bitwise221#1;call getopt32_#t~mem222#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem223#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-3: assume getopt32_#t~mem220#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise221#1 := getopt32_#t~mem220#1; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-3: assume !(getopt32_#t~mem220#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-2: havoc getopt32_#t~bitwise221#1;assume getopt32_#t~bitwise221#1 % 4294967296 <= getopt32_#t~mem220#1 % 4294967296 && getopt32_#t~bitwise221#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-5: call getopt32_#t~mem220#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-4: assume 0 == getopt32_#t~mem220#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise221#1 := 0; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285-4: assume !(0 == getopt32_#t~mem220#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256;call xstrtou_range_sfx_#t~mem291#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem291#1;havoc xstrtou_range_sfx_#t~mem291#1;call write~int(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet52#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet52#1;havoc bb_strtoui_#t~nondet52#1; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3385: assume true;call llist_add_to_end_#t~mem260#1.base, llist_add_to_end_#t~mem260#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3385: assume !true; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3385-2: assume !!(llist_add_to_end_#t~mem260#1.base == 0 && llist_add_to_end_#t~mem260#1.offset == 0);havoc llist_add_to_end_#t~mem260#1.base, llist_add_to_end_#t~mem260#1.offset; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3385-2: assume !(llist_add_to_end_#t~mem260#1.base == 0 && llist_add_to_end_#t~mem260#1.offset == 0);havoc llist_add_to_end_#t~mem260#1.base, llist_add_to_end_#t~mem260#1.offset;call llist_add_to_end_#t~mem261#1.base, llist_add_to_end_#t~mem261#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#t~mem261#1.base, llist_add_to_end_#t~mem261#1.offset;havoc llist_add_to_end_#t~mem261#1.base, llist_add_to_end_#t~mem261#1.offset; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-1: [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287: getopt32_~trigger~0#1 := getopt32_#t~bitwise224#1;havoc getopt32_#t~mem222#1;havoc getopt32_#t~mem223#1;havoc getopt32_#t~bitwise224#1;call getopt32_#t~mem225#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-3: assume getopt32_#t~mem222#1 % 4294967296 == getopt32_#t~mem223#1 % 4294967296;getopt32_#t~bitwise224#1 := getopt32_#t~mem222#1; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-3: assume !(getopt32_#t~mem222#1 % 4294967296 == getopt32_#t~mem223#1 % 4294967296); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-2: havoc getopt32_#t~bitwise224#1;assume getopt32_#t~bitwise224#1 % 4294967296 <= getopt32_#t~mem222#1 % 4294967296 && getopt32_#t~bitwise224#1 % 4294967296 <= getopt32_#t~mem223#1 % 4294967296; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-4: assume 0 == getopt32_#t~mem222#1 % 4294967296 || 0 == getopt32_#t~mem223#1 % 4294967296;getopt32_#t~bitwise224#1 := 0; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-4: assume !(0 == getopt32_#t~mem222#1 % 4294967296 || 0 == getopt32_#t~mem223#1 % 4294967296); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288: getopt32_~flags~0#1 := getopt32_#t~bitwise227#1;havoc getopt32_#t~mem225#1;havoc getopt32_#t~bitwise226#1;havoc getopt32_#t~bitwise227#1;call getopt32_#t~mem228#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-2: havoc getopt32_#t~bitwise227#1;assume getopt32_#t~bitwise227#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise227#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise226#1) % 4294967296; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-1: [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise226#1) % 4294967296;getopt32_#t~bitwise227#1 := 0; [2025-02-08 13:25:05,406 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise226#1) % 4294967296); [2025-02-08 13:25:05,407 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise226#1) % 4294967296;getopt32_#t~bitwise227#1 := getopt32_~flags~0#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise226#1) % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-6: havoc getopt32_#t~bitwise226#1;assume getopt32_#t~bitwise226#1 % 4294967296 <= getopt32_#t~mem225#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-5: [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise226#1 := getopt32_#t~mem225#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-7: assume getopt32_#t~mem225#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise226#1 := 0; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-7: assume !(getopt32_#t~mem225#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-9: assume 0 == getopt32_#t~mem225#1 % 4294967296;getopt32_#t~bitwise226#1 := getopt32_~trigger~0#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3288-9: assume !(0 == getopt32_#t~mem225#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3388: llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret262#1.base, llist_add_to_end_#t~ret262#1.offset;havoc llist_add_to_end_#t~ret262#1.base, llist_add_to_end_#t~ret262#1.offset;call write~$Pointer$(llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call llist_add_to_end_#t~mem263#1.base, llist_add_to_end_#t~mem263#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem263#1.base, 8 + llist_add_to_end_#t~mem263#1.offset, 8);havoc llist_add_to_end_#t~mem263#1.base, llist_add_to_end_#t~mem263#1.offset;havoc llist_add_to_end_#t~mem260#1.base, llist_add_to_end_#t~mem260#1.offset, llist_add_to_end_#t~mem261#1.base, llist_add_to_end_#t~mem261#1.offset, llist_add_to_end_#t~ret262#1.base, llist_add_to_end_#t~ret262#1.offset, llist_add_to_end_#t~mem263#1.base, llist_add_to_end_#t~mem263#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3388-1: SUMMARY for call llist_add_to_end_#t~ret262#1.base, llist_add_to_end_#t~ret262#1.offset := xzalloc(16); srcloc: null [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-1: [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289: getopt32_~flags~0#1 := getopt32_#t~bitwise230#1;havoc getopt32_#t~mem228#1;havoc getopt32_#t~bitwise229#1;havoc getopt32_#t~bitwise230#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-3: assume 0 == getopt32_#t~bitwise229#1 % 4294967296;getopt32_#t~bitwise230#1 := getopt32_~flags~0#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-3: assume !(0 == getopt32_#t~bitwise229#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-2: havoc getopt32_#t~bitwise230#1;assume (getopt32_#t~bitwise230#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise230#1 % 4294967296 >= getopt32_#t~bitwise229#1 % 4294967296) && getopt32_#t~bitwise230#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise229#1 % 4294967296; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-5: [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise229#1 % 4294967296;getopt32_#t~bitwise230#1 := getopt32_#t~bitwise229#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise229#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-7: assume getopt32_#t~mem228#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise229#1 := 0; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-7: assume !(getopt32_#t~mem228#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-6: havoc getopt32_#t~bitwise229#1;assume getopt32_#t~bitwise229#1 % 4294967296 <= getopt32_#t~mem228#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-9: assume 0 == getopt32_#t~mem228#1 % 4294967296;getopt32_#t~bitwise229#1 := getopt32_~trigger~0#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-9: assume !(0 == getopt32_#t~mem228#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise229#1 := getopt32_#t~mem228#1; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3587-1: SUMMARY for call bb_error_msg_and_die(22, 0, xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset); srcloc: null [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: xstrtou_range_sfx_#t~ret292#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet52#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_#t~ret292#1;havoc xstrtou_range_sfx_#t~ret292#1;call xstrtou_range_sfx_#t~mem293#1.base, xstrtou_range_sfx_#t~mem293#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3587: havoc xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset; [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3587-2: call xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs302#1.base, 8 + xstrtou_range_sfx_#t~varargs302#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs302#1.base, 16 + xstrtou_range_sfx_#t~varargs302#1.offset, 8); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: getopt32_~flags~0#1 := getopt32_#t~bitwise231#1;havoc getopt32_#t~bitwise231#1;call getopt32_#t~mem232#1.base, getopt32_#t~mem232#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:25:05,408 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-2: havoc getopt32_#t~bitwise231#1;assume getopt32_#t~bitwise231#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-1: [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise231#1 := getopt32_~flags~0#1; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise231#1 := 0; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise231#1 := getopt32_~trigger~0#1; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem293#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem293#1.offset);havoc xstrtou_range_sfx_#t~mem293#1.base, xstrtou_range_sfx_#t~mem293#1.offset;call xstrtou_range_sfx_#t~mem294#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem293#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem293#1.offset);havoc xstrtou_range_sfx_#t~mem293#1.base, xstrtou_range_sfx_#t~mem293#1.offset; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3291: assume !(getopt32_#t~mem232#1.base == 0 && getopt32_#t~mem232#1.offset == 0);havoc getopt32_#t~mem232#1.base, getopt32_#t~mem232#1.offset;call getopt32_#t~mem233#1.base, getopt32_#t~mem233#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem234#1.base, getopt32_#t~mem234#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem235#1 := read~int(getopt32_#t~mem234#1.base, getopt32_#t~mem234#1.offset, 4); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3291: assume !!(getopt32_#t~mem232#1.base == 0 && getopt32_#t~mem232#1.offset == 0);havoc getopt32_#t~mem232#1.base, getopt32_#t~mem232#1.offset; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3292: assume 1 + getopt32_#t~mem235#1 <= 2147483647;call write~int(1 + getopt32_#t~mem235#1, getopt32_#t~mem233#1.base, getopt32_#t~mem233#1.offset, 4); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3292: assume !(1 + getopt32_#t~mem235#1 <= 2147483647); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3292-1: assume 1 + getopt32_#t~mem235#1 >= -2147483648; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3292-1: assume !(1 + getopt32_#t~mem235#1 >= -2147483648); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3557: assume 0 == xstrtou_range_sfx_#t~mem294#1;havoc xstrtou_range_sfx_#t~mem294#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3557: assume !(0 == xstrtou_range_sfx_#t~mem294#1);havoc xstrtou_range_sfx_#t~mem294#1; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem236#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume 1 == getopt32_#t~mem236#1;havoc getopt32_#t~mem236#1;call getopt32_#t~mem237#1.base, getopt32_#t~mem237#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem237#1.base, getopt32_#t~mem237#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem260#1.base, llist_add_to_end_#t~mem260#1.offset, llist_add_to_end_#t~mem261#1.base, llist_add_to_end_#t~mem261#1.offset, llist_add_to_end_#t~ret262#1.base, llist_add_to_end_#t~ret262#1.offset, llist_add_to_end_#t~mem263#1.base, llist_add_to_end_#t~mem263#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume !(1 == getopt32_#t~mem236#1);havoc getopt32_#t~mem236#1;call getopt32_#t~mem238#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3560: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3560: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:25:05,410 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret284#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem288#1, xstrtou_range_sfx_#t~mem289#1, xstrtou_range_sfx_#t~mem290#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem291#1, xstrtou_range_sfx_#t~ret292#1, xstrtou_range_sfx_#t~mem293#1.base, xstrtou_range_sfx_#t~mem293#1.offset, xstrtou_range_sfx_#t~mem294#1, xstrtou_range_sfx_#t~mem295#1, xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset, xstrtou_range_sfx_#t~nondet297#1, xstrtou_range_sfx_#t~mem298#1, xstrtou_range_sfx_#t~mem299#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset, xstrtou_range_sfx_#t~mem301#1, xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset, xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~1#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret284#1;havoc xatou_range_#t~ret284#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-2: call xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset, 8); [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3561-1: assume !(0 == xstrtou_range_sfx_#t~mem295#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem295#1; [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3561-1: assume !!(0 == xstrtou_range_sfx_#t~mem295#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem295#1; [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-1: SUMMARY for call bb_error_msg_and_die(23, 0, xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset); srcloc: null [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3561: assume true;call xstrtou_range_sfx_#t~mem295#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:25:05,412 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3561: assume !true; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3298: assume 2 == getopt32_#t~mem238#1;havoc getopt32_#t~mem238#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret283#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret284#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem288#1, xstrtou_range_sfx_#t~mem289#1, xstrtou_range_sfx_#t~mem290#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem291#1, xstrtou_range_sfx_#t~ret292#1, xstrtou_range_sfx_#t~mem293#1.base, xstrtou_range_sfx_#t~mem293#1.offset, xstrtou_range_sfx_#t~mem294#1, xstrtou_range_sfx_#t~mem295#1, xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset, xstrtou_range_sfx_#t~nondet297#1, xstrtou_range_sfx_#t~mem298#1, xstrtou_range_sfx_#t~mem299#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem300#1.base, xstrtou_range_sfx_#t~mem300#1.offset, xstrtou_range_sfx_#t~mem301#1, xstrtou_range_sfx_#t~varargs302#1.base, xstrtou_range_sfx_#t~varargs302#1.offset, xstrtou_range_sfx_#t~varargs303#1.base, xstrtou_range_sfx_#t~varargs303#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~1#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~1#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~3#1;call xstrtou_range_sfx_#t~mem288#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3298: assume !(2 == getopt32_#t~mem238#1);havoc getopt32_#t~mem238#1;call getopt32_#t~mem241#1.base, getopt32_#t~mem241#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc getopt_long_#t~ret373#1;getopt32_#t~ret217#1 := getopt_long_#res#1;havoc getopt_long_#t~mem369#1.base, getopt_long_#t~mem369#1.offset, getopt_long_#t~mem370#1, getopt_long_#t~mem371#1.base, getopt_long_#t~mem371#1.offset, getopt_long_#t~mem372#1, getopt_long_#t~ret373#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret217#1 && getopt32_#t~ret217#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret217#1;havoc getopt32_#t~ret217#1; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728-2: getopt_long_#t~ret373#1 := getopt_#res#1;havoc getopt_#t~mem353#1.base, getopt_#t~mem353#1.offset, getopt_#t~mem354#1, getopt_#t~short355#1, getopt_#t~nondet356#1, getopt_#t~nondet357#1, getopt_#t~mem358#1, getopt_#t~short359#1, getopt_#t~nondet360#1, getopt_#t~mem361#1, getopt_#t~nondet362#1, getopt_#t~pre363#1, getopt_#t~mem364#1, getopt_#t~short365#1, getopt_#t~nondet366#1, getopt_#t~mem367#1.base, getopt_#t~mem367#1.offset, getopt_#t~pre368#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret373#1 && getopt_long_#t~ret373#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret373#1;havoc getopt_long_#t~ret373#1; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3563: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet297#1;havoc xstrtou_range_sfx_#t~mem296#1.base, xstrtou_range_sfx_#t~mem296#1.offset;havoc xstrtou_range_sfx_#t~nondet297#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: xatoi_positive_#t~ret283#1 := xatou_range_#res#1;havoc xatou_range_#t~ret284#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret283#1;havoc xatoi_positive_#t~ret283#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3301: getopt32_#t~ret239#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret283#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret239#1 && getopt32_#t~ret239#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret239#1;havoc getopt32_#t~ret239#1;call getopt32_#t~mem240#1.base, getopt32_#t~mem240#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem240#1.base, getopt32_#t~mem240#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem240#1.base, getopt32_#t~mem240#1.offset; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3568: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem298#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3568: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: assume 45 == xstrtou_range_sfx_#t~mem288#1;havoc xstrtou_range_sfx_#t~mem288#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: assume !(45 == xstrtou_range_sfx_#t~mem288#1);havoc xstrtou_range_sfx_#t~mem288#1;call xstrtou_range_sfx_#t~mem289#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem289#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305: assume !(getopt32_#t~mem241#1.base == 0 && getopt32_#t~mem241#1.offset == 0);havoc getopt32_#t~mem241#1.base, getopt32_#t~mem241#1.offset;call getopt32_#t~mem242#1.base, getopt32_#t~mem242#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem242#1.base, getopt32_#t~mem242#1.offset, 8); [2025-02-08 13:25:05,413 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3305: assume !!(getopt32_#t~mem241#1.base == 0 && getopt32_#t~mem241#1.offset == 0);havoc getopt32_#t~mem241#1.base, getopt32_#t~mem241#1.offset; [2025-02-08 13:25:05,557 INFO L? ?]: Removed 460 outVars from TransFormulas that were not future-live. [2025-02-08 13:25:05,558 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:25:05,598 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:25:05,599 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:25:05,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:25:05 BoogieIcfgContainer [2025-02-08 13:25:05,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:25:05,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:25:05,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:25:05,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:25:05,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:24:41" (1/3) ... [2025-02-08 13:25:05,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c65b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:25:05, skipping insertion in model container [2025-02-08 13:25:05,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:43" (2/3) ... [2025-02-08 13:25:05,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c65b3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:25:05, skipping insertion in model container [2025-02-08 13:25:05,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:25:05" (3/3) ... [2025-02-08 13:25:05,608 INFO L128 eAbstractionObserver]: Analyzing ICFG du-1.i [2025-02-08 13:25:05,620 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:25:05,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-1.i that has 14 procedures, 512 locations, 1 initial locations, 39 loop locations, and 69 error locations. [2025-02-08 13:25:05,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:25:05,693 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=LoopHeads, 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;@2f6014c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:25:05,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-02-08 13:25:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 510 states, 392 states have (on average 1.6760204081632653) internal successors, (657), 474 states have internal predecessors, (657), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 13:25:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:25:05,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:05,703 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:25:05,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:05,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:05,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1134967, now seen corresponding path program 1 times [2025-02-08 13:25:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048460530] [2025-02-08 13:25:05,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:08,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:25:08,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:25:08,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:08,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048460530] [2025-02-08 13:25:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048460530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:10,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:10,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:25:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822951400] [2025-02-08 13:25:10,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:10,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:10,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:10,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:10,489 INFO L87 Difference]: Start difference. First operand has 510 states, 392 states have (on average 1.6760204081632653) internal successors, (657), 474 states have internal predecessors, (657), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:10,586 INFO L93 Difference]: Finished difference Result 720 states and 1003 transitions. [2025-02-08 13:25:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:10,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:25:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:10,594 INFO L225 Difference]: With dead ends: 720 [2025-02-08 13:25:10,594 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:25:10,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-08 13:25:10,603 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:10,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 522 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:25:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:25:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.5328947368421053) internal successors, (233), 185 states have internal predecessors, (233), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2025-02-08 13:25:10,651 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 3 [2025-02-08 13:25:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:10,651 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2025-02-08 13:25:10,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:10,652 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2025-02-08 13:25:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:25:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:10,653 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:25:10,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:25:10,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:10,654 INFO L85 PathProgramCache]: Analyzing trace with hash -546865891, now seen corresponding path program 1 times [2025-02-08 13:25:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:10,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87718461] [2025-02-08 13:25:10,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:10,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:25:13,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:25:13,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:13,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87718461] [2025-02-08 13:25:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87718461] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575319390] [2025-02-08 13:25:14,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:14,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:14,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:25:16,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:25:18,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:25:18,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:18,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:18,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 18365 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:18,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:18,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:18,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575319390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:18,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:25:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237520455] [2025-02-08 13:25:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:18,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:25:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:18,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:25:18,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:18,852 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:23,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:23,288 INFO L93 Difference]: Finished difference Result 199 states and 249 transitions. [2025-02-08 13:25:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:25:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:25:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:23,291 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:25:23,291 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:25:23,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 13:25:23,292 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:23,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 706 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 13:25:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:25:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:25:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.5263157894736843) internal successors, (232), 184 states have internal predecessors, (232), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 248 transitions. [2025-02-08 13:25:23,310 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 248 transitions. Word has length 6 [2025-02-08 13:25:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:23,310 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 248 transitions. [2025-02-08 13:25:23,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 248 transitions. [2025-02-08 13:25:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:25:23,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:23,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:25:23,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:23,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:23,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 227027641, now seen corresponding path program 1 times [2025-02-08 13:25:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485381760] [2025-02-08 13:25:23,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:25,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:25:26,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:25:26,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:26,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:25:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485381760] [2025-02-08 13:25:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485381760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098898992] [2025-02-08 13:25:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:26,729 INFO L87 Difference]: Start difference. First operand 198 states and 248 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:27,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:27,013 INFO L93 Difference]: Finished difference Result 198 states and 248 transitions. [2025-02-08 13:25:27,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:25:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:27,014 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:25:27,014 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:25:27,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:27,015 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:27,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:25:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:25:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:25:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 181 states have internal predecessors, (229), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 245 transitions. [2025-02-08 13:25:27,026 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 245 transitions. Word has length 7 [2025-02-08 13:25:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 245 transitions. [2025-02-08 13:25:27,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 245 transitions. [2025-02-08 13:25:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:25:27,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:27,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:27,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:25:27,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:27,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1894977058, now seen corresponding path program 1 times [2025-02-08 13:25:27,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:27,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984532977] [2025-02-08 13:25:27,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:27,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:29,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:29,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:29,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:29,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984532977] [2025-02-08 13:25:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984532977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910913314] [2025-02-08 13:25:30,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:30,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:30,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:30,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:25:32,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:34,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:34,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:34,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 18382 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:25:34,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:25:34,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910913314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:34,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:34,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:25:34,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108500515] [2025-02-08 13:25:34,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:34,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:34,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:34,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:34,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:34,517 INFO L87 Difference]: Start difference. First operand 195 states and 245 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:38,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:38,845 INFO L93 Difference]: Finished difference Result 195 states and 245 transitions. [2025-02-08 13:25:38,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:38,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:25:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:38,846 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:25:38,846 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:25:38,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:38,847 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 193 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:38,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 269 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:25:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:25:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:25:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.5133333333333334) internal successors, (227), 179 states have internal predecessors, (227), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 243 transitions. [2025-02-08 13:25:38,862 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 243 transitions. Word has length 11 [2025-02-08 13:25:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 243 transitions. [2025-02-08 13:25:38,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 243 transitions. [2025-02-08 13:25:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:25:38,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:38,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:38,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:25:39,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:39,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:39,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:39,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1385254418, now seen corresponding path program 1 times [2025-02-08 13:25:39,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:39,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967237713] [2025-02-08 13:25:39,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:39,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:41,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:41,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:41,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967237713] [2025-02-08 13:25:42,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967237713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:42,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161207424] [2025-02-08 13:25:42,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:42,496 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-08 13:25:42,497 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-08 13:25:45,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:47,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:47,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:47,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:47,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:47,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161207424] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:47,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:25:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384506037] [2025-02-08 13:25:47,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:47,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:47,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:47,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:47,187 INFO L87 Difference]: Start difference. First operand 193 states and 243 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:47,247 INFO L93 Difference]: Finished difference Result 390 states and 492 transitions. [2025-02-08 13:25:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:47,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:25:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:47,249 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:25:47,249 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:25:47,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:47,249 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 4 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 701 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-08 13:25:47,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 701 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:25:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:25:47,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:25:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 188 states have internal predecessors, (236), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 252 transitions. [2025-02-08 13:25:47,258 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 252 transitions. Word has length 12 [2025-02-08 13:25:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 252 transitions. [2025-02-08 13:25:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 252 transitions. [2025-02-08 13:25:47,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:25:47,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:47,259 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:47,301 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-08 13:25:47,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:47,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -641526932, now seen corresponding path program 2 times [2025-02-08 13:25:47,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:47,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187744341] [2025-02-08 13:25:47,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:47,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:49,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:25:49,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:25:49,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:49,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:51,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:51,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187744341] [2025-02-08 13:25:51,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187744341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:51,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:25:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425909434] [2025-02-08 13:25:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:51,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:51,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:51,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:51,460 INFO L87 Difference]: Start difference. First operand 202 states and 252 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:55,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:55,879 INFO L93 Difference]: Finished difference Result 202 states and 252 transitions. [2025-02-08 13:25:55,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:25:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:55,881 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:25:55,881 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:25:55,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:55,882 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 192 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:55,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 712 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 13:25:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:25:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:25:55,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.471698113207547) internal successors, (234), 186 states have internal predecessors, (234), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 250 transitions. [2025-02-08 13:25:55,887 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 250 transitions. Word has length 21 [2025-02-08 13:25:55,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 250 transitions. [2025-02-08 13:25:55,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 250 transitions. [2025-02-08 13:25:55,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:25:55,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:55,888 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:25:55,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:25:55,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash 693638047, now seen corresponding path program 1 times [2025-02-08 13:25:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863126237] [2025-02-08 13:25:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:58,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:25:58,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:25:58,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:58,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863126237] [2025-02-08 13:25:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863126237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:25:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631314735] [2025-02-08 13:25:59,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:59,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:59,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:59,294 INFO L87 Difference]: Start difference. First operand 200 states and 250 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:03,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:03,667 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2025-02-08 13:26:03,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:03,668 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:26:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:03,669 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:26:03,669 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:26:03,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:03,670 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 2 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:03,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 461 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 13:26:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:26:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:26:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.462962962962963) internal successors, (237), 189 states have internal predecessors, (237), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2025-02-08 13:26:03,676 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 26 [2025-02-08 13:26:03,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:03,677 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2025-02-08 13:26:03,677 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2025-02-08 13:26:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:03,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:03,678 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:03,678 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-02-08 13:26:03,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1089218213, now seen corresponding path program 1 times [2025-02-08 13:26:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803486814] [2025-02-08 13:26:03,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:03,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:06,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:06,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:06,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:26:06,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803486814] [2025-02-08 13:26:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803486814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:06,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935673058] [2025-02-08 13:26:06,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:06,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:06,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:06,867 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-08 13:26:06,868 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-08 13:26:09,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:11,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:11,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:11,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:11,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 18550 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:11,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:26:11,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:11,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935673058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:11,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:11,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275687867] [2025-02-08 13:26:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:11,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:11,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:11,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:11,206 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)