./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/touch-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/touch-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 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:29:35,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:29:35,218 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:29:35,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:29:35,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:29:35,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:29:35,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:29:35,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:29:35,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:29:35,245 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:29:35,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:29:35,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:29:35,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:29:35,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:29:35,247 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:29:35,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:29:35,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:29:35,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:29:35,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:29:35,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:29:35,248 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:29:35,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:35,248 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:29:35,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:29:35,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:29:35,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:29:35,250 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 -> 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 [2025-02-08 13:29:35,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:29:35,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:29:35,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:29:35,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:29:35,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:29:35,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-02-08 13:29:36,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ece7b48d8/37f14e90a82c4ecaa6387acbecfe8d0b/FLAG559d47ba7 [2025-02-08 13:29:37,031 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:29:37,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-02-08 13:29:37,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ece7b48d8/37f14e90a82c4ecaa6387acbecfe8d0b/FLAG559d47ba7 [2025-02-08 13:29:37,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ece7b48d8/37f14e90a82c4ecaa6387acbecfe8d0b [2025-02-08 13:29:37,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:37,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:37,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:37,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:37,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:37,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:37" (1/1) ... [2025-02-08 13:29:37,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd2ec83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:37, skipping insertion in model container [2025-02-08 13:29:37,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:37" (1/1) ... [2025-02-08 13:29:37,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:38,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:38,360 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:38,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:38,663 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:38,668 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:38,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38 WrapperNode [2025-02-08 13:29:38,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:38,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:38,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:38,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:38,675 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:29:38" (1/1) ... [2025-02-08 13:29:38,717 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:29:38" (1/1) ... [2025-02-08 13:29:38,804 INFO L138 Inliner]: procedures = 669, calls = 1057, calls flagged for inlining = 38, calls inlined = 37, statements flattened = 2966 [2025-02-08 13:29:38,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:38,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:38,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:38,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:38,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,845 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:29:38,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:38,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:38,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:38,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:38,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (1/1) ... [2025-02-08 13:29:38,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:38,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:38,986 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:29:38,990 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:29:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-08 13:29:39,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-08 13:29:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:29:39,012 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:39,012 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure utimes [2025-02-08 13:29:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure utimes [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:29:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:39,013 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:29:39,013 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:39,014 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:39,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:29:39,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:39,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:40,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: havoc #t~ret433#1; [2025-02-08 13:29:40,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3405-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:29:40,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2712: #t~ret75#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet81#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret75#1 && #t~ret75#1 <= 2147483647;havoc #t~ret75#1;call #t~mem76#1.base, #t~mem76#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~mem76#1.base, #t~mem76#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret82#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~0#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~0#1 := 0; [2025-02-08 13:29:40,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: 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~ret314#1, safe_write_#t~mem315#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~3#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~3#1; [2025-02-08 13:29:40,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3398: safe_write_#t~ret314#1 := write_#res#1;havoc write_#t~nondet508#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~ret314#1 && safe_write_#t~ret314#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret314#1;havoc safe_write_#t~ret314#1; [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2713: #t~ret77#1 := full_write_#res#1;havoc full_write_#t~ret82#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~0#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~ret77#1 && #t~ret77#1 <= 9223372036854775807;havoc #t~mem76#1.base, #t~mem76#1.offset;havoc #t~ret77#1; [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#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:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3399: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem315#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem315#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3399: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~3#1 := 0; [2025-02-08 13:29:40,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3812: write_#res#1 := write_~ret~2#1; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3812-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:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: full_write_#t~ret82#1 := safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#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~3#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~ret82#1 && full_write_#t~ret82#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret82#1;havoc full_write_#t~ret82#1; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume full_write_~cc~0#1 < 0; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396: 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~nondet508#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~nondet508#1;assume -9223372036854775808 <= write_#t~nondet508#1 && write_#t~nondet508#1 <= 9223372036854775807;write_~ret~2#1 := write_#t~nondet508#1;havoc write_#t~nondet508#1; [2025-02-08 13:29:40,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396: assume !true; [2025-02-08 13:29:40,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396-1: assume 0 != safe_write_~tmp_if_expr$1~3#1 % 256; [2025-02-08 13:29:40,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396-1: assume !(0 != safe_write_~tmp_if_expr$1~3#1 % 256); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074-2: assume !!((if getopt32_#t~mem160#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem160#1 % 256 % 4294967296 else getopt32_#t~mem160#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem160#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074-2: assume !((if getopt32_#t~mem160#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem160#1 % 256 % 4294967296 else getopt32_#t~mem160#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem160#1;call getopt32_#t~mem161#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: assume !(0 == __main_~result~0#1);call __main_#t~mem339#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: assume !!(0 == __main_~result~0#1); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3207: assume !(parse_datestr_~return_value_sscanf$6~0#1 >= 2);assume -2147483648 <= parse_datestr_#t~nondet207#1 && parse_datestr_#t~nondet207#1 <= 2147483647;call write~int(parse_datestr_#t~nondet207#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet208#1 && parse_datestr_#t~nondet208#1 <= 2147483647;call write~int(parse_datestr_#t~nondet208#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet209#1 && parse_datestr_#t~nondet209#1 <= 2147483647;call write~int(parse_datestr_#t~nondet209#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet210#1 && parse_datestr_#t~nondet210#1 <= 2147483647;call write~int(parse_datestr_#t~nondet210#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet211#1 && parse_datestr_#t~nondet211#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet211#1;assume 0 <= parse_datestr_#t~nondet212#1 && parse_datestr_#t~nondet212#1 <= 5;parse_datestr_~return_value_sscanf$5~0#1 := (if parse_datestr_#t~nondet212#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet212#1 % 4294967296 else parse_datestr_#t~nondet212#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet207#1;havoc parse_datestr_#t~nondet208#1;havoc parse_datestr_#t~nondet209#1;havoc parse_datestr_#t~nondet210#1;havoc parse_datestr_#t~nondet211#1;havoc parse_datestr_#t~nondet212#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3207: assume !!(parse_datestr_~return_value_sscanf$6~0#1 >= 2); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume 0 == (if getopt32_#t~mem161#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem161#1 % 256 % 4294967296 else getopt32_#t~mem161#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem161#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3075: assume !(0 == (if getopt32_#t~mem161#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem161#1 % 256 % 4294967296 else getopt32_#t~mem161#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem161#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:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: assume !(4294967295 / (xstrtou_range_sfx_#t~mem369#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem369#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3604: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem369#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem369#1;call xstrtou_range_sfx_#t~mem370#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem370#1;havoc xstrtou_range_sfx_#t~mem370#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2613: bb_strtoll_~first~0#1 := (if bb_strtoll_~tmp_if_expr$1~0#1 % 256 <= 127 then bb_strtoll_~tmp_if_expr$1~0#1 % 256 else bb_strtoll_~tmp_if_expr$1~0#1 % 256 - 256);havoc bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1; [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: assume !(0 == parse_datestr_~tmp_if_expr$12~0#1 % 256);call parse_datestr_#t~mem293#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: assume !!(0 == parse_datestr_~tmp_if_expr$12~0#1 % 256); [2025-02-08 13:29:50,977 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: assume 46 == parse_datestr_~end~0#1;havoc parse_datestr_~return_value___builtin_strchr$21~0#1.base, parse_datestr_~return_value___builtin_strchr$21~0#1.offset;assume (0 == parse_datestr_#t~nondet309#1.base && 0 == parse_datestr_#t~nondet309#1.offset) || (parse_datestr_#t~nondet309#1.base == parse_datestr_~date_str#1.base && 0 <= parse_datestr_#t~nondet309#1.offset && parse_datestr_#t~nondet309#1.offset <= #length[parse_datestr_~date_str#1.base]);parse_datestr_~return_value___builtin_strchr$21~0#1.base, parse_datestr_~return_value___builtin_strchr$21~0#1.offset := parse_datestr_#t~nondet309#1.base, parse_datestr_#t~nondet309#1.offset;havoc parse_datestr_#t~nondet309#1.base, parse_datestr_#t~nondet309#1.offset;havoc parse_datestr_~return_value_sscanf$22~0#1;assume -2147483648 <= parse_datestr_#t~nondet310#1 && parse_datestr_#t~nondet310#1 <= 2147483647;call write~int(parse_datestr_#t~nondet310#1, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet311#1 && parse_datestr_#t~nondet311#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet311#1;assume 0 <= parse_datestr_#t~nondet312#1 && parse_datestr_#t~nondet312#1 <= 2;parse_datestr_~return_value_sscanf$22~0#1 := (if parse_datestr_#t~nondet312#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet312#1 % 4294967296 else parse_datestr_#t~nondet312#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet310#1;havoc parse_datestr_#t~nondet311#1;havoc parse_datestr_#t~nondet312#1; [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: assume !(46 == parse_datestr_~end~0#1); [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241: assume 58 == parse_datestr_~end~0#1;havoc parse_datestr_~return_value_sscanf$7~0#1;assume -2147483648 <= parse_datestr_#t~nondet233#1 && parse_datestr_#t~nondet233#1 <= 2147483647;call write~int(parse_datestr_#t~nondet233#1, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet234#1 && parse_datestr_#t~nondet234#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet234#1;assume 0 <= parse_datestr_#t~nondet235#1 && parse_datestr_#t~nondet235#1 <= 2;parse_datestr_~return_value_sscanf$7~0#1 := (if parse_datestr_#t~nondet235#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet235#1 % 4294967296 else parse_datestr_#t~nondet235#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet233#1;havoc parse_datestr_#t~nondet234#1;havoc parse_datestr_#t~nondet235#1; [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241: assume !(58 == parse_datestr_~end~0#1); [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3737-1: SUMMARY for call assume_abort_if_not((if strptime_~last_ok~0#1 % 18446744073709551616 <= strptime_~s_len~0#1 % 18446744073709551616 then 1 else 0)); srcloc: null [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3737: strptime_#res#1.base, strptime_#res#1.offset := strptime_~s#1.base, strptime_~s#1.offset + (if strptime_~last_ok~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then strptime_~last_ok~0#1 % 18446744073709551616 % 18446744073709551616 else strptime_~last_ok~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: __main_#t~ret326#1.base, __main_#t~ret326#1.offset := localtime_r_#res#1.base, localtime_r_#res#1.offset;havoc localtime_r_#t~nondet377#1, localtime_r_#t~nondet378#1, localtime_r_#t~nondet379#1, localtime_r_#t~nondet380#1, localtime_r_#t~nondet381#1, localtime_r_#t~nondet382#1, localtime_r_#t~nondet383#1, localtime_r_#t~nondet384#1, localtime_r_#t~nondet385#1, localtime_r_#t~mem386#1, localtime_r_#t~mem387#1, localtime_r_#t~short388#1, localtime_r_#t~mem389#1, localtime_r_#t~mem390#1, localtime_r_#t~short391#1, localtime_r_#t~mem392#1, localtime_r_#t~mem393#1, localtime_r_#t~short394#1, localtime_r_#t~mem395#1, localtime_r_#t~mem396#1, localtime_r_#t~short397#1, localtime_r_#t~mem398#1, localtime_r_#t~mem399#1, localtime_r_#t~short400#1, localtime_r_#t~mem401#1, localtime_r_#t~mem402#1, localtime_r_#t~short403#1, localtime_r_#t~mem404#1, localtime_r_#t~mem405#1, localtime_r_#t~short406#1, localtime_r_#t~mem407#1, localtime_r_#t~mem408#1, localtime_r_#t~short409#1, localtime_r_~timep#1.base, localtime_r_~timep#1.offset, localtime_r_~result#1.base, localtime_r_~result#1.offset;havoc localtime_r_#in~timep#1.base, localtime_r_#in~timep#1.offset, localtime_r_#in~result#1.base, localtime_r_#in~result#1.offset;assume { :end_inline_localtime_r } true;havoc __main_#t~ret326#1.base, __main_#t~ret326#1.offset;call __main_#t~mem327#1.base, __main_#t~mem327#1.offset := read~$Pointer$(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset, 8);assume { :begin_inline_parse_datestr } true;parse_datestr_#in~date_str#1.base, parse_datestr_#in~date_str#1.offset, parse_datestr_#in~ptm#1.base, parse_datestr_#in~ptm#1.offset := __main_#t~mem327#1.base, __main_#t~mem327#1.offset, __main_~#tm_time~0#1.base, __main_~#tm_time~0#1.offset;havoc parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset, parse_datestr_#t~nondet202#1, parse_datestr_#t~nondet203#1, parse_datestr_#t~nondet204#1, parse_datestr_#t~nondet205#1, parse_datestr_#t~nondet206#1, parse_datestr_#t~nondet207#1, parse_datestr_#t~nondet208#1, parse_datestr_#t~nondet209#1, parse_datestr_#t~nondet210#1, parse_datestr_#t~nondet211#1, parse_datestr_#t~nondet212#1, parse_datestr_#t~mem213#1, parse_datestr_#t~nondet214#1, parse_datestr_#t~nondet215#1, parse_datestr_#t~nondet216#1, parse_datestr_#t~nondet217#1, parse_datestr_#t~nondet218#1, parse_datestr_#t~nondet219#1, parse_datestr_#t~nondet220#1, parse_datestr_#t~nondet221#1, parse_datestr_#t~nondet222#1, parse_datestr_#t~nondet223#1, parse_datestr_#t~nondet224#1, parse_datestr_#t~nondet225#1, parse_datestr_#t~nondet226#1, parse_datestr_#t~nondet227#1, parse_datestr_#t~mem228#1, parse_datestr_#t~mem229#1, parse_datestr_#t~ret230#1.base, parse_datestr_#t~ret230#1.offset, parse_datestr_#t~mem231#1, parse_datestr_#t~varargs232#1.base, parse_datestr_#t~varargs232#1.offset, parse_datestr_#t~nondet233#1, parse_datestr_#t~nondet234#1, parse_datestr_#t~nondet235#1, parse_datestr_~return_value_sscanf$7~0#1, parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset, parse_datestr_~return_value_sscanf$6~0#1, parse_datestr_#t~nondet236#1.base, parse_datestr_#t~nondet236#1.offset, parse_datestr_#t~nondet237#1, parse_datestr_#t~nondet238#1, parse_datestr_#t~nondet239#1, parse_datestr_#t~nondet240#1, parse_datestr_#t~nondet241#1, parse_datestr_#t~nondet242#1, parse_datestr_#t~nondet243#1, parse_datestr_#t~nondet244#1, parse_datestr_#t~nondet245#1, parse_datestr_#t~nondet246#1, parse_datestr_#t~nondet247#1, parse_datestr_#t~mem248#1, parse_datestr_#t~mem249#1, parse_datestr_#t~mem250#1, parse_datestr_#t~ret251#1, parse_datestr_#t~mem252#1, parse_datestr_#t~nondet253#1.base, parse_datestr_#t~nondet253#1.offset, parse_datestr_#t~mem254#1, parse_datestr_#t~mem255#1, parse_datestr_#t~mem256#1, parse_datestr_#t~mem257#1, parse_datestr_#t~mem258#1, parse_datestr_#t~mem259#1, parse_datestr_#t~mem260#1, parse_datestr_#t~mem261#1, parse_datestr_#t~mem262#1, parse_datestr_#t~mem263#1, parse_datestr_#t~mem264#1.base, parse_datestr_#t~mem264#1.offset, parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset, parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset, parse_datestr_#t~mem265#1, parse_datestr_#t~ret266#1.base, parse_datestr_#t~ret266#1.offset, parse_datestr_#t~nondet267#1, parse_datestr_#t~nondet268#1, parse_datestr_#t~nondet269#1, parse_datestr_#t~nondet270#1, parse_datestr_#t~nondet271#1, parse_datestr_#t~nondet272#1, parse_datestr_#t~nondet273#1, parse_datestr_#t~nondet274#1, parse_datestr_#t~nondet275#1, parse_datestr_#t~nondet276#1, parse_datestr_#t~nondet277#1, parse_datestr_#t~nondet278#1, parse_datestr_#t~nondet279#1, parse_datestr_#t~nondet280#1, parse_datestr_#t~nondet281#1, parse_datestr_#t~nondet282#1, parse_datestr_#t~nondet283#1, parse_datestr_#t~nondet284#1, parse_datestr_#t~mem285#1, parse_datestr_#t~nondet286#1, parse_datestr_#t~nondet287#1, parse_datestr_#t~nondet288#1, parse_datestr_#t~nondet289#1, parse_datestr_#t~nondet290#1, parse_datestr_#t~nondet291#1, parse_datestr_#t~nondet292#1, parse_datestr_#t~mem293#1, parse_datestr_#t~mem294#1, parse_datestr_#t~mem295#1, parse_datestr_#t~mem296#1, parse_datestr_#t~mem297#1, parse_datestr_#t~mem298#1, parse_datestr_#t~nondet299#1, parse_datestr_#t~nondet300#1, parse_datestr_#t~nondet301#1, parse_datestr_#t~nondet302#1, parse_datestr_#t~nondet303#1, parse_datestr_#t~nondet304#1, parse_datestr_#t~nondet305#1, parse_datestr_#t~mem306#1, parse_datestr_#t~mem307#1, parse_datestr_#t~varargs308#1.base, parse_datestr_#t~varargs308#1.offset, parse_datestr_#t~nondet309#1.base, parse_datestr_#t~nondet309#1.offset, parse_datestr_#t~nondet310#1, parse_datestr_#t~nondet311#1, parse_datestr_#t~nondet312#1, parse_datestr_~return_value___builtin_strchr$21~0#1.base, parse_datestr_~return_value___builtin_strchr$21~0#1.offset, parse_datestr_~return_value_sscanf$22~0#1, parse_datestr_~cur_year~0#1, parse_datestr_~len~0#1, parse_datestr_~return_value_strchrnul$8~0#1.base, parse_datestr_~return_value_strchrnul$8~0#1.offset, parse_datestr_#t~varargs313#1.base, parse_datestr_#t~varargs313#1.offset, parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset, parse_datestr_~end~0#1, parse_datestr_~last_colon~0#1.base, parse_datestr_~last_colon~0#1.offset, parse_datestr_~return_value_sscanf$5~0#1, parse_datestr_~return_value_sscanf$2~0#1, parse_datestr_~tmp_if_expr$4~0#1, parse_datestr_~return_value_sscanf$3~0#1, parse_datestr_~tmp_if_expr$1~2#1, parse_datestr_~return_value___builtin_strchr$23~0#1.base, parse_datestr_~return_value___builtin_strchr$23~0#1.offset, parse_datestr_~tmp_if_expr$27~0#1, parse_datestr_~return_value_sscanf$24~0#1, parse_datestr_~tmp_if_expr$26~0#1, parse_datestr_~return_value_sscanf$25~0#1, parse_datestr_~tmp_if_expr$20~0#1, parse_datestr_~return_value_sscanf$19~0#1, parse_datestr_~tmp_if_expr$18~0#1, parse_datestr_~return_value_sscanf$17~0#1, parse_datestr_~tmp_if_expr$16~0#1, parse_datestr_~return_value_sscanf$15~0#1, parse_datestr_~tmp_if_expr$14~0#1, parse_datestr_~return_value_sscanf$13~0#1, parse_datestr_~tmp_if_expr$12~0#1, parse_datestr_~return_value_sscanf$11~0#1, parse_datestr_~tmp_if_expr$10~1#1, parse_datestr_~return_value_sscanf$9~0#1;parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset := parse_datestr_#in~date_str#1.base, parse_datestr_#in~date_str#1.offset;parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset := parse_datestr_#in~ptm#1.base, parse_datestr_#in~ptm#1.offset;parse_datestr_~end~0#1 := 0;havoc parse_datestr_~last_colon~0#1.base, parse_datestr_~last_colon~0#1.offset; [2025-02-08 13:29:50,978 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3473: assume 2 == __main_#t~mem339#1;havoc __main_#t~mem339#1; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3473: assume !(2 == __main_#t~mem339#1);havoc __main_#t~mem339#1;__main_~status~0#1 := 1;call __main_#t~mem346#1.base, __main_#t~mem346#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);assume { :begin_inline_bb_simple_perror_msg } true;bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset := __main_#t~mem346#1.base, __main_#t~mem346#1.offset;havoc bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset := bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;call bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset, bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset, 8);assume { :begin_inline_bb_perror_msg } true;bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset := 4, 0, bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset;havoc bb_perror_msg_#t~mem38#1, bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset, bb_perror_msg_#t~nondet40#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~1#1.base, bb_perror_msg_~p~1#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset := bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset;havoc bb_perror_msg_~p~1#1.base, bb_perror_msg_~p~1#1.offset;bb_perror_msg_~p~1#1.base, bb_perror_msg_~p~1#1.offset := bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;havoc bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;call bb_perror_msg_#t~mem38#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374: havoc parse_datestr_~return_value___builtin_strchr$21~0#1.base, parse_datestr_~return_value___builtin_strchr$21~0#1.offset, parse_datestr_~return_value_sscanf$22~0#1; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3242: havoc parse_datestr_~return_value_sscanf$7~0#1; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275: parse_datestr_#t~ret251#1 := bb_strtol_#res#1;havoc bb_strtol_#t~ret45#1, bb_strtol_~arg#1.base, bb_strtol_~arg#1.offset, bb_strtol_~endp#1.base, bb_strtol_~endp#1.offset, bb_strtol_~base#1, bb_strtol_~return_value_bb_strtoll$1~0#1;havoc bb_strtol_#in~arg#1.base, bb_strtol_#in~arg#1.offset, bb_strtol_#in~endp#1.base, bb_strtol_#in~endp#1.offset, bb_strtol_#in~base#1;assume { :end_inline_bb_strtol } true;assume -9223372036854775808 <= parse_datestr_#t~ret251#1 && parse_datestr_#t~ret251#1 <= 9223372036854775807;call write~int(parse_datestr_#t~ret251#1, parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset, 8);havoc parse_datestr_#t~ret251#1;call parse_datestr_#t~mem252#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-1: [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077: assume 0 != getopt32_#t~bitwise163#1 % 4294967296;havoc getopt32_#t~mem162#1;havoc getopt32_#t~bitwise163#1; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077: assume !(0 != getopt32_#t~bitwise163#1 % 4294967296);havoc getopt32_#t~mem162#1;havoc getopt32_#t~bitwise163#1;call getopt32_#t~mem164#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem165#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-3: assume getopt32_#t~mem162#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_#t~mem162#1; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-3: assume !(getopt32_#t~mem162#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-2: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_#t~mem162#1 % 4294967296 && getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:29:50,979 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-5: call getopt32_#t~mem162#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-4: assume 0 == getopt32_#t~mem162#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3077-4: assume !(0 == getopt32_#t~mem162#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615-1: SUMMARY for call bb_strtoll_#t~ret49#1 := bb_ascii_isalnum(bb_strtoll_~first~0#1); srcloc: null [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: assume -2147483648 <= bb_strtoll_#t~ret49#1 && bb_strtoll_#t~ret49#1 <= 2147483647;bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1 := bb_strtoll_#t~ret49#1;havoc bb_strtoll_#t~ret49#1;havoc bb_strtoll_~return_value_ret_ERANGE$2~0#1; [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3573: havoc xstrtou_range_sfx_~tmp_if_expr$3~2#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441: havoc parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset, parse_datestr_#t~nondet202#1, parse_datestr_#t~nondet203#1, parse_datestr_#t~nondet204#1, parse_datestr_#t~nondet205#1, parse_datestr_#t~nondet206#1, parse_datestr_#t~nondet207#1, parse_datestr_#t~nondet208#1, parse_datestr_#t~nondet209#1, parse_datestr_#t~nondet210#1, parse_datestr_#t~nondet211#1, parse_datestr_#t~nondet212#1, parse_datestr_#t~mem213#1, parse_datestr_#t~nondet214#1, parse_datestr_#t~nondet215#1, parse_datestr_#t~nondet216#1, parse_datestr_#t~nondet217#1, parse_datestr_#t~nondet218#1, parse_datestr_#t~nondet219#1, parse_datestr_#t~nondet220#1, parse_datestr_#t~nondet221#1, parse_datestr_#t~nondet222#1, parse_datestr_#t~nondet223#1, parse_datestr_#t~nondet224#1, parse_datestr_#t~nondet225#1, parse_datestr_#t~nondet226#1, parse_datestr_#t~nondet227#1, parse_datestr_#t~mem228#1, parse_datestr_#t~mem229#1, parse_datestr_#t~ret230#1.base, parse_datestr_#t~ret230#1.offset, parse_datestr_#t~mem231#1, parse_datestr_#t~varargs232#1.base, parse_datestr_#t~varargs232#1.offset, parse_datestr_#t~nondet233#1, parse_datestr_#t~nondet234#1, parse_datestr_#t~nondet235#1, parse_datestr_~return_value_sscanf$7~0#1, parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset, parse_datestr_~return_value_sscanf$6~0#1, parse_datestr_#t~nondet236#1.base, parse_datestr_#t~nondet236#1.offset, parse_datestr_#t~nondet237#1, parse_datestr_#t~nondet238#1, parse_datestr_#t~nondet239#1, parse_datestr_#t~nondet240#1, parse_datestr_#t~nondet241#1, parse_datestr_#t~nondet242#1, parse_datestr_#t~nondet243#1, parse_datestr_#t~nondet244#1, parse_datestr_#t~nondet245#1, parse_datestr_#t~nondet246#1, parse_datestr_#t~nondet247#1, parse_datestr_#t~mem248#1, parse_datestr_#t~mem249#1, parse_datestr_#t~mem250#1, parse_datestr_#t~ret251#1, parse_datestr_#t~mem252#1, parse_datestr_#t~nondet253#1.base, parse_datestr_#t~nondet253#1.offset, parse_datestr_#t~mem254#1, parse_datestr_#t~mem255#1, parse_datestr_#t~mem256#1, parse_datestr_#t~mem257#1, parse_datestr_#t~mem258#1, parse_datestr_#t~mem259#1, parse_datestr_#t~mem260#1, parse_datestr_#t~mem261#1, parse_datestr_#t~mem262#1, parse_datestr_#t~mem263#1, parse_datestr_#t~mem264#1.base, parse_datestr_#t~mem264#1.offset, parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset, parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset, parse_datestr_#t~mem265#1, parse_datestr_#t~ret266#1.base, parse_datestr_#t~ret266#1.offset, parse_datestr_#t~nondet267#1, parse_datestr_#t~nondet268#1, parse_datestr_#t~nondet269#1, parse_datestr_#t~nondet270#1, parse_datestr_#t~nondet271#1, parse_datestr_#t~nondet272#1, parse_datestr_#t~nondet273#1, parse_datestr_#t~nondet274#1, parse_datestr_#t~nondet275#1, parse_datestr_#t~nondet276#1, parse_datestr_#t~nondet277#1, parse_datestr_#t~nondet278#1, parse_datestr_#t~nondet279#1, parse_datestr_#t~nondet280#1, parse_datestr_#t~nondet281#1, parse_datestr_#t~nondet282#1, parse_datestr_#t~nondet283#1, parse_datestr_#t~nondet284#1, parse_datestr_#t~mem285#1, parse_datestr_#t~nondet286#1, parse_datestr_#t~nondet287#1, parse_datestr_#t~nondet288#1, parse_datestr_#t~nondet289#1, parse_datestr_#t~nondet290#1, parse_datestr_#t~nondet291#1, parse_datestr_#t~nondet292#1, parse_datestr_#t~mem293#1, parse_datestr_#t~mem294#1, parse_datestr_#t~mem295#1, parse_datestr_#t~mem296#1, parse_datestr_#t~mem297#1, parse_datestr_#t~mem298#1, parse_datestr_#t~nondet299#1, parse_datestr_#t~nondet300#1, parse_datestr_#t~nondet301#1, parse_datestr_#t~nondet302#1, parse_datestr_#t~nondet303#1, parse_datestr_#t~nondet304#1, parse_datestr_#t~nondet305#1, parse_datestr_#t~mem306#1, parse_datestr_#t~mem307#1, parse_datestr_#t~varargs308#1.base, parse_datestr_#t~varargs308#1.offset, parse_datestr_#t~nondet309#1.base, parse_datestr_#t~nondet309#1.offset, parse_datestr_#t~nondet310#1, parse_datestr_#t~nondet311#1, parse_datestr_#t~nondet312#1, parse_datestr_~return_value___builtin_strchr$21~0#1.base, parse_datestr_~return_value___builtin_strchr$21~0#1.offset, parse_datestr_~return_value_sscanf$22~0#1, parse_datestr_~cur_year~0#1, parse_datestr_~len~0#1, parse_datestr_~return_value_strchrnul$8~0#1.base, parse_datestr_~return_value_strchrnul$8~0#1.offset, parse_datestr_#t~varargs313#1.base, parse_datestr_#t~varargs313#1.offset, parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset, parse_datestr_~end~0#1, parse_datestr_~last_colon~0#1.base, parse_datestr_~last_colon~0#1.offset, parse_datestr_~return_value_sscanf$5~0#1, parse_datestr_~return_value_sscanf$2~0#1, parse_datestr_~tmp_if_expr$4~0#1, parse_datestr_~return_value_sscanf$3~0#1, parse_datestr_~tmp_if_expr$1~2#1, parse_datestr_~return_value___builtin_strchr$23~0#1.base, parse_datestr_~return_value___builtin_strchr$23~0#1.offset, parse_datestr_~tmp_if_expr$27~0#1, parse_datestr_~return_value_sscanf$24~0#1, parse_datestr_~tmp_if_expr$26~0#1, parse_datestr_~return_value_sscanf$25~0#1, parse_datestr_~tmp_if_expr$20~0#1, parse_datestr_~return_value_sscanf$19~0#1, parse_datestr_~tmp_if_expr$18~0#1, parse_datestr_~return_value_sscanf$17~0#1, parse_datestr_~tmp_if_expr$16~0#1, parse_datestr_~return_value_sscanf$15~0#1, parse_datestr_~tmp_if_expr$14~0#1, parse_datestr_~return_value_sscanf$13~0#1, parse_datestr_~tmp_if_expr$12~0#1, parse_datestr_~return_value_sscanf$11~0#1, parse_datestr_~tmp_if_expr$10~1#1, parse_datestr_~return_value_sscanf$9~0#1;havoc parse_datestr_#in~date_str#1.base, parse_datestr_#in~date_str#1.offset, parse_datestr_#in~ptm#1.base, parse_datestr_#in~ptm#1.offset;assume { :end_inline_parse_datestr } true;havoc __main_#t~mem327#1.base, __main_#t~mem327#1.offset;call write~int(-1, __main_~#tm_time~0#1.base, 32 + __main_~#tm_time~0#1.offset, 4);call __main_#t~mem328#1.base, __main_#t~mem328#1.offset := read~$Pointer$(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset, 8);assume { :begin_inline_validate_tm_time } true;validate_tm_time_#in~date_str#1.base, validate_tm_time_#in~date_str#1.offset, validate_tm_time_#in~ptm#1.base, validate_tm_time_#in~ptm#1.offset := __main_#t~mem328#1.base, __main_#t~mem328#1.offset, __main_~#tm_time~0#1.base, __main_~#tm_time~0#1.offset;havoc validate_tm_time_#res#1;havoc validate_tm_time_#t~nondet348#1.base, validate_tm_time_#t~nondet348#1.offset, validate_tm_time_#t~varargs349#1.base, validate_tm_time_#t~varargs349#1.offset, validate_tm_time_~date_str#1.base, validate_tm_time_~date_str#1.offset, validate_tm_time_~ptm#1.base, validate_tm_time_~ptm#1.offset, validate_tm_time_~t~2#1;validate_tm_time_~date_str#1.base, validate_tm_time_~date_str#1.offset := validate_tm_time_#in~date_str#1.base, validate_tm_time_#in~date_str#1.offset;validate_tm_time_~ptm#1.base, validate_tm_time_~ptm#1.offset := validate_tm_time_#in~ptm#1.base, validate_tm_time_#in~ptm#1.offset;havoc validate_tm_time_~t~2#1;validate_tm_time_~t~2#1 := validate_tm_time_#t~nondet348#1.base + validate_tm_time_#t~nondet348#1.offset;havoc validate_tm_time_#t~nondet348#1.base, validate_tm_time_#t~nondet348#1.offset; [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: assume parse_datestr_#t~mem293#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem293#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem293#1; [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342: assume !(parse_datestr_#t~mem293#1 - 1 <= 2147483647); [2025-02-08 13:29:50,980 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: assume 0 == parse_datestr_#t~mem252#1;havoc parse_datestr_#t~mem252#1;havoc parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset;parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset := parse_datestr_#t~nondet253#1.base, parse_datestr_#t~nondet253#1.offset;havoc parse_datestr_#t~nondet253#1.base, parse_datestr_#t~nondet253#1.offset; [2025-02-08 13:29:50,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: assume !(0 == parse_datestr_#t~mem252#1);havoc parse_datestr_#t~mem252#1; [2025-02-08 13:29:50,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342-1: assume parse_datestr_#t~mem293#1 - 1 >= -2147483648; [2025-02-08 13:29:50,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3342-1: assume !(parse_datestr_#t~mem293#1 - 1 >= -2147483648); [2025-02-08 13:29:50,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume parse_datestr_~return_value_sscanf$5~0#1 >= 4;call parse_datestr_#t~mem213#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume !(parse_datestr_~return_value_sscanf$5~0#1 >= 4);assume -2147483648 <= parse_datestr_#t~nondet214#1 && parse_datestr_#t~nondet214#1 <= 2147483647;call write~int(parse_datestr_#t~nondet214#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet215#1 && parse_datestr_#t~nondet215#1 <= 2147483647;call write~int(parse_datestr_#t~nondet215#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet216#1 && parse_datestr_#t~nondet216#1 <= 2147483647;call write~int(parse_datestr_#t~nondet216#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet217#1 && parse_datestr_#t~nondet217#1 <= 2147483647;call write~int(parse_datestr_#t~nondet217#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet218#1 && parse_datestr_#t~nondet218#1 <= 2147483647;call write~int(parse_datestr_#t~nondet218#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet219#1 && parse_datestr_#t~nondet219#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet219#1;assume 0 <= parse_datestr_#t~nondet220#1 && parse_datestr_#t~nondet220#1 <= 6;parse_datestr_~return_value_sscanf$2~0#1 := (if parse_datestr_#t~nondet220#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet220#1 % 4294967296 else parse_datestr_#t~nondet220#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet214#1;havoc parse_datestr_#t~nondet215#1;havoc parse_datestr_#t~nondet216#1;havoc parse_datestr_#t~nondet217#1;havoc parse_datestr_#t~nondet218#1;havoc parse_datestr_#t~nondet219#1;havoc parse_datestr_#t~nondet220#1; [2025-02-08 13:29:50,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: 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:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3475: assume !(0 == __main_~opts~0#1 % 2); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3475: assume !!(0 == __main_~opts~0#1 % 2);call __main_#t~mem340#1.base, __main_#t~mem340#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);assume { :begin_inline_open } true;open_#in~__file#1.base, open_#in~__file#1.offset, open_#in~__oflag#1 := __main_#t~mem340#1.base, __main_#t~mem340#1.offset, 66;havoc open_#res#1;havoc open_#t~mem410#1, open_#t~nondet411#1, open_#t~nondet412#1, open_#t~mem413#1, open_~__file#1.base, open_~__file#1.offset, open_~__oflag#1, open_~ret~0#1;open_~__file#1.base, open_~__file#1.offset := open_#in~__file#1.base, open_#in~__file#1.offset;open_~__oflag#1 := open_#in~__oflag#1;call open_#t~mem410#1 := read~int(open_~__file#1.base, open_~__file#1.offset, 1);havoc open_#t~mem410#1;havoc open_#t~nondet411#1;assume -2147483648 <= open_#t~nondet411#1 && open_#t~nondet411#1 <= 2147483647;open_~ret~0#1 := open_#t~nondet411#1;havoc open_#t~nondet411#1; [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3343: assume (if parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 <= 2147483647 then parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 else parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 - 4294967296) >= 50;call parse_datestr_#t~mem294#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3343: assume !((if parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 <= 2147483647 then parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 else parse_datestr_~cur_year~0#1 % 4294967296 % 4294967296 - 4294967296) >= 50); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211-1: assume parse_datestr_#t~mem213#1 - 1 >= -2147483648; [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211-1: assume !(parse_datestr_#t~mem213#1 - 1 >= -2147483648); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: assume parse_datestr_#t~mem213#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem213#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: assume !(parse_datestr_#t~mem213#1 - 1 <= 2147483647); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-1: [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079: getopt32_~trigger~0#1 := getopt32_#t~bitwise166#1;havoc getopt32_#t~mem164#1;havoc getopt32_#t~mem165#1;havoc getopt32_#t~bitwise166#1;call getopt32_#t~mem167#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-3: assume getopt32_#t~mem164#1 % 4294967296 == getopt32_#t~mem165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_#t~mem164#1; [2025-02-08 13:29:50,983 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-3: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_#t~mem165#1 % 4294967296); [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-2: havoc getopt32_#t~bitwise166#1;assume getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_#t~mem164#1 % 4294967296 && getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_#t~mem165#1 % 4294967296; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-4: assume 0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_#t~mem165#1 % 4294967296;getopt32_#t~bitwise166#1 := 0; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3079-4: assume !(0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_#t~mem165#1 % 4294967296); [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: assume 0 == bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617: assume !(0 == bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1); [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~4#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~4#1 % 256);call xstrtou_range_sfx_#t~mem361#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: __main_#t~ret329#1 := validate_tm_time_#res#1;havoc validate_tm_time_#t~nondet348#1.base, validate_tm_time_#t~nondet348#1.offset, validate_tm_time_#t~varargs349#1.base, validate_tm_time_#t~varargs349#1.offset, validate_tm_time_~date_str#1.base, validate_tm_time_~date_str#1.offset, validate_tm_time_~ptm#1.base, validate_tm_time_~ptm#1.offset, validate_tm_time_~t~2#1;havoc validate_tm_time_#in~date_str#1.base, validate_tm_time_#in~date_str#1.offset, validate_tm_time_#in~ptm#1.base, validate_tm_time_#in~ptm#1.offset;assume { :end_inline_validate_tm_time } true;assume -9223372036854775808 <= __main_#t~ret329#1 && __main_#t~ret329#1 <= 9223372036854775807;call write~int(__main_#t~ret329#1, __main_~#t~1#1.base, __main_~#t~1#1.offset, 8);havoc __main_#t~mem328#1.base, __main_#t~mem328#1.offset;havoc __main_#t~ret329#1;call __main_#t~mem330#1 := read~int(__main_~#t~1#1.base, __main_~#t~1#1.offset, 8);call write~int(__main_#t~mem330#1, __main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset, 8);havoc __main_#t~mem330#1;call __main_#t~mem331#1 := read~int(__main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset, 8);call write~int(__main_#t~mem331#1, __main_~#timebuf~0#1.base, 16 + __main_~#timebuf~0#1.offset, 8);call ULTIMATE.dealloc(__main_~#tm_time~0#1.base, __main_~#tm_time~0#1.offset);havoc __main_~#tm_time~0#1.base, __main_~#tm_time~0#1.offset;call ULTIMATE.dealloc(__main_~#t~1#1.base, __main_~#t~1#1.offset);havoc __main_~#t~1#1.base, __main_~#t~1#1.offset;havoc __main_~#tm_time~0#1.base, __main_~#tm_time~0#1.offset, __main_~#t~1#1.base, __main_~#t~1#1.offset;havoc __main_#t~mem331#1; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: assume 0 == parse_datestr_~tmp_if_expr$18~0#1 % 256; [2025-02-08 13:29:50,984 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3311: assume !(0 == parse_datestr_~tmp_if_expr$18~0#1 % 256); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: assume 1 == parse_datestr_~return_value_sscanf$7~0#1;parse_datestr_~end~0#1 := 0; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: assume !(1 == parse_datestr_~return_value_sscanf$7~0#1); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3179-1: assume true;parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset := 0, 0; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3179-1: assume true;havoc parse_datestr_#t~nondet202#1;assume parse_datestr_#t~nondet202#1 % 18446744073709551616 > 0;call parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset := #Ultimate.allocOnHeap(parse_datestr_#t~nondet202#1 % 18446744073709551616);call write~int(0, parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet202#1 % 18446744073709551616 - 1, 1); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3179: parse_datestr_~last_colon~0#1.base, parse_datestr_~last_colon~0#1.offset := parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset;havoc parse_datestr_#t~nondet201#1.base, parse_datestr_#t~nondet201#1.offset;havoc parse_datestr_#t~nondet202#1;havoc parse_datestr_~return_value_sscanf$5~0#1;havoc parse_datestr_~return_value_sscanf$2~0#1;havoc parse_datestr_~tmp_if_expr$4~0#1;havoc parse_datestr_~return_value_sscanf$3~0#1;havoc parse_datestr_~tmp_if_expr$1~2#1;havoc parse_datestr_~return_value___builtin_strchr$23~0#1.base, parse_datestr_~return_value___builtin_strchr$23~0#1.offset;havoc parse_datestr_~tmp_if_expr$27~0#1;havoc parse_datestr_~return_value_sscanf$24~0#1;havoc parse_datestr_~tmp_if_expr$26~0#1;havoc parse_datestr_~return_value_sscanf$25~0#1;havoc parse_datestr_~tmp_if_expr$20~0#1;havoc parse_datestr_~return_value_sscanf$19~0#1;havoc parse_datestr_~tmp_if_expr$18~0#1;havoc parse_datestr_~return_value_sscanf$17~0#1;havoc parse_datestr_~tmp_if_expr$16~0#1;havoc parse_datestr_~return_value_sscanf$15~0#1;havoc parse_datestr_~tmp_if_expr$14~0#1;havoc parse_datestr_~return_value_sscanf$13~0#1;havoc parse_datestr_~tmp_if_expr$12~0#1;havoc parse_datestr_~return_value_sscanf$11~0#1;havoc parse_datestr_~tmp_if_expr$10~1#1;havoc parse_datestr_~return_value_sscanf$9~0#1; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: getopt32_~flags~0#1 := getopt32_#t~bitwise169#1;havoc getopt32_#t~mem167#1;havoc getopt32_#t~bitwise168#1;havoc getopt32_#t~bitwise169#1;call getopt32_#t~mem170#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-2: havoc getopt32_#t~bitwise169#1;assume getopt32_#t~bitwise169#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise169#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise168#1) % 4294967296; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-1: [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296;getopt32_#t~bitwise169#1 := 0; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296;getopt32_#t~bitwise169#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise168#1) % 4294967296); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-6: havoc getopt32_#t~bitwise168#1;assume getopt32_#t~bitwise168#1 % 4294967296 <= getopt32_#t~mem167#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-5: [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_#t~mem167#1; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-7: assume getopt32_#t~mem167#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise168#1 := 0; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-7: assume !(getopt32_#t~mem167#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-9: assume 0 == getopt32_#t~mem167#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080-9: assume !(0 == getopt32_#t~mem167#1 % 4294967296); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3477: __main_#t~ret341#1 := open_#res#1;havoc open_#t~mem410#1, open_#t~nondet411#1, open_#t~nondet412#1, open_#t~mem413#1, open_~__file#1.base, open_~__file#1.offset, open_~__oflag#1, open_~ret~0#1;havoc open_#in~__file#1.base, open_#in~__file#1.offset, open_#in~__oflag#1;assume { :end_inline_open } true;assume -2147483648 <= __main_#t~ret341#1 && __main_#t~ret341#1 <= 2147483647;__main_~fd~0#1 := __main_#t~ret341#1;havoc __main_#t~mem340#1.base, __main_#t~mem340#1.offset;havoc __main_#t~ret341#1; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345-1: assume parse_datestr_#t~mem294#1 + (if 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 <= 2147483647 then 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 else 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345-1: assume !(parse_datestr_#t~mem294#1 + (if 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 <= 2147483647 then 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 else 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: assume parse_datestr_#t~mem294#1 + (if 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 <= 2147483647 then 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 else 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 - 4294967296) <= 2147483647;call write~int(parse_datestr_#t~mem294#1 + (if 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 <= 2147483647 then 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 else 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 - 4294967296), parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem294#1;call parse_datestr_#t~mem295#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,985 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3345: assume !(parse_datestr_#t~mem294#1 + (if 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 <= 2147483647 then 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 else 100 * (parse_datestr_~cur_year~0#1 % 4294967296 / 100) % 4294967296 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-1: [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081: getopt32_~flags~0#1 := getopt32_#t~bitwise172#1;havoc getopt32_#t~mem170#1;havoc getopt32_#t~bitwise171#1;havoc getopt32_#t~bitwise172#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-3: assume 0 == getopt32_#t~bitwise171#1 % 4294967296;getopt32_#t~bitwise172#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-3: assume !(0 == getopt32_#t~bitwise171#1 % 4294967296); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-2: havoc getopt32_#t~bitwise172#1;assume (getopt32_#t~bitwise172#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise172#1 % 4294967296 >= getopt32_#t~bitwise171#1 % 4294967296) && getopt32_#t~bitwise172#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise171#1 % 4294967296; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-5: [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise171#1 % 4294967296;getopt32_#t~bitwise172#1 := getopt32_#t~bitwise171#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise171#1 % 4294967296); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-7: assume getopt32_#t~mem170#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise171#1 := 0; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-7: assume !(getopt32_#t~mem170#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-6: havoc getopt32_#t~bitwise171#1;assume getopt32_#t~bitwise171#1 % 4294967296 <= getopt32_#t~mem170#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-9: assume 0 == getopt32_#t~mem170#1 % 4294967296;getopt32_#t~bitwise171#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-9: assume !(0 == getopt32_#t~mem170#1 % 4294967296); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise171#1 := getopt32_#t~mem170#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3081-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2619-1: SUMMARY for call bb_strtoll_#t~ret50#1 := ret_ERANGE(); srcloc: null [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: assume 0 == xstrtou_range_sfx_#t~mem372#1;havoc xstrtou_range_sfx_#t~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset;havoc xstrtou_range_sfx_#t~mem372#1; [2025-02-08 13:29:50,988 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610: assume !(0 == xstrtou_range_sfx_#t~mem372#1);havoc xstrtou_range_sfx_#t~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset;havoc xstrtou_range_sfx_#t~mem372#1; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2619: bb_strtoll_~return_value_ret_ERANGE$2~0#1 := bb_strtoll_#t~ret50#1;havoc bb_strtoll_#t~ret50#1;bb_strtoll_#res#1 := (if bb_strtoll_~return_value_ret_ERANGE$2~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then bb_strtoll_~return_value_ret_ERANGE$2~0#1 % 18446744073709551616 % 18446744073709551616 else bb_strtoll_~return_value_ret_ERANGE$2~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);call ULTIMATE.dealloc(bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset);havoc bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3610-1: call xstrtou_range_sfx_#t~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem372#1 := read~int(xstrtou_range_sfx_#t~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset, 1); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3478: assume !(__main_~fd~0#1 >= 0); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3478: assume !!(__main_~fd~0#1 >= 0); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3346: assume !(parse_datestr_#t~mem295#1 % 4294967296 >= (4294967246 + parse_datestr_~cur_year~0#1) % 4294967296);havoc parse_datestr_#t~mem295#1;call parse_datestr_#t~mem296#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3346: assume !!(parse_datestr_#t~mem295#1 % 4294967296 >= (4294967246 + parse_datestr_~cur_year~0#1) % 4294967296);havoc parse_datestr_#t~mem295#1; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3379: assume 1 == parse_datestr_~return_value_sscanf$22~0#1;parse_datestr_~end~0#1 := 0; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3379: assume !(1 == parse_datestr_~return_value_sscanf$22~0#1); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3280: assume !(parse_datestr_~lt~0#1.base == 0 && parse_datestr_~lt~0#1.offset == 0);call parse_datestr_#t~mem254#1 := read~int(parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem255#1 := read~int(parse_datestr_~lt~0#1.base, 4 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem256#1 := read~int(parse_datestr_~lt~0#1.base, 8 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem257#1 := read~int(parse_datestr_~lt~0#1.base, 12 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem258#1 := read~int(parse_datestr_~lt~0#1.base, 16 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem259#1 := read~int(parse_datestr_~lt~0#1.base, 20 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem260#1 := read~int(parse_datestr_~lt~0#1.base, 24 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem261#1 := read~int(parse_datestr_~lt~0#1.base, 28 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem262#1 := read~int(parse_datestr_~lt~0#1.base, 32 + parse_datestr_~lt~0#1.offset, 4);call parse_datestr_#t~mem263#1 := read~int(parse_datestr_~lt~0#1.base, 36 + parse_datestr_~lt~0#1.offset, 8);call parse_datestr_#t~mem264#1.base, parse_datestr_#t~mem264#1.offset := read~$Pointer$(parse_datestr_~lt~0#1.base, 44 + parse_datestr_~lt~0#1.offset, 8);call write~int(parse_datestr_#t~mem254#1, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem255#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem256#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem257#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem258#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem259#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem260#1, parse_datestr_~ptm#1.base, 24 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem261#1, parse_datestr_~ptm#1.base, 28 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem262#1, parse_datestr_~ptm#1.base, 32 + parse_datestr_~ptm#1.offset, 4);call write~int(parse_datestr_#t~mem263#1, parse_datestr_~ptm#1.base, 36 + parse_datestr_~ptm#1.offset, 8);call write~$Pointer$(parse_datestr_#t~mem264#1.base, parse_datestr_#t~mem264#1.offset, parse_datestr_~ptm#1.base, 44 + parse_datestr_~ptm#1.offset, 8);havoc parse_datestr_#t~mem254#1;havoc parse_datestr_#t~mem255#1;havoc parse_datestr_#t~mem256#1;havoc parse_datestr_#t~mem257#1;havoc parse_datestr_#t~mem258#1;havoc parse_datestr_#t~mem259#1;havoc parse_datestr_#t~mem260#1;havoc parse_datestr_#t~mem261#1;havoc parse_datestr_#t~mem262#1;havoc parse_datestr_#t~mem263#1;havoc parse_datestr_#t~mem264#1.base, parse_datestr_#t~mem264#1.offset;call ULTIMATE.dealloc(parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset);havoc parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3280: assume !!(parse_datestr_~lt~0#1.base == 0 && parse_datestr_~lt~0#1.offset == 0);havoc parse_datestr_~lt~0#1.base, parse_datestr_~lt~0#1.offset; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3313: assume 6 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet274#1 && parse_datestr_#t~nondet274#1 <= 2147483647;call write~int(parse_datestr_#t~nondet274#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet275#1 && parse_datestr_#t~nondet275#1 <= 2147483647;call write~int(parse_datestr_#t~nondet275#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet276#1 && parse_datestr_#t~nondet276#1 <= 2147483647;call write~int(parse_datestr_#t~nondet276#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet277#1 && parse_datestr_#t~nondet277#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet277#1;assume 0 <= parse_datestr_#t~nondet278#1 && parse_datestr_#t~nondet278#1 <= 4;parse_datestr_~return_value_sscanf$15~0#1 := (if parse_datestr_#t~nondet278#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet278#1 % 4294967296 else parse_datestr_#t~nondet278#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet274#1;havoc parse_datestr_#t~nondet275#1;havoc parse_datestr_#t~nondet276#1;havoc parse_datestr_#t~nondet277#1;havoc parse_datestr_#t~nondet278#1;parse_datestr_~tmp_if_expr$16~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$15~0#1 >= 3 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3313: assume !(6 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$16~0#1 := 0; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082: getopt32_~flags~0#1 := getopt32_#t~bitwise173#1;havoc getopt32_#t~bitwise173#1;call getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-2: havoc getopt32_#t~bitwise173#1;assume getopt32_#t~bitwise173#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-1: [2025-02-08 13:29:50,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := 0; [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3082-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3512: assume -1 == validate_tm_time_~t~2#1;call validate_tm_time_#t~varargs349#1.base, validate_tm_time_#t~varargs349#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(validate_tm_time_~date_str#1.base, validate_tm_time_~date_str#1.offset, validate_tm_time_#t~varargs349#1.base, validate_tm_time_#t~varargs349#1.offset, 8); [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3512: assume !(-1 == validate_tm_time_~t~2#1); [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347-1: assume 100 + parse_datestr_#t~mem296#1 >= -2147483648; [2025-02-08 13:29:50,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347-1: assume !(100 + parse_datestr_#t~mem296#1 >= -2147483648); [2025-02-08 13:29:50,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: assume 100 + parse_datestr_#t~mem296#1 <= 2147483647;call write~int(100 + parse_datestr_#t~mem296#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: assume !(100 + parse_datestr_#t~mem296#1 <= 2147483647); [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume parse_datestr_~return_value_sscanf$2~0#1 >= 5;parse_datestr_~tmp_if_expr$4~0#1 := 1; [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !(parse_datestr_~return_value_sscanf$2~0#1 >= 5);assume -2147483648 <= parse_datestr_#t~nondet221#1 && parse_datestr_#t~nondet221#1 <= 2147483647;call write~int(parse_datestr_#t~nondet221#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet222#1 && parse_datestr_#t~nondet222#1 <= 2147483647;call write~int(parse_datestr_#t~nondet222#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet223#1 && parse_datestr_#t~nondet223#1 <= 2147483647;call write~int(parse_datestr_#t~nondet223#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet224#1 && parse_datestr_#t~nondet224#1 <= 2147483647;call write~int(parse_datestr_#t~nondet224#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet225#1 && parse_datestr_#t~nondet225#1 <= 2147483647;call write~int(parse_datestr_#t~nondet225#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet226#1 && parse_datestr_#t~nondet226#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet226#1;assume 0 <= parse_datestr_#t~nondet227#1 && parse_datestr_#t~nondet227#1 <= 6;parse_datestr_~return_value_sscanf$3~0#1 := (if parse_datestr_#t~nondet227#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet227#1 % 4294967296 else parse_datestr_#t~nondet227#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet221#1;havoc parse_datestr_#t~nondet222#1;havoc parse_datestr_#t~nondet223#1;havoc parse_datestr_#t~nondet224#1;havoc parse_datestr_#t~nondet225#1;havoc parse_datestr_#t~nondet226#1;havoc parse_datestr_#t~nondet227#1;parse_datestr_~tmp_if_expr$4~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$3~0#1 >= 5 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: assume !(0 == handle_errors_~next_ch~0#1);havoc handle_errors_~return_value_bb_ascii_isalnum$2~0#1; [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: assume !!(0 == handle_errors_~next_ch~0#1); [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume !(getopt32_#t~mem174#1.base == 0 && getopt32_#t~mem174#1.offset == 0);havoc getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset;call getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem177#1 := read~int(getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset, 4); [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume !!(getopt32_#t~mem174#1.base == 0 && getopt32_#t~mem174#1.offset == 0);havoc getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset; [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: assume strchrnul_~result~1#1.base == 0 && strchrnul_~result~1#1.offset == 0;strchrnul_#res#1.base, strchrnul_#res#1.offset := strchrnul_~s#1.base, strchrnul_~s#1.offset + strchrnul_#t~nondet436#1;havoc strchrnul_#t~nondet436#1; [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: assume !(strchrnul_~result~1#1.base == 0 && strchrnul_~result~1#1.offset == 0);strchrnul_#res#1.base, strchrnul_#res#1.offset := strchrnul_~result~1#1.base, strchrnul_~result~1#1.offset; [2025-02-08 13:29:50,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3579-1: assume xstrtou_range_sfx_#t~mem361#1 - 9 >= -2147483648; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3579-1: assume !(xstrtou_range_sfx_#t~mem361#1 - 9 >= -2147483648); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3579: assume xstrtou_range_sfx_#t~mem361#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem361#1 - 9;havoc xstrtou_range_sfx_#t~mem361#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~2#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:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3579: assume !(xstrtou_range_sfx_#t~mem361#1 - 9 <= 2147483647); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480: havoc xclose_#t~nondet352#1, xclose_#t~varargs353#1.base, xclose_#t~varargs353#1.offset, xclose_~fd#1, xclose_~return_value_close$1~0#1;havoc xclose_#in~fd#1;assume { :end_inline_xclose } true;call __main_#t~mem342#1.base, __main_#t~mem342#1.offset := read~$Pointer$(__main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset, 8); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3513: SUMMARY for call bb_error_msg_and_die(~#bb_msg_invalid_date~0.base, ~#bb_msg_invalid_date~0.offset, validate_tm_time_#t~varargs349#1.base, validate_tm_time_#t~varargs349#1.offset); srcloc: null [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3480-1: assume { :begin_inline_xclose } true;xclose_#in~fd#1 := __main_~fd~0#1;havoc xclose_#t~nondet352#1, xclose_#t~varargs353#1.base, xclose_#t~varargs353#1.offset, xclose_~fd#1, xclose_~return_value_close$1~0#1;xclose_~fd#1 := xclose_#in~fd#1;havoc xclose_~return_value_close$1~0#1;assume -2147483648 <= xclose_#t~nondet352#1 && xclose_#t~nondet352#1 <= 2147483647;xclose_~return_value_close$1~0#1 := xclose_#t~nondet352#1;havoc xclose_#t~nondet352#1; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3348: assume !((50 + parse_datestr_~cur_year~0#1) % 4294967296 >= parse_datestr_#t~mem297#1 % 4294967296);havoc parse_datestr_#t~mem297#1;call parse_datestr_#t~mem298#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3348: assume !!((50 + parse_datestr_~cur_year~0#1) % 4294967296 >= parse_datestr_#t~mem297#1 % 4294967296);havoc parse_datestr_#t~mem297#1; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3348-1: call parse_datestr_#t~mem297#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume 1 + getopt32_#t~mem177#1 <= 2147483647;call write~int(1 + getopt32_#t~mem177#1, getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset, 4); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: assume !(1 + getopt32_#t~mem177#1 <= 2147483647); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084-1: assume 1 + getopt32_#t~mem177#1 >= -2147483648; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084-1: assume !(1 + getopt32_#t~mem177#1 >= -2147483648); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: call write~int(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc bb_strtoll_~return_value_strtoll$4~0#1;assume -9223372036854775808 <= bb_strtoll_#t~nondet51#1 && bb_strtoll_#t~nondet51#1 <= 9223372036854775807;bb_strtoll_~return_value_strtoll$4~0#1 := bb_strtoll_#t~nondet51#1;havoc bb_strtoll_#t~nondet51#1;bb_strtoll_~v~0#1 := bb_strtoll_~return_value_strtoll$4~0#1;havoc bb_strtoll_~return_value_handle_errors$5~0#1;assume { :begin_inline_handle_errors } true;handle_errors_#in~v#1, handle_errors_#in~endp#1.base, handle_errors_#in~endp#1.offset := bb_strtoll_~v~0#1, bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset;havoc handle_errors_#res#1;havoc handle_errors_#t~mem192#1.base, handle_errors_#t~mem192#1.offset, handle_errors_#t~mem193#1, handle_errors_#t~ret194#1, handle_errors_#t~mem195#1, handle_errors_#t~ret196#1, handle_errors_~return_value_bb_ascii_isalnum$2~0#1, handle_errors_~v#1, handle_errors_~endp#1.base, handle_errors_~endp#1.offset, handle_errors_~next_ch~0#1, handle_errors_~tmp_if_expr$3~1#1, handle_errors_~return_value_ret_ERANGE$1~0#1;handle_errors_~v#1 := handle_errors_#in~v#1;handle_errors_~endp#1.base, handle_errors_~endp#1.offset := handle_errors_#in~endp#1.base, handle_errors_#in~endp#1.offset;call handle_errors_#t~mem192#1.base, handle_errors_#t~mem192#1.offset := read~$Pointer$(handle_errors_~endp#1.base, handle_errors_~endp#1.offset, 8);call handle_errors_#t~mem193#1 := read~int(handle_errors_#t~mem192#1.base, handle_errors_#t~mem192#1.offset, 1);handle_errors_~next_ch~0#1 := handle_errors_#t~mem193#1;havoc handle_errors_#t~mem192#1.base, handle_errors_#t~mem192#1.offset;havoc handle_errors_#t~mem193#1;havoc handle_errors_~tmp_if_expr$3~1#1;havoc handle_errors_~return_value_ret_ERANGE$1~0#1; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3481: assume __main_#t~mem342#1.base == 0 && __main_#t~mem342#1.offset == 0;havoc __main_#t~mem342#1.base, __main_#t~mem342#1.offset;call __main_#t~mem343#1.base, __main_#t~mem343#1.offset := read~$Pointer$(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset, 8); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3481: assume !(__main_#t~mem342#1.base == 0 && __main_#t~mem342#1.offset == 0);havoc __main_#t~mem342#1.base, __main_#t~mem342#1.offset;call __main_#t~mem344#1.base, __main_#t~mem344#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3514-1: validate_tm_time_#res#1 := validate_tm_time_~t~2#1; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3415: call ULTIMATE.dealloc(__main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset);havoc __main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset;call ULTIMATE.dealloc(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset);havoc __main_~#date_str~0#1.base, __main_~#date_str~0#1.offset;call ULTIMATE.dealloc(__main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset);havoc __main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448-1: assume !(__main_#t~mem347#1.base == 0 && __main_#t~mem347#1.offset == 0);havoc __main_#t~mem347#1.base, __main_#t~mem347#1.offset; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448-1: assume !!(__main_#t~mem347#1.base == 0 && __main_#t~mem347#1.offset == 0);havoc __main_#t~mem347#1.base, __main_#t~mem347#1.offset; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349-1: assume parse_datestr_#t~mem298#1 - 100 >= -2147483648; [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349-1: assume !(parse_datestr_#t~mem298#1 - 100 >= -2147483648); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349: assume parse_datestr_#t~mem298#1 - 100 <= 2147483647;call write~int(parse_datestr_#t~mem298#1 - 100, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3349: assume !(parse_datestr_#t~mem298#1 - 100 <= 2147483647); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3085: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem178#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3085: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3614: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3614: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: assume -2147483648 <= handle_errors_#t~ret194#1 && handle_errors_#t~ret194#1 <= 2147483647;handle_errors_~return_value_bb_ascii_isalnum$2~0#1 := handle_errors_#t~ret194#1;havoc handle_errors_#t~ret194#1; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152-1: SUMMARY for call handle_errors_#t~ret194#1 := bb_ascii_isalnum(handle_errors_~next_ch~0#1); srcloc: null [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3483: assume !(__main_#t~mem343#1.base == 0 && __main_#t~mem343#1.offset == 0);havoc __main_#t~mem343#1.base, __main_#t~mem343#1.offset; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3483: assume !!(__main_#t~mem343#1.base == 0 && __main_#t~mem343#1.offset == 0);havoc __main_#t~mem343#1.base, __main_#t~mem343#1.offset; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3384: assume !(0 == parse_datestr_~end~0#1);call parse_datestr_#t~varargs313#1.base, parse_datestr_#t~varargs313#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, parse_datestr_#t~varargs313#1.base, parse_datestr_#t~varargs313#1.offset, 8); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3384: assume !!(0 == parse_datestr_~end~0#1); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252: assume !(parse_datestr_~return_value___builtin_strchr$23~0#1.base == 0 && parse_datestr_~return_value___builtin_strchr$23~0#1.offset == 0);assume -2147483648 <= parse_datestr_#t~nondet237#1 && parse_datestr_#t~nondet237#1 <= 2147483647;call write~int(parse_datestr_#t~nondet237#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet238#1 && parse_datestr_#t~nondet238#1 <= 2147483647;call write~int(parse_datestr_#t~nondet238#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet239#1 && parse_datestr_#t~nondet239#1 <= 2147483647;call write~int(parse_datestr_#t~nondet239#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet240#1 && parse_datestr_#t~nondet240#1 <= 2147483647;call write~int(parse_datestr_#t~nondet240#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet241#1 && parse_datestr_#t~nondet241#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet241#1;assume 0 <= parse_datestr_#t~nondet242#1 && parse_datestr_#t~nondet242#1 <= 5;parse_datestr_~return_value_sscanf$24~0#1 := (if parse_datestr_#t~nondet242#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet242#1 % 4294967296 else parse_datestr_#t~nondet242#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet237#1;havoc parse_datestr_#t~nondet238#1;havoc parse_datestr_#t~nondet239#1;havoc parse_datestr_#t~nondet240#1;havoc parse_datestr_#t~nondet241#1;havoc parse_datestr_#t~nondet242#1; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252: assume !!(parse_datestr_~return_value___builtin_strchr$23~0#1.base == 0 && parse_datestr_~return_value___builtin_strchr$23~0#1.offset == 0);parse_datestr_~tmp_if_expr$27~0#1 := 0; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume !(0 == handle_errors_~return_value_bb_ascii_isalnum$2~0#1);handle_errors_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume !!(0 == handle_errors_~return_value_bb_ascii_isalnum$2~0#1);call handle_errors_#t~mem195#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);handle_errors_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != handle_errors_#t~mem195#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3087: assume 1 == getopt32_#t~mem178#1;havoc getopt32_#t~mem178#1;call getopt32_#t~mem179#1.base, getopt32_#t~mem179#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~mem179#1.base, getopt32_#t~mem179#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset, llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset, llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#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:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3087: assume !(1 == getopt32_#t~mem178#1);havoc getopt32_#t~mem178#1;call getopt32_#t~mem180#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3616: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#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:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3616: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: assume !(0 == bb_perror_msg_#t~mem38#1);havoc bb_perror_msg_#t~mem38#1; [2025-02-08 13:29:50,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: assume !!(0 == bb_perror_msg_#t~mem38#1);havoc bb_perror_msg_#t~mem38#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := 0, 0; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3583: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3385: SUMMARY for call bb_error_msg_and_die(~#bb_msg_invalid_date~0.base, ~#bb_msg_invalid_date~0.offset, parse_datestr_#t~varargs313#1.base, parse_datestr_#t~varargs313#1.offset); srcloc: null [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3286: parse_datestr_~end~0#1 := 49;call ULTIMATE.dealloc(parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset);havoc parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset;havoc parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3584: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem362#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem362#1;havoc xstrtou_range_sfx_#t~mem362#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~nondet53#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~1#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~1#1;bb_strtoui_~v~1#1 := bb_strtoui_#t~nondet53#1;havoc bb_strtoui_#t~nondet53#1; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3584: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3320: assume 0 == parse_datestr_~tmp_if_expr$16~0#1 % 256; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3320: assume !(0 == parse_datestr_~tmp_if_expr$16~0#1 % 256); [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2627: bb_strtoll_#t~ret52#1 := handle_errors_#res#1;havoc handle_errors_#t~mem192#1.base, handle_errors_#t~mem192#1.offset, handle_errors_#t~mem193#1, handle_errors_#t~ret194#1, handle_errors_#t~mem195#1, handle_errors_#t~ret196#1, handle_errors_~return_value_bb_ascii_isalnum$2~0#1, handle_errors_~v#1, handle_errors_~endp#1.base, handle_errors_~endp#1.offset, handle_errors_~next_ch~0#1, handle_errors_~tmp_if_expr$3~1#1, handle_errors_~return_value_ret_ERANGE$1~0#1;havoc handle_errors_#in~v#1, handle_errors_#in~endp#1.base, handle_errors_#in~endp#1.offset;assume { :end_inline_handle_errors } true;bb_strtoll_~return_value_handle_errors$5~0#1 := bb_strtoll_#t~ret52#1;havoc bb_strtoll_#t~ret52#1;bb_strtoll_#res#1 := (if bb_strtoll_~return_value_handle_errors$5~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then bb_strtoll_~return_value_handle_errors$5~0#1 % 18446744073709551616 % 18446744073709551616 else bb_strtoll_~return_value_handle_errors$5~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);call ULTIMATE.dealloc(bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset);havoc bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561-1: assume true;bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset := 0, 0; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561-1: assume true;havoc bb_perror_msg_#t~nondet40#1;assume bb_perror_msg_#t~nondet40#1 % 18446744073709551616 > 0;call bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset := #Ultimate.allocOnHeap(bb_perror_msg_#t~nondet40#1 % 18446744073709551616);call write~int(0, bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet40#1 % 18446744073709551616 - 1, 1); [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2561: bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset := bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset;havoc bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset;havoc bb_perror_msg_#t~nondet40#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3519: xatoi_positive_#t~ret350#1 := xatou_range_#res#1;havoc xatou_range_#t~ret351#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~ret350#1;havoc xatoi_positive_#t~ret350#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:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3354: assume 12 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet299#1 && parse_datestr_#t~nondet299#1 <= 2147483647;call write~int(parse_datestr_#t~nondet299#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet300#1 && parse_datestr_#t~nondet300#1 <= 2147483647;call write~int(parse_datestr_#t~nondet300#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet301#1 && parse_datestr_#t~nondet301#1 <= 2147483647;call write~int(parse_datestr_#t~nondet301#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet302#1 && parse_datestr_#t~nondet302#1 <= 2147483647;call write~int(parse_datestr_#t~nondet302#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet303#1 && parse_datestr_#t~nondet303#1 <= 2147483647;call write~int(parse_datestr_#t~nondet303#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet304#1 && parse_datestr_#t~nondet304#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet304#1;assume 0 <= parse_datestr_#t~nondet305#1 && parse_datestr_#t~nondet305#1 <= 6;parse_datestr_~return_value_sscanf$9~0#1 := (if parse_datestr_#t~nondet305#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet305#1 % 4294967296 else parse_datestr_#t~nondet305#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet299#1;havoc parse_datestr_#t~nondet300#1;havoc parse_datestr_#t~nondet301#1;havoc parse_datestr_#t~nondet302#1;havoc parse_datestr_#t~nondet303#1;havoc parse_datestr_#t~nondet304#1;havoc parse_datestr_#t~nondet305#1;parse_datestr_~tmp_if_expr$10~1#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$9~0#1 >= 5 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3354: assume !(12 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$10~1#1 := 0; [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3222: assume !(0 == parse_datestr_~tmp_if_expr$4~0#1 % 256);call parse_datestr_#t~mem228#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3222: assume !!(0 == parse_datestr_~tmp_if_expr$4~0#1 % 256);assume { :begin_inline_strptime } true;strptime_#in~s#1.base, strptime_#in~s#1.offset, strptime_#in~format#1.base, strptime_#in~format#1.offset, strptime_#in~result#1.base, strptime_#in~result#1.offset := parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, 8, 0, parse_datestr_~ptm#1.base, parse_datestr_~ptm#1.offset;havoc strptime_#res#1.base, strptime_#res#1.offset;havoc strptime_#t~nondet437#1, strptime_#t~nondet438#1, strptime_#t~nondet439#1, strptime_#t~nondet440#1, strptime_#t~nondet441#1, strptime_#t~nondet442#1, strptime_#t~nondet443#1, strptime_#t~nondet444#1, strptime_#t~nondet445#1, strptime_#t~mem446#1, strptime_#t~mem447#1, strptime_#t~short448#1, strptime_#t~mem449#1, strptime_#t~mem450#1, strptime_#t~short451#1, strptime_#t~mem452#1, strptime_#t~mem453#1, strptime_#t~short454#1, strptime_#t~mem455#1, strptime_#t~mem456#1, strptime_#t~short457#1, strptime_#t~mem458#1, strptime_#t~mem459#1, strptime_#t~short460#1, strptime_#t~mem461#1, strptime_#t~mem462#1, strptime_#t~short463#1, strptime_#t~mem464#1, strptime_#t~mem465#1, strptime_#t~short466#1, strptime_#t~mem467#1, strptime_#t~mem468#1, strptime_#t~short469#1, strptime_#t~nondet470#1, strptime_#t~nondet471#1, strptime_~s#1.base, strptime_~s#1.offset, strptime_~format#1.base, strptime_~format#1.offset, strptime_~result#1.base, strptime_~result#1.offset, strptime_~s_len~0#1, strptime_~last_ok~0#1;strptime_~s#1.base, strptime_~s#1.offset := strptime_#in~s#1.base, strptime_#in~s#1.offset;strptime_~format#1.base, strptime_~format#1.offset := strptime_#in~format#1.base, strptime_#in~format#1.offset;strptime_~result#1.base, strptime_~result#1.offset := strptime_#in~result#1.base, strptime_#in~result#1.offset;havoc strptime_#t~nondet437#1;assume -2147483648 <= strptime_#t~nondet437#1 && strptime_#t~nondet437#1 <= 2147483647;call write~int(strptime_#t~nondet437#1, strptime_~result#1.base, strptime_~result#1.offset, 4);havoc strptime_#t~nondet437#1;havoc strptime_#t~nondet438#1;assume -2147483648 <= strptime_#t~nondet438#1 && strptime_#t~nondet438#1 <= 2147483647;call write~int(strptime_#t~nondet438#1, strptime_~result#1.base, 4 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet438#1;havoc strptime_#t~nondet439#1;assume -2147483648 <= strptime_#t~nondet439#1 && strptime_#t~nondet439#1 <= 2147483647;call write~int(strptime_#t~nondet439#1, strptime_~result#1.base, 8 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet439#1;havoc strptime_#t~nondet440#1;assume -2147483648 <= strptime_#t~nondet440#1 && strptime_#t~nondet440#1 <= 2147483647;call write~int(strptime_#t~nondet440#1, strptime_~result#1.base, 12 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet440#1;havoc strptime_#t~nondet441#1;assume -2147483648 <= strptime_#t~nondet441#1 && strptime_#t~nondet441#1 <= 2147483647;call write~int(strptime_#t~nondet441#1, strptime_~result#1.base, 16 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet441#1;havoc strptime_#t~nondet442#1;assume -2147483648 <= strptime_#t~nondet442#1 && strptime_#t~nondet442#1 <= 2147483647;call write~int(strptime_#t~nondet442#1, strptime_~result#1.base, 20 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet442#1;havoc strptime_#t~nondet443#1;assume -2147483648 <= strptime_#t~nondet443#1 && strptime_#t~nondet443#1 <= 2147483647;call write~int(strptime_#t~nondet443#1, strptime_~result#1.base, 24 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet443#1;havoc strptime_#t~nondet444#1;assume -2147483648 <= strptime_#t~nondet444#1 && strptime_#t~nondet444#1 <= 2147483647;call write~int(strptime_#t~nondet444#1, strptime_~result#1.base, 28 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet444#1;havoc strptime_#t~nondet445#1;assume -2147483648 <= strptime_#t~nondet445#1 && strptime_#t~nondet445#1 <= 2147483647;call write~int(strptime_#t~nondet445#1, strptime_~result#1.base, 32 + strptime_~result#1.offset, 4);havoc strptime_#t~nondet445#1;call strptime_#t~mem446#1 := read~int(strptime_~result#1.base, strptime_~result#1.offset, 4);strptime_#t~short448#1 := strptime_#t~mem446#1 >= 0; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3255: assume parse_datestr_~return_value_sscanf$24~0#1 >= 4;parse_datestr_~tmp_if_expr$26~0#1 := 1; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3255: assume !(parse_datestr_~return_value_sscanf$24~0#1 >= 4);assume -2147483648 <= parse_datestr_#t~nondet243#1 && parse_datestr_#t~nondet243#1 <= 2147483647;call write~int(parse_datestr_#t~nondet243#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet244#1 && parse_datestr_#t~nondet244#1 <= 2147483647;call write~int(parse_datestr_#t~nondet244#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet245#1 && parse_datestr_#t~nondet245#1 <= 2147483647;call write~int(parse_datestr_#t~nondet245#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet246#1 && parse_datestr_#t~nondet246#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet246#1;assume 0 <= parse_datestr_#t~nondet247#1 && parse_datestr_#t~nondet247#1 <= 4;parse_datestr_~return_value_sscanf$25~0#1 := (if parse_datestr_#t~nondet247#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet247#1 % 4294967296 else parse_datestr_#t~nondet247#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet243#1;havoc parse_datestr_#t~nondet244#1;havoc parse_datestr_#t~nondet245#1;havoc parse_datestr_#t~nondet246#1;havoc parse_datestr_#t~nondet247#1;parse_datestr_~tmp_if_expr$26~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$25~0#1 >= 3 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: assume 2 == getopt32_#t~mem180#1;havoc getopt32_#t~mem180#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~ret350#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~ret351#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~mem359#1, xstrtou_range_sfx_#t~mem360#1, xstrtou_range_sfx_#t~mem361#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem362#1, xstrtou_range_sfx_#t~ret363#1, xstrtou_range_sfx_#t~mem364#1.base, xstrtou_range_sfx_#t~mem364#1.offset, xstrtou_range_sfx_#t~mem365#1, xstrtou_range_sfx_#t~mem366#1, xstrtou_range_sfx_#t~mem367#1.base, xstrtou_range_sfx_#t~mem367#1.offset, xstrtou_range_sfx_#t~nondet368#1, xstrtou_range_sfx_#t~mem369#1, xstrtou_range_sfx_#t~mem370#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~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset, xstrtou_range_sfx_#t~mem372#1, xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset, xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#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~0#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~4#1, xstrtou_range_sfx_~tmp_if_expr$3~2#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~0#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~4#1;call xstrtou_range_sfx_#t~mem359#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3090: assume !(2 == getopt32_#t~mem180#1);havoc getopt32_#t~mem180#1;call getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3322: assume 8 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet279#1 && parse_datestr_#t~nondet279#1 <= 2147483647;call write~int(parse_datestr_#t~nondet279#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet280#1 && parse_datestr_#t~nondet280#1 <= 2147483647;call write~int(parse_datestr_#t~nondet280#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet281#1 && parse_datestr_#t~nondet281#1 <= 2147483647;call write~int(parse_datestr_#t~nondet281#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet282#1 && parse_datestr_#t~nondet282#1 <= 2147483647;call write~int(parse_datestr_#t~nondet282#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet283#1 && parse_datestr_#t~nondet283#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet283#1;assume 0 <= parse_datestr_#t~nondet284#1 && parse_datestr_#t~nondet284#1 <= 5;parse_datestr_~return_value_sscanf$13~0#1 := (if parse_datestr_#t~nondet284#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet284#1 % 4294967296 else parse_datestr_#t~nondet284#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet279#1;havoc parse_datestr_#t~nondet280#1;havoc parse_datestr_#t~nondet281#1;havoc parse_datestr_#t~nondet282#1;havoc parse_datestr_#t~nondet283#1;havoc parse_datestr_#t~nondet284#1;parse_datestr_~tmp_if_expr$14~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$13~0#1 >= 4 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3322: assume !(8 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$14~0#1 := 0; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3289: havoc parse_datestr_~cur_year~0#1, parse_datestr_~len~0#1, parse_datestr_~return_value_strchrnul$8~0#1.base, parse_datestr_~return_value_strchrnul$8~0#1.offset; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3157: assume !(0 == handle_errors_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3157: assume !!(0 == handle_errors_~tmp_if_expr$3~1#1 % 256);call write~int(22, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc handle_errors_~return_value_bb_ascii_isalnum$2~0#1; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: havoc lutimes_#t~ret476#1;##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret528#1 := lutimes_#res#1;havoc lutimes_#t~ret476#1, lutimes_~filename#1.base, lutimes_~filename#1.offset, lutimes_~#times#1.base, lutimes_~#times#1.offset;havoc lutimes_#in~filename#1.base, lutimes_#in~filename#1.offset, lutimes_#in~times#1.base, lutimes_#in~times#1.offset;assume { :end_inline_lutimes } true;assume -2147483648 <= ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret528#1 && ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret528#1 <= 2147483647;##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~funptrres527#1 := ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret528#1; [2025-02-08 13:29:50,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume parse_datestr_#t~mem228#1 - 1900 <= 2147483647;call write~int(parse_datestr_#t~mem228#1 - 1900, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem228#1;call parse_datestr_#t~mem229#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !(parse_datestr_#t~mem228#1 - 1900 <= 2147483647); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224-1: assume parse_datestr_#t~mem228#1 - 1900 >= -2147483648; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224-1: assume !(parse_datestr_#t~mem228#1 - 1900 >= -2147483648); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3621-1: SUMMARY for call bb_error_msg_and_die(16, 0, xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset); srcloc: null [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3588: xstrtou_range_sfx_#t~ret363#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet53#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~1#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~0#1 := xstrtou_range_sfx_#t~ret363#1;havoc xstrtou_range_sfx_#t~ret363#1;call xstrtou_range_sfx_#t~mem364#1.base, xstrtou_range_sfx_#t~mem364#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3621: havoc xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3621-2: call xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs373#1.base, 8 + xstrtou_range_sfx_#t~varargs373#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs373#1.base, 16 + xstrtou_range_sfx_#t~varargs373#1.offset, 8); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225-1: assume parse_datestr_#t~mem229#1 - 1 >= -2147483648; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225-1: assume !(parse_datestr_#t~mem229#1 - 1 >= -2147483648); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: assume parse_datestr_#t~mem229#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem229#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem229#1; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: assume !(parse_datestr_#t~mem229#1 - 1 <= 2147483647); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3159-1: SUMMARY for call handle_errors_#t~ret196#1 := ret_ERANGE(); srcloc: null [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3159: handle_errors_~return_value_ret_ERANGE$1~0#1 := handle_errors_#t~ret196#1;havoc handle_errors_#t~ret196#1;handle_errors_#res#1 := handle_errors_~return_value_ret_ERANGE$1~0#1; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3093: getopt32_#t~ret181#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret350#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~ret181#1 && getopt32_#t~ret181#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret181#1;havoc getopt32_#t~ret181#1;call getopt32_#t~mem182#1.base, getopt32_#t~mem182#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~mem182#1.base, getopt32_#t~mem182#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem182#1.base, getopt32_#t~mem182#1.offset; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3589: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem364#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem364#1.offset);havoc xstrtou_range_sfx_#t~mem364#1.base, xstrtou_range_sfx_#t~mem364#1.offset;call xstrtou_range_sfx_#t~mem365#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3589: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem364#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem364#1.offset);havoc xstrtou_range_sfx_#t~mem364#1.base, xstrtou_range_sfx_#t~mem364#1.offset; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: assume -2147483648 <= __main_#t~ret345#1 && __main_#t~ret345#1 <= 2147483647;havoc __main_#t~mem344#1.base, __main_#t~mem344#1.offset;havoc __main_#t~ret345#1; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490-1: SUMMARY for call __main_#t~ret345#1 := utimes(__main_#t~mem344#1.base, __main_#t~mem344#1.offset, __main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset); srcloc: null [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: call ULTIMATE.dealloc(bb_perror_msg_~p~1#1.base, 0);havoc bb_perror_msg_#t~mem38#1, bb_perror_msg_#t~nondet39#1.base, bb_perror_msg_#t~nondet39#1.offset, bb_perror_msg_#t~nondet40#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~1#1.base, bb_perror_msg_~p~1#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;havoc bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;assume { :end_inline_bb_perror_msg } true;havoc bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset;havoc bb_simple_perror_msg_#t~varargs44#1.base, bb_simple_perror_msg_#t~varargs44#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;havoc bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;assume { :end_inline_bb_simple_perror_msg } true;havoc __main_#t~mem346#1.base, __main_#t~mem346#1.offset; [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-1: SUMMARY for call bb_verror_msg(bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~1#1.base, bb_perror_msg_~p~1#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset); srcloc: null [2025-02-08 13:29:50,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: parse_datestr_#t~ret266#1.base, parse_datestr_#t~ret266#1.offset := strchrnul_#res#1.base, strchrnul_#res#1.offset;havoc strchrnul_#t~nondet435#1.base, strchrnul_#t~nondet435#1.offset, strchrnul_#t~nondet436#1, strchrnul_~s#1.base, strchrnul_~s#1.offset, strchrnul_~c#1, strchrnul_~result~1#1.base, strchrnul_~result~1#1.offset;havoc strchrnul_#in~s#1.base, strchrnul_#in~s#1.offset, strchrnul_#in~c#1;assume { :end_inline_strchrnul } true;parse_datestr_~return_value_strchrnul$8~0#1.base, parse_datestr_~return_value_strchrnul$8~0#1.offset := parse_datestr_#t~ret266#1.base, parse_datestr_#t~ret266#1.offset;havoc parse_datestr_#t~ret266#1.base, parse_datestr_#t~ret266#1.offset;parse_datestr_~len~0#1 := (if (parse_datestr_~return_value_strchrnul$8~0#1.offset - parse_datestr_~date_str#1.offset) % 4294967296 <= 2147483647 then (parse_datestr_~return_value_strchrnul$8~0#1.offset - parse_datestr_~date_str#1.offset) % 4294967296 else (parse_datestr_~return_value_strchrnul$8~0#1.offset - parse_datestr_~date_str#1.offset) % 4294967296 - 4294967296); [2025-02-08 13:29:51,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3591: assume 0 == xstrtou_range_sfx_#t~mem365#1;havoc xstrtou_range_sfx_#t~mem365#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:51,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3591: assume !(0 == xstrtou_range_sfx_#t~mem365#1);havoc xstrtou_range_sfx_#t~mem365#1; [2025-02-08 13:29:51,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2634: assume bb_strtoui_~v~1#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:29:51,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2634: assume !(bb_strtoui_~v~1#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~1#1; [2025-02-08 13:29:51,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: assume !(0 == parse_datestr_~tmp_if_expr$10~1#1 % 256);call parse_datestr_#t~mem306#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: assume !!(0 == parse_datestr_~tmp_if_expr$10~1#1 % 256);call parse_datestr_#t~varargs308#1.base, parse_datestr_#t~varargs308#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, parse_datestr_#t~varargs308#1.base, parse_datestr_#t~varargs308#1.offset, 8); [2025-02-08 13:29:51,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: parse_datestr_~tmp_if_expr$27~0#1 := (if 0 == (if 0 != (if 0 != parse_datestr_~tmp_if_expr$26~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume 2 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet267#1 && parse_datestr_#t~nondet267#1 <= 2147483647;call write~int(parse_datestr_#t~nondet267#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet268#1 && parse_datestr_#t~nondet268#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet268#1;assume 0 <= parse_datestr_#t~nondet269#1 && parse_datestr_#t~nondet269#1 <= 2;parse_datestr_~return_value_sscanf$19~0#1 := (if parse_datestr_#t~nondet269#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet269#1 % 4294967296 else parse_datestr_#t~nondet269#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet267#1;havoc parse_datestr_#t~nondet268#1;havoc parse_datestr_#t~nondet269#1;parse_datestr_~tmp_if_expr$20~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$19~0#1 >= 1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,002 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume !(2 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$20~0#1 := 0; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: parse_datestr_#t~ret230#1.base, parse_datestr_#t~ret230#1.offset := strptime_#res#1.base, strptime_#res#1.offset;havoc strptime_#t~nondet437#1, strptime_#t~nondet438#1, strptime_#t~nondet439#1, strptime_#t~nondet440#1, strptime_#t~nondet441#1, strptime_#t~nondet442#1, strptime_#t~nondet443#1, strptime_#t~nondet444#1, strptime_#t~nondet445#1, strptime_#t~mem446#1, strptime_#t~mem447#1, strptime_#t~short448#1, strptime_#t~mem449#1, strptime_#t~mem450#1, strptime_#t~short451#1, strptime_#t~mem452#1, strptime_#t~mem453#1, strptime_#t~short454#1, strptime_#t~mem455#1, strptime_#t~mem456#1, strptime_#t~short457#1, strptime_#t~mem458#1, strptime_#t~mem459#1, strptime_#t~short460#1, strptime_#t~mem461#1, strptime_#t~mem462#1, strptime_#t~short463#1, strptime_#t~mem464#1, strptime_#t~mem465#1, strptime_#t~short466#1, strptime_#t~mem467#1, strptime_#t~mem468#1, strptime_#t~short469#1, strptime_#t~nondet470#1, strptime_#t~nondet471#1, strptime_~s#1.base, strptime_~s#1.offset, strptime_~format#1.base, strptime_~format#1.offset, strptime_~result#1.base, strptime_~result#1.offset, strptime_~s_len~0#1, strptime_~last_ok~0#1;havoc strptime_#in~s#1.base, strptime_#in~s#1.offset, strptime_#in~format#1.base, strptime_#in~format#1.offset, strptime_#in~result#1.base, strptime_#in~result#1.offset;assume { :end_inline_strptime } true;parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset := parse_datestr_#t~ret230#1.base, parse_datestr_#t~ret230#1.offset;havoc parse_datestr_#t~ret230#1.base, parse_datestr_#t~ret230#1.offset; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: assume !(getopt32_#t~mem183#1.base == 0 && getopt32_#t~mem183#1.offset == 0);havoc getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset;call getopt32_#t~mem184#1.base, getopt32_#t~mem184#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~mem184#1.base, getopt32_#t~mem184#1.offset, 8); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: assume !!(getopt32_#t~mem183#1.base == 0 && getopt32_#t~mem183#1.offset == 0);havoc getopt32_#t~mem183#1.base, getopt32_#t~mem183#1.offset; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: assume !(0 == parse_datestr_~tmp_if_expr$14~0#1 % 256);call parse_datestr_#t~mem285#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: assume !!(0 == parse_datestr_~tmp_if_expr$14~0#1 % 256); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !(parse_datestr_~endp~0#1.base == 0 && parse_datestr_~endp~0#1.offset == 0);call parse_datestr_#t~mem231#1 := read~int(parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset, 1);parse_datestr_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 0 == parse_datestr_#t~mem231#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !!(parse_datestr_~endp~0#1.base == 0 && parse_datestr_~endp~0#1.offset == 0);parse_datestr_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164-1: handle_errors_#res#1 := handle_errors_~v#1; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: call ULTIMATE.dealloc(bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset);havoc bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset;bb_strtol_#t~ret45#1 := bb_strtoll_#res#1;havoc bb_strtoll_#t~mem46#1, bb_strtoll_#t~mem47#1, bb_strtoll_#t~mem48#1, bb_strtoll_#t~ret49#1, bb_strtoll_#t~ret50#1, bb_strtoll_#t~nondet51#1, bb_strtoll_#t~ret52#1, bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset, bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset, bb_strtoll_~base#1, bb_strtoll_~v~0#1, bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset, bb_strtoll_~first~0#1, bb_strtoll_~tmp_if_expr$1~0#1, bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1, bb_strtoll_~return_value_ret_ERANGE$2~0#1, bb_strtoll_~return_value_strtoll$4~0#1, bb_strtoll_~return_value_handle_errors$5~0#1;havoc bb_strtoll_#in~arg#1.base, bb_strtoll_#in~arg#1.offset, bb_strtoll_#in~endp#1.base, bb_strtoll_#in~endp#1.offset, bb_strtoll_#in~base#1;assume { :end_inline_bb_strtoll } true;assume -9223372036854775808 <= bb_strtol_#t~ret45#1 && bb_strtol_#t~ret45#1 <= 9223372036854775807;bb_strtol_~return_value_bb_strtoll$1~0#1 := bb_strtol_#t~ret45#1;havoc bb_strtol_#t~ret45#1;bb_strtol_#res#1 := bb_strtol_~return_value_bb_strtoll$1~0#1; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: assume parse_datestr_#t~mem285#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem285#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330: assume !(parse_datestr_#t~mem285#1 - 1 <= 2147483647); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3363-1: assume parse_datestr_#t~mem306#1 - 1900 >= -2147483648; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3363-1: assume !(parse_datestr_#t~mem306#1 - 1900 >= -2147483648); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3363: assume parse_datestr_#t~mem306#1 - 1900 <= 2147483647;call write~int(parse_datestr_#t~mem306#1 - 1900, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem306#1;call parse_datestr_#t~mem307#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3363: assume !(parse_datestr_#t~mem306#1 - 1900 <= 2147483647); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330-1: assume parse_datestr_#t~mem285#1 - 1 >= -2147483648; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3330-1: assume !(parse_datestr_#t~mem285#1 - 1 >= -2147483648); [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short448#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727: havoc strptime_#t~mem446#1;havoc strptime_#t~mem447#1;havoc strptime_#t~short448#1;call strptime_#t~mem449#1 := read~int(strptime_~result#1.base, 4 + strptime_~result#1.offset, 4);strptime_#t~short451#1 := strptime_#t~mem449#1 >= 0; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3628: havoc xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#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~ret351#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem359#1, xstrtou_range_sfx_#t~mem360#1, xstrtou_range_sfx_#t~mem361#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem362#1, xstrtou_range_sfx_#t~ret363#1, xstrtou_range_sfx_#t~mem364#1.base, xstrtou_range_sfx_#t~mem364#1.offset, xstrtou_range_sfx_#t~mem365#1, xstrtou_range_sfx_#t~mem366#1, xstrtou_range_sfx_#t~mem367#1.base, xstrtou_range_sfx_#t~mem367#1.offset, xstrtou_range_sfx_#t~nondet368#1, xstrtou_range_sfx_#t~mem369#1, xstrtou_range_sfx_#t~mem370#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~mem371#1.base, xstrtou_range_sfx_#t~mem371#1.offset, xstrtou_range_sfx_#t~mem372#1, xstrtou_range_sfx_#t~varargs373#1.base, xstrtou_range_sfx_#t~varargs373#1.offset, xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#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~0#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~4#1, xstrtou_range_sfx_~tmp_if_expr$3~2#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~ret351#1;havoc xatou_range_#t~ret351#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:29:51,003 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727-2: assume strptime_#t~short448#1;call strptime_#t~mem447#1 := read~int(strptime_~result#1.base, strptime_~result#1.offset, 4);strptime_#t~short448#1 := strptime_#t~mem447#1 <= 60; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727-2: assume !strptime_#t~short448#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3628-2: call xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#1.offset, 8); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595-1: assume !(0 == xstrtou_range_sfx_#t~mem366#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem366#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595-1: assume !!(0 == xstrtou_range_sfx_#t~mem366#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem366#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3628-1: SUMMARY for call bb_error_msg_and_die(17, 0, xstrtou_range_sfx_#t~varargs374#1.base, xstrtou_range_sfx_#t~varargs374#1.offset); srcloc: null [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595: assume true;call xstrtou_range_sfx_#t~mem366#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595: assume !true; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: assume parse_datestr_#t~mem307#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem307#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem307#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: assume !(parse_datestr_#t~mem307#1 - 1 <= 2147483647); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364-1: assume parse_datestr_#t~mem307#1 - 1 >= -2147483648; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364-1: assume !(parse_datestr_#t~mem307#1 - 1 >= -2147483648); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067-1: assume true; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3067-1: assume !true; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc strptime_#t~mem449#1;havoc strptime_#t~mem450#1;havoc strptime_#t~short451#1;call strptime_#t~mem452#1 := read~int(strptime_~result#1.base, 8 + strptime_~result#1.offset, 4);strptime_#t~short454#1 := strptime_#t~mem452#1 >= 0; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: assume open_~ret~0#1 < 0;havoc open_#t~nondet412#1;assume -2147483648 <= open_#t~nondet412#1 && open_#t~nondet412#1 <= 2147483647;call write~int(open_#t~nondet412#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc open_#t~nondet412#1;call open_#t~mem413#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: assume !(open_~ret~0#1 < 0);open_#res#1 := open_~ret~0#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728-2: assume strptime_#t~short451#1;call strptime_#t~mem450#1 := read~int(strptime_~result#1.base, 4 + strptime_~result#1.offset, 4);strptime_#t~short451#1 := strptime_#t~mem450#1 < 60; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728-2: assume !strptime_#t~short451#1; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short451#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2605: assume bb_strtoll_~endp#1.base == 0 && bb_strtoll_~endp#1.offset == 0;bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset := bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2605: assume !(bb_strtoll_~endp#1.base == 0 && bb_strtoll_~endp#1.offset == 0); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266: assume !(0 == parse_datestr_~tmp_if_expr$27~0#1 % 256);call parse_datestr_#t~mem248#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266: assume !!(0 == parse_datestr_~tmp_if_expr$27~0#1 % 256);call parse_datestr_#t~mem250#1 := read~int(parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, 1); [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short454#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729: havoc strptime_#t~mem452#1;havoc strptime_#t~mem453#1;havoc strptime_#t~short454#1;call strptime_#t~mem455#1 := read~int(strptime_~result#1.base, 12 + strptime_~result#1.offset, 4);strptime_#t~short457#1 := strptime_#t~mem455#1 > 0; [2025-02-08 13:29:51,004 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729-2: assume strptime_#t~short454#1;call strptime_#t~mem453#1 := read~int(strptime_~result#1.base, 8 + strptime_~result#1.offset, 4);strptime_#t~short454#1 := strptime_#t~mem453#1 < 24; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3729-2: assume !strptime_#t~short454#1; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3597: 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~mem367#1.base, xstrtou_range_sfx_#t~mem367#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~nondet368#1;havoc xstrtou_range_sfx_#t~mem367#1.base, xstrtou_range_sfx_#t~mem367#1.offset;havoc xstrtou_range_sfx_#t~nondet368#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3333: assume 10 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet286#1 && parse_datestr_#t~nondet286#1 <= 2147483647;call write~int(parse_datestr_#t~nondet286#1, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet287#1 && parse_datestr_#t~nondet287#1 <= 2147483647;call write~int(parse_datestr_#t~nondet287#1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet288#1 && parse_datestr_#t~nondet288#1 <= 2147483647;call write~int(parse_datestr_#t~nondet288#1, parse_datestr_~ptm#1.base, 12 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet289#1 && parse_datestr_#t~nondet289#1 <= 2147483647;call write~int(parse_datestr_#t~nondet289#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet290#1 && parse_datestr_#t~nondet290#1 <= 2147483647;call write~int(parse_datestr_#t~nondet290#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet291#1 && parse_datestr_#t~nondet291#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet291#1;assume 0 <= parse_datestr_#t~nondet292#1 && parse_datestr_#t~nondet292#1 <= 6;parse_datestr_~return_value_sscanf$11~0#1 := (if parse_datestr_#t~nondet292#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet292#1 % 4294967296 else parse_datestr_#t~nondet292#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet286#1;havoc parse_datestr_#t~nondet287#1;havoc parse_datestr_#t~nondet288#1;havoc parse_datestr_#t~nondet289#1;havoc parse_datestr_#t~nondet290#1;havoc parse_datestr_#t~nondet291#1;havoc parse_datestr_#t~nondet292#1;parse_datestr_~tmp_if_expr$12~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$11~0#1 >= 5 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3333: assume !(10 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$12~0#1 := 0; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3234: assume !(0 == parse_datestr_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3234: assume !!(0 == parse_datestr_~tmp_if_expr$1~2#1 % 256);call parse_datestr_#t~varargs232#1.base, parse_datestr_#t~varargs232#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, parse_datestr_#t~varargs232#1.base, parse_datestr_#t~varargs232#1.offset, 8); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume true;call llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#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:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168: assume !true; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168-2: assume !!(llist_add_to_end_#t~mem197#1.base == 0 && llist_add_to_end_#t~mem197#1.offset == 0);havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3168-2: assume !(llist_add_to_end_#t~mem197#1.base == 0 && llist_add_to_end_#t~mem197#1.offset == 0);havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset;call llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#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~mem198#1.base, llist_add_to_end_#t~mem198#1.offset;havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730: havoc strptime_#t~mem455#1;havoc strptime_#t~mem456#1;havoc strptime_#t~short457#1;call strptime_#t~mem458#1 := read~int(strptime_~result#1.base, 16 + strptime_~result#1.offset, 4);strptime_#t~short460#1 := strptime_#t~mem458#1 >= 0; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730-2: assume strptime_#t~short457#1;call strptime_#t~mem456#1 := read~int(strptime_~result#1.base, 12 + strptime_~result#1.offset, 4);strptime_#t~short457#1 := strptime_#t~mem456#1 < 32; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730-2: assume !strptime_#t~short457#1; [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short457#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2607: call write~$Pointer$(bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset, bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset, 8);havoc bb_strtoll_~tmp_if_expr$1~0#1;call bb_strtoll_#t~mem46#1 := read~int(bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset, 1); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3532: assume !(0 == xclose_~return_value_close$1~0#1);call xclose_#t~varargs353#1.base, xclose_#t~varargs353#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3532: assume !!(0 == xclose_~return_value_close$1~0#1); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3367: SUMMARY for call bb_error_msg_and_die(~#bb_msg_invalid_date~0.base, ~#bb_msg_invalid_date~0.offset, parse_datestr_#t~varargs308#1.base, parse_datestr_#t~varargs308#1.offset); srcloc: null [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: assume parse_datestr_#t~mem248#1 - 1900 <= 2147483647;call write~int(parse_datestr_#t~mem248#1 - 1900, parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem248#1;call parse_datestr_#t~mem249#1 := read~int(parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: assume !(parse_datestr_#t~mem248#1 - 1900 <= 2147483647); [2025-02-08 13:29:51,005 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3202: assume !(parse_datestr_~last_colon~0#1.base == 0 && parse_datestr_~last_colon~0#1.offset == 0);havoc parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset;havoc parse_datestr_~return_value_sscanf$6~0#1;assume -2147483648 <= parse_datestr_#t~nondet203#1 && parse_datestr_#t~nondet203#1 <= 2147483647;call write~int(parse_datestr_#t~nondet203#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet204#1 && parse_datestr_#t~nondet204#1 <= 2147483647;call write~int(parse_datestr_#t~nondet204#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet205#1 && parse_datestr_#t~nondet205#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet205#1;assume 0 <= parse_datestr_#t~nondet206#1 && parse_datestr_#t~nondet206#1 <= 3;parse_datestr_~return_value_sscanf$6~0#1 := (if parse_datestr_#t~nondet206#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet206#1 % 4294967296 else parse_datestr_#t~nondet206#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet203#1;havoc parse_datestr_#t~nondet204#1;havoc parse_datestr_#t~nondet205#1;havoc parse_datestr_#t~nondet206#1; [2025-02-08 13:29:51,006 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3202: assume !!(parse_datestr_~last_colon~0#1.base == 0 && parse_datestr_~last_colon~0#1.offset == 0);assume (0 == parse_datestr_#t~nondet236#1.base && 0 == parse_datestr_#t~nondet236#1.offset) || (parse_datestr_#t~nondet236#1.base == parse_datestr_~date_str#1.base && 0 <= parse_datestr_#t~nondet236#1.offset && parse_datestr_#t~nondet236#1.offset <= #length[parse_datestr_~date_str#1.base]);parse_datestr_~return_value___builtin_strchr$23~0#1.base, parse_datestr_~return_value___builtin_strchr$23~0#1.offset := parse_datestr_#t~nondet236#1.base, parse_datestr_#t~nondet236#1.offset;havoc parse_datestr_#t~nondet236#1.base, parse_datestr_#t~nondet236#1.offset; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-1: assume parse_datestr_#t~mem248#1 - 1900 >= -2147483648; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-1: assume !(parse_datestr_#t~mem248#1 - 1900 >= -2147483648); [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: assume -1 == getopt32_~c~0#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: 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:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short460#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc strptime_#t~mem458#1;havoc strptime_#t~mem459#1;havoc strptime_#t~short460#1;call strptime_#t~mem461#1 := read~int(strptime_~result#1.base, 20 + strptime_~result#1.offset, 4);strptime_#t~short463#1 := strptime_#t~mem461#1 >= 0; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3665-1: SUMMARY for call assume_abort_if_not((if 0 != open_#t~mem413#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3665: havoc open_#t~mem413#1;open_#res#1 := -1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731-2: assume strptime_#t~short460#1;call strptime_#t~mem459#1 := read~int(strptime_~result#1.base, 16 + strptime_~result#1.offset, 4);strptime_#t~short460#1 := strptime_#t~mem459#1 < 12; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731-2: assume !strptime_#t~short460#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: SUMMARY for call bb_perror_msg_and_die(14, 0, xclose_#t~varargs353#1.base, xclose_#t~varargs353#1.offset); srcloc: null [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: assume 0 == parse_datestr_~tmp_if_expr$20~0#1 % 256; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: assume !(0 == parse_datestr_~tmp_if_expr$20~0#1 % 256); [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269-1: assume parse_datestr_#t~mem249#1 - 1 >= -2147483648; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269-1: assume !(parse_datestr_#t~mem249#1 - 1 >= -2147483648); [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: assume parse_datestr_#t~mem249#1 - 1 <= 2147483647;call write~int(parse_datestr_#t~mem249#1 - 1, parse_datestr_~ptm#1.base, 16 + parse_datestr_~ptm#1.offset, 4);havoc parse_datestr_#t~mem249#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: assume !(parse_datestr_#t~mem249#1 - 1 <= 2147483647); [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret375#1.base, xzalloc_#t~ret375#1.offset, xzalloc_#t~memset~res376#1.base, xzalloc_#t~memset~res376#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: havoc parse_datestr_~endp~0#1.base, parse_datestr_~endp~0#1.offset, parse_datestr_~return_value_sscanf$6~0#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798: havoc getopt_long_#t~ret504#1;getopt32_#t~ret159#1 := getopt_long_#res#1;havoc getopt_long_#t~mem500#1.base, getopt_long_#t~mem500#1.offset, getopt_long_#t~mem501#1, getopt_long_#t~mem502#1.base, getopt_long_#t~mem502#1.offset, getopt_long_#t~mem503#1, getopt_long_#t~ret504#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~ret159#1 && getopt32_#t~ret159#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret159#1;havoc getopt32_#t~ret159#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3732: havoc strptime_#t~mem461#1;havoc strptime_#t~mem462#1;havoc strptime_#t~short463#1;call strptime_#t~mem464#1 := read~int(strptime_~result#1.base, 24 + strptime_~result#1.offset, 4);strptime_#t~short466#1 := strptime_#t~mem464#1 >= 0; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798-2: getopt_long_#t~ret504#1 := getopt_#res#1;havoc getopt_#t~mem484#1.base, getopt_#t~mem484#1.offset, getopt_#t~mem485#1, getopt_#t~short486#1, getopt_#t~nondet487#1, getopt_#t~nondet488#1, getopt_#t~mem489#1, getopt_#t~short490#1, getopt_#t~nondet491#1, getopt_#t~mem492#1, getopt_#t~nondet493#1, getopt_#t~pre494#1, getopt_#t~mem495#1, getopt_#t~short496#1, getopt_#t~nondet497#1, getopt_#t~mem498#1.base, getopt_#t~mem498#1.offset, getopt_#t~pre499#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~2#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~ret504#1 && getopt_long_#t~ret504#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret504#1;havoc getopt_long_#t~ret504#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3732-2: assume strptime_#t~short463#1;call strptime_#t~mem462#1 := read~int(strptime_~result#1.base, 20 + strptime_~result#1.offset, 4);strptime_#t~short463#1 := strptime_#t~mem462#1 < 1000; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3732-2: assume !strptime_#t~short463#1; [2025-02-08 13:29:51,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3732-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short463#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3633-1: SUMMARY for call xzalloc_#t~ret375#1.base, xzalloc_#t~ret375#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:29:51,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume !(45 == bb_strtoll_#t~mem46#1);havoc bb_strtoll_#t~mem46#1;call bb_strtoll_#t~mem47#1 := read~int(bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset, 1);bb_strtoll_~tmp_if_expr$1~0#1 := bb_strtoll_#t~mem47#1; [2025-02-08 13:29:51,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2609: assume !!(45 == bb_strtoll_#t~mem46#1);havoc bb_strtoll_#t~mem46#1;call bb_strtoll_#t~mem48#1 := read~int(bb_strtoll_~arg#1.base, 1 + bb_strtoll_~arg#1.offset, 1);bb_strtoll_~tmp_if_expr$1~0#1 := bb_strtoll_#t~mem48#1; [2025-02-08 13:29:51,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3633: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret375#1.base, xzalloc_#t~ret375#1.offset;havoc xzalloc_#t~ret375#1.base, xzalloc_#t~ret375#1.offset; [2025-02-08 13:29:51,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: SUMMARY for call bb_error_msg_and_die(~#bb_msg_invalid_date~0.base, ~#bb_msg_invalid_date~0.offset, parse_datestr_#t~varargs232#1.base, parse_datestr_#t~varargs232#1.offset); srcloc: null [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3171: llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret375#1.base, xzalloc_#t~ret375#1.offset, xzalloc_#t~memset~res376#1.base, xzalloc_#t~memset~res376#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;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~ret199#1.base, llist_add_to_end_#t~ret199#1.offset;havoc llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#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~mem200#1.base, llist_add_to_end_#t~mem200#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~mem200#1.base, 8 + llist_add_to_end_#t~mem200#1.offset, 8);havoc llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#1.offset;havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset, llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset, llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#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:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short466#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733: havoc strptime_#t~mem464#1;havoc strptime_#t~mem465#1;havoc strptime_#t~short466#1;call strptime_#t~mem467#1 := read~int(strptime_~result#1.base, 28 + strptime_~result#1.offset, 4);strptime_#t~short469#1 := strptime_#t~mem467#1 >= 0; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3634: havoc xzalloc_#t~memset~res376#1.base, xzalloc_#t~memset~res376#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733-2: assume strptime_#t~short466#1;call strptime_#t~mem465#1 := read~int(strptime_~result#1.base, 24 + strptime_~result#1.offset, 4);strptime_#t~short466#1 := strptime_#t~mem465#1 < 7; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733-2: assume !strptime_#t~short466#1; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3634-1: SUMMARY for call xzalloc_#t~memset~res376#1.base, xzalloc_#t~memset~res376#1.offset := #Ultimate.C_memset(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3304: assume 4 == parse_datestr_~len~0#1;assume -2147483648 <= parse_datestr_#t~nondet270#1 && parse_datestr_#t~nondet270#1 <= 2147483647;call write~int(parse_datestr_#t~nondet270#1, parse_datestr_~ptm#1.base, 8 + parse_datestr_~ptm#1.offset, 8);assume -2147483648 <= parse_datestr_#t~nondet271#1 && parse_datestr_#t~nondet271#1 <= 2147483647;call write~int(parse_datestr_#t~nondet271#1, parse_datestr_~ptm#1.base, 4 + parse_datestr_~ptm#1.offset, 8);assume -128 <= parse_datestr_#t~nondet272#1 && parse_datestr_#t~nondet272#1 <= 127;parse_datestr_~end~0#1 := parse_datestr_#t~nondet272#1;assume 0 <= parse_datestr_#t~nondet273#1 && parse_datestr_#t~nondet273#1 <= 3;parse_datestr_~return_value_sscanf$17~0#1 := (if parse_datestr_#t~nondet273#1 % 4294967296 <= 2147483647 then parse_datestr_#t~nondet273#1 % 4294967296 else parse_datestr_#t~nondet273#1 % 4294967296 - 4294967296);havoc parse_datestr_#t~nondet270#1;havoc parse_datestr_#t~nondet271#1;havoc parse_datestr_#t~nondet272#1;havoc parse_datestr_#t~nondet273#1;parse_datestr_~tmp_if_expr$18~0#1 := (if 0 == (if 0 != (if parse_datestr_~return_value_sscanf$17~0#1 >= 2 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3304: assume !(4 == parse_datestr_~len~0#1);parse_datestr_~tmp_if_expr$18~0#1 := 0; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3734: havoc strptime_#t~mem467#1;havoc strptime_#t~mem468#1;havoc strptime_#t~short469#1;strptime_~s_len~0#1 := strptime_#t~nondet470#1;havoc strptime_#t~nondet470#1;havoc strptime_#t~nondet471#1;strptime_~last_ok~0#1 := strptime_#t~nondet471#1;havoc strptime_#t~nondet471#1; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3734-2: assume strptime_#t~short469#1;call strptime_#t~mem468#1 := read~int(strptime_~result#1.base, 28 + strptime_~result#1.offset, 4);strptime_#t~short469#1 := strptime_#t~mem468#1 <= 365; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3734-2: assume !strptime_#t~short469#1; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3734-1: SUMMARY for call assume_abort_if_not((if strptime_#t~short469#1 then 1 else 0)); srcloc: null [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3602: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem369#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3602: 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:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3569: assume 45 == xstrtou_range_sfx_#t~mem359#1;havoc xstrtou_range_sfx_#t~mem359#1;xstrtou_range_sfx_~tmp_if_expr$1~4#1 := 1; [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3569: assume !(45 == xstrtou_range_sfx_#t~mem359#1);havoc xstrtou_range_sfx_#t~mem359#1;call xstrtou_range_sfx_#t~mem360#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem360#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3470: __main_#t~ret338#1 := ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#res#1;havoc ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#~__file#1.base, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#~__file#1.offset, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#~__tvp#1.base, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#~__tvp#1.offset, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~funptrres527#1, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret528#1, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#t~ret529#1;havoc ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~__file#1.base, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~__file#1.offset, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~__tvp#1.base, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~__tvp#1.offset, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~#fp#1.base, ##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int_#in~#fp#1.offset;assume { :end_inline_##fun~$Pointer$~X~[int]{ tv_sec : ~__time_t~0, tv_usec : ~__suseconds_t~0 }~TO~int } true;assume -2147483648 <= __main_#t~ret338#1 && __main_#t~ret338#1 <= 2147483647;__main_~result~0#1 := __main_#t~ret338#1;havoc __main_#t~mem336#1.base, __main_#t~mem336#1.offset;havoc __main_#t~bitwise337#1;havoc __main_#t~ret338#1; [2025-02-08 13:29:51,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3503: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~result~0#1;call __main_#t~mem347#1.base, __main_#t~mem347#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:29:51,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: assume 64 == parse_datestr_#t~mem250#1;havoc parse_datestr_#t~mem250#1;call parse_datestr_~#t~0#1.base, parse_datestr_~#t~0#1.offset := #Ultimate.allocOnStack(8);assume { :begin_inline_bb_strtol } true;bb_strtol_#in~arg#1.base, bb_strtol_#in~arg#1.offset, bb_strtol_#in~endp#1.base, bb_strtol_#in~endp#1.offset, bb_strtol_#in~base#1 := parse_datestr_~date_str#1.base, 1 + parse_datestr_~date_str#1.offset, 0, 0, 10;havoc bb_strtol_#res#1;havoc bb_strtol_#t~ret45#1, bb_strtol_~arg#1.base, bb_strtol_~arg#1.offset, bb_strtol_~endp#1.base, bb_strtol_~endp#1.offset, bb_strtol_~base#1, bb_strtol_~return_value_bb_strtoll$1~0#1;bb_strtol_~arg#1.base, bb_strtol_~arg#1.offset := bb_strtol_#in~arg#1.base, bb_strtol_#in~arg#1.offset;bb_strtol_~endp#1.base, bb_strtol_~endp#1.offset := bb_strtol_#in~endp#1.base, bb_strtol_#in~endp#1.offset;bb_strtol_~base#1 := bb_strtol_#in~base#1;havoc bb_strtol_~return_value_bb_strtoll$1~0#1;assume { :begin_inline_bb_strtoll } true;bb_strtoll_#in~arg#1.base, bb_strtoll_#in~arg#1.offset, bb_strtoll_#in~endp#1.base, bb_strtoll_#in~endp#1.offset, bb_strtoll_#in~base#1 := bb_strtol_~arg#1.base, bb_strtol_~arg#1.offset, bb_strtol_~endp#1.base, bb_strtol_~endp#1.offset, bb_strtol_~base#1;havoc bb_strtoll_#res#1;havoc bb_strtoll_#t~mem46#1, bb_strtoll_#t~mem47#1, bb_strtoll_#t~mem48#1, bb_strtoll_#t~ret49#1, bb_strtoll_#t~ret50#1, bb_strtoll_#t~nondet51#1, bb_strtoll_#t~ret52#1, bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset, bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset, bb_strtoll_~base#1, bb_strtoll_~v~0#1, bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset, bb_strtoll_~first~0#1, bb_strtoll_~tmp_if_expr$1~0#1, bb_strtoll_~return_value_bb_ascii_isalnum$3~0#1, bb_strtoll_~return_value_ret_ERANGE$2~0#1, bb_strtoll_~return_value_strtoll$4~0#1, bb_strtoll_~return_value_handle_errors$5~0#1;bb_strtoll_~arg#1.base, bb_strtoll_~arg#1.offset := bb_strtoll_#in~arg#1.base, bb_strtoll_#in~arg#1.offset;bb_strtoll_~endp#1.base, bb_strtoll_~endp#1.offset := bb_strtoll_#in~endp#1.base, bb_strtoll_#in~endp#1.offset;bb_strtoll_~base#1 := bb_strtoll_#in~base#1;havoc bb_strtoll_~v~0#1;call bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset := #Ultimate.allocOnStack(8);havoc bb_strtoll_~first~0#1; [2025-02-08 13:29:51,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: assume !(64 == parse_datestr_#t~mem250#1);havoc parse_datestr_#t~mem250#1;call parse_datestr_#t~mem265#1 := read~int(parse_datestr_~ptm#1.base, 20 + parse_datestr_~ptm#1.offset, 4);parse_datestr_~cur_year~0#1 := parse_datestr_#t~mem265#1;havoc parse_datestr_#t~mem265#1;havoc parse_datestr_~len~0#1;havoc parse_datestr_~return_value_strchrnul$8~0#1.base, parse_datestr_~return_value_strchrnul$8~0#1.offset;assume { :begin_inline_strchrnul } true;strchrnul_#in~s#1.base, strchrnul_#in~s#1.offset, strchrnul_#in~c#1 := parse_datestr_~date_str#1.base, parse_datestr_~date_str#1.offset, 46;havoc strchrnul_#res#1.base, strchrnul_#res#1.offset;havoc strchrnul_#t~nondet435#1.base, strchrnul_#t~nondet435#1.offset, strchrnul_#t~nondet436#1, strchrnul_~s#1.base, strchrnul_~s#1.offset, strchrnul_~c#1, strchrnul_~result~1#1.base, strchrnul_~result~1#1.offset;strchrnul_~s#1.base, strchrnul_~s#1.offset := strchrnul_#in~s#1.base, strchrnul_#in~s#1.offset;strchrnul_~c#1 := strchrnul_#in~c#1;assume (0 == strchrnul_#t~nondet435#1.base && 0 == strchrnul_#t~nondet435#1.offset) || (strchrnul_#t~nondet435#1.base == strchrnul_~s#1.base && 0 <= strchrnul_#t~nondet435#1.offset && strchrnul_#t~nondet435#1.offset <= #length[strchrnul_~s#1.base]);strchrnul_~result~1#1.base, strchrnul_~result~1#1.offset := strchrnul_#t~nondet435#1.base, strchrnul_#t~nondet435#1.offset;havoc strchrnul_#t~nondet435#1.base, strchrnul_#t~nondet435#1.offset; [2025-02-08 13:29:51,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: assume true;call getopt32_#t~mem160#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:51,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: assume !true; [2025-02-08 13:29:51,120 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2025-02-08 13:29:51,120 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:29:51,157 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:29:51,158 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:29:51,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:51 BoogieIcfgContainer [2025-02-08 13:29:51,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:29:51,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:29:51,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:29:51,163 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:29:51,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:37" (1/3) ... [2025-02-08 13:29:51,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793a9bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:51, skipping insertion in model container [2025-02-08 13:29:51,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:38" (2/3) ... [2025-02-08 13:29:51,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793a9bd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:51, skipping insertion in model container [2025-02-08 13:29:51,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:51" (3/3) ... [2025-02-08 13:29:51,165 INFO L128 eAbstractionObserver]: Analyzing ICFG touch-1.i [2025-02-08 13:29:51,178 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:29:51,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG touch-1.i that has 13 procedures, 479 locations, 1 initial locations, 30 loop locations, and 96 error locations. [2025-02-08 13:29:51,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:29:51,239 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;@4acbe232, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:29:51,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-08 13:29:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 461 states, 336 states have (on average 1.6726190476190477) internal successors, (562), 425 states have internal predecessors, (562), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-08 13:29:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:29:51,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:51,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:29:51,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:29:51,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1174687, now seen corresponding path program 1 times [2025-02-08 13:29:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137809546] [2025-02-08 13:29:51,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:51,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:52,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:29:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:29:52,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:52,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:52,721 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:29:52,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:52,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137809546] [2025-02-08 13:29:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137809546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:29:52,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348829397] [2025-02-08 13:29:52,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:52,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:52,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:52,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:52,750 INFO L87 Difference]: Start difference. First operand has 461 states, 336 states have (on average 1.6726190476190477) internal successors, (562), 425 states have internal predecessors, (562), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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:29:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:52,952 INFO L93 Difference]: Finished difference Result 672 states and 912 transitions. [2025-02-08 13:29:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:52,971 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:29:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:53,010 INFO L225 Difference]: With dead ends: 672 [2025-02-08 13:29:53,011 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 13:29:53,044 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:29:53,047 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 510 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:53,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 510 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:29:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 13:29:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 13:29:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 149 states have (on average 1.5302013422818792) internal successors, (228), 182 states have internal predecessors, (228), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:29:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:29:53,111 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 3 [2025-02-08 13:29:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:53,113 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:29:53,113 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:29:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:29:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:29:53,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:53,114 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:29:53,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:29:53,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:29:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash 636472349, now seen corresponding path program 1 times [2025-02-08 13:29:53,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:53,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354257163] [2025-02-08 13:29:53,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:53,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:53,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:53,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:53,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:53,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:54,278 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:29:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354257163] [2025-02-08 13:29:54,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354257163] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:54,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648189739] [2025-02-08 13:29:54,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:54,281 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:29:54,283 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:29:55,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:55,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:55,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:55,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:55,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:55,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:55,467 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:29:55,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:29:55,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648189739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:55,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:29:55,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:29:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668167499] [2025-02-08 13:29:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:55,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:29:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:55,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:29:55,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:55,470 INFO L87 Difference]: Start difference. First operand 195 states and 243 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:29:59,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:59,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:59,674 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:29:59,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:29:59,674 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:29:59,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:59,676 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:29:59,676 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:29:59,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:59,677 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:59,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:29:59,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:29:59,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:29:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 149 states have (on average 1.523489932885906) internal successors, (227), 181 states have internal predecessors, (227), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:29:59,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2025-02-08 13:29:59,687 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 6 [2025-02-08 13:29:59,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:59,688 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2025-02-08 13:29:59,688 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:29:59,688 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2025-02-08 13:29:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:29:59,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:59,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:29:59,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:29:59,889 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:29:59,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:29:59,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:59,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1744192543, now seen corresponding path program 1 times [2025-02-08 13:29:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341594436] [2025-02-08 13:29:59,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:00,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:00,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:00,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:00,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:00,736 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:30:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:00,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341594436] [2025-02-08 13:30:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341594436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798659807] [2025-02-08 13:30:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:00,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:00,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:00,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:00,737 INFO L87 Difference]: Start difference. First operand 194 states and 242 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:30:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:00,850 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2025-02-08 13:30:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:00,851 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:30:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:00,852 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:30:00,853 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:30:00,853 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:30:00,854 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:00,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:30:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-02-08 13:30:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 147 states have (on average 1.5238095238095237) internal successors, (224), 178 states have internal predecessors, (224), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2025-02-08 13:30:00,866 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 7 [2025-02-08 13:30:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:00,866 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2025-02-08 13:30:00,866 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:30:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2025-02-08 13:30:00,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:00,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:00,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:00,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -408582613, now seen corresponding path program 1 times [2025-02-08 13:30:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911771721] [2025-02-08 13:30:00,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:01,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:01,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:01,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:01,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:01,848 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:30:01,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911771721] [2025-02-08 13:30:01,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911771721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:01,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033747602] [2025-02-08 13:30:01,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:01,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:01,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:01,851 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:30:01,852 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:30:02,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:02,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:02,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:02,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:02,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:02,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:03,039 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:30:03,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033747602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192745522] [2025-02-08 13:30:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:03,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:03,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:03,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:03,041 INFO L87 Difference]: Start difference. First operand 191 states and 239 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:30:07,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:07,243 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2025-02-08 13:30:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:07,244 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:30:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:07,245 INFO L225 Difference]: With dead ends: 191 [2025-02-08 13:30:07,245 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 13:30:07,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:07,245 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 187 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 263 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:07,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 263 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:30:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 13:30:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 13:30:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 147 states have (on average 1.510204081632653) internal successors, (222), 176 states have internal predecessors, (222), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2025-02-08 13:30:07,260 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 11 [2025-02-08 13:30:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:07,262 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2025-02-08 13:30:07,262 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:30:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2025-02-08 13:30:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:07,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:07,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:30:07,463 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:30:07,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash 218841997, now seen corresponding path program 1 times [2025-02-08 13:30:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:07,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402878591] [2025-02-08 13:30:07,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:07,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:08,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:08,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:08,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:08,498 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:30:08,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402878591] [2025-02-08 13:30:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402878591] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:08,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27515321] [2025-02-08 13:30:08,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:08,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:08,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:08,501 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:30:08,503 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:30:09,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:09,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:09,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:09,766 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:30:09,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:09,923 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:30:09,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27515321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:09,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:09,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:09,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325999370] [2025-02-08 13:30:09,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:09,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:09,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:09,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:09,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:09,924 INFO L87 Difference]: Start difference. First operand 189 states and 237 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:30:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:10,146 INFO L93 Difference]: Finished difference Result 382 states and 480 transitions. [2025-02-08 13:30:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:10,147 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:30:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:10,148 INFO L225 Difference]: With dead ends: 382 [2025-02-08 13:30:10,148 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:30:10,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:10,149 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:10,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 910 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:30:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:30:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:30:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 156 states have (on average 1.4807692307692308) internal successors, (231), 185 states have internal predecessors, (231), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:30:10,156 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 12 [2025-02-08 13:30:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:10,156 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:30:10,156 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:30:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:30:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:10,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:10,157 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:10,167 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:30:10,358 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:30:10,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:10,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash 160823567, now seen corresponding path program 2 times [2025-02-08 13:30:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897907256] [2025-02-08 13:30:10,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:11,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:11,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:30:11,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:11,496 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:30:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897907256] [2025-02-08 13:30:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897907256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:11,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:11,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:11,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709923993] [2025-02-08 13:30:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:11,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:11,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:11,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:11,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:11,497 INFO L87 Difference]: Start difference. First operand 198 states and 246 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:30:15,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:15,858 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:30:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:15,859 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:30:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:15,860 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:30:15,860 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 13:30:15,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:15,861 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 186 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 694 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:15,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 694 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:30:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 13:30:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 13:30:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 156 states have (on average 1.4679487179487178) internal successors, (229), 183 states have internal predecessors, (229), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2025-02-08 13:30:15,871 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 21 [2025-02-08 13:30:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:15,871 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2025-02-08 13:30:15,871 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:30:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2025-02-08 13:30:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:15,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:15,872 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:30:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:15,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -352800092, now seen corresponding path program 1 times [2025-02-08 13:30:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118542684] [2025-02-08 13:30:15,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:16,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:30:16,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:30:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:16,777 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:30:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118542684] [2025-02-08 13:30:16,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118542684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:16,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:16,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211425472] [2025-02-08 13:30:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:16,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:16,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:16,778 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand has 3 states, 2 states have (on average 7.5) 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:30:20,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:21,003 INFO L93 Difference]: Finished difference Result 376 states and 473 transitions. [2025-02-08 13:30:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) 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:30:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:21,006 INFO L225 Difference]: With dead ends: 376 [2025-02-08 13:30:21,006 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:30:21,007 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:30:21,007 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 449 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:21,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 449 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:30:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:30:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:30:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 159 states have (on average 1.4591194968553458) internal successors, (232), 186 states have internal predecessors, (232), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:30:21,014 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 26 [2025-02-08 13:30:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:30:21,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) 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:30:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:30:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:30:21,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:21,016 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:21,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:30:21,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:21,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1947760521, now seen corresponding path program 1 times [2025-02-08 13:30:21,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:21,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171774262] [2025-02-08 13:30:21,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:21,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:30:21,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:30:21,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,891 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:30:21,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:21,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171774262] [2025-02-08 13:30:21,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171774262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:21,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:21,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997701842] [2025-02-08 13:30:21,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:21,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:21,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:21,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:21,892 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:30:22,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:22,024 INFO L93 Difference]: Finished difference Result 316 states and 402 transitions. [2025-02-08 13:30:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:22,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-02-08 13:30:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:22,026 INFO L225 Difference]: With dead ends: 316 [2025-02-08 13:30:22,026 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 13:30:22,026 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:30:22,026 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 140 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:22,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 449 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 13:30:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2025-02-08 13:30:22,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.4539877300613497) internal successors, (237), 190 states have internal predecessors, (237), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2025-02-08 13:30:22,034 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 27 [2025-02-08 13:30:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:22,034 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2025-02-08 13:30:22,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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:30:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2025-02-08 13:30:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:22,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:22,034 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:22,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:30:22,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:22,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash -481473048, now seen corresponding path program 1 times [2025-02-08 13:30:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359505419] [2025-02-08 13:30:22,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:22,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:22,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:22,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:22,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:22,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359505419] [2025-02-08 13:30:22,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359505419] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427746507] [2025-02-08 13:30:22,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:22,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:22,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:22,989 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:30:22,990 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:30:24,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:24,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:24,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:24,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:24,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:24,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:25,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427746507] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:25,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:25,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:30:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213930138] [2025-02-08 13:30:25,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:30:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:25,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:30:25,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:25,408 INFO L87 Difference]: Start difference. First operand 203 states and 252 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:29,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:33,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:34,241 INFO L93 Difference]: Finished difference Result 409 states and 513 transitions. [2025-02-08 13:30:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:30:34,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:30:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:34,242 INFO L225 Difference]: With dead ends: 409 [2025-02-08 13:30:34,242 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 13:30:34,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:34,243 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 5 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:34,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-02-08 13:30:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 13:30:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-02-08 13:30:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 181 states have (on average 1.4033149171270718) internal successors, (254), 207 states have internal predecessors, (254), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 269 transitions. [2025-02-08 13:30:34,253 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 269 transitions. Word has length 29 [2025-02-08 13:30:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:34,255 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 269 transitions. [2025-02-08 13:30:34,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 269 transitions. [2025-02-08 13:30:34,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:30:34,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:34,256 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:34,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:30:34,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 13:30:34,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:34,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1291517176, now seen corresponding path program 1 times [2025-02-08 13:30:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:34,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431060941] [2025-02-08 13:30:34,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:35,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:30:35,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:30:35,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:35,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:35,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431060941] [2025-02-08 13:30:35,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431060941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:35,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:35,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625052610] [2025-02-08 13:30:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:35,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:35,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:35,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:35,313 INFO L87 Difference]: Start difference. First operand 220 states and 269 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) [2025-02-08 13:30:39,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:39,646 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2025-02-08 13:30:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:39,671 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 47 [2025-02-08 13:30:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:39,672 INFO L225 Difference]: With dead ends: 232 [2025-02-08 13:30:39,672 INFO L226 Difference]: Without dead ends: 230 [2025-02-08 13:30:39,672 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:30:39,673 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:39,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 444 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:30:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-08 13:30:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2025-02-08 13:30:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.4) internal successors, (266), 216 states have internal predecessors, (266), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 281 transitions. [2025-02-08 13:30:39,682 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 281 transitions. Word has length 47 [2025-02-08 13:30:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:39,682 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 281 transitions. [2025-02-08 13:30:39,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-02-08 13:30:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 281 transitions. [2025-02-08 13:30:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:39,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:39,685 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:39,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:30:39,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:39,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:39,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1382320730, now seen corresponding path program 1 times [2025-02-08 13:30:39,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:39,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564041789] [2025-02-08 13:30:39,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:40,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:40,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:40,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:40,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564041789] [2025-02-08 13:30:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564041789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:40,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997364814] [2025-02-08 13:30:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:40,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:40,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:40,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:40,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:40,506 INFO L87 Difference]: Start difference. First operand 229 states and 281 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:30:44,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:44,661 INFO L93 Difference]: Finished difference Result 229 states and 281 transitions. [2025-02-08 13:30:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:44,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 48 [2025-02-08 13:30:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:44,662 INFO L225 Difference]: With dead ends: 229 [2025-02-08 13:30:44,662 INFO L226 Difference]: Without dead ends: 228 [2025-02-08 13:30:44,662 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:30:44,662 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:44,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-08 13:30:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2025-02-08 13:30:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 186 states have (on average 1.3978494623655915) internal successors, (260), 211 states have internal predecessors, (260), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2025-02-08 13:30:44,668 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 48 [2025-02-08 13:30:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:44,668 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2025-02-08 13:30:44,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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:30:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2025-02-08 13:30:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:30:44,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:44,669 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:30:44,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash -13633587, now seen corresponding path program 1 times [2025-02-08 13:30:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730365796] [2025-02-08 13:30:44,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:45,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:45,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730365796] [2025-02-08 13:30:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730365796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143755818] [2025-02-08 13:30:45,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:45,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:45,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:30:46,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:46,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:46,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:46,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:46,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:46,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:47,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:47,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143755818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:47,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:47,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:30:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613432387] [2025-02-08 13:30:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:47,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:47,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:47,094 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:30:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:47,364 INFO L93 Difference]: Finished difference Result 335 states and 423 transitions. [2025-02-08 13:30:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 49 [2025-02-08 13:30:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:47,366 INFO L225 Difference]: With dead ends: 335 [2025-02-08 13:30:47,366 INFO L226 Difference]: Without dead ends: 334 [2025-02-08 13:30:47,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:47,367 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 279 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:47,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 675 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:30:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-08 13:30:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 223. [2025-02-08 13:30:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 186 states have (on average 1.39247311827957) internal successors, (259), 210 states have internal predecessors, (259), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2025-02-08 13:30:47,375 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 49 [2025-02-08 13:30:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:47,375 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2025-02-08 13:30:47,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:30:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2025-02-08 13:30:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:30:47,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:47,377 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:47,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:30:47,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 13:30:47,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:47,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -422640109, now seen corresponding path program 1 times [2025-02-08 13:30:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593693768] [2025-02-08 13:30:47,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:48,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:48,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:48,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:48,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:48,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:48,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593693768] [2025-02-08 13:30:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593693768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:48,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416404616] [2025-02-08 13:30:48,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:48,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:48,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:48,637 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:48,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:30:49,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:49,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:49,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:49,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:49,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:49,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:50,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416404616] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:50,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:50,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:30:50,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362434125] [2025-02-08 13:30:50,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:50,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:50,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:50,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:50,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:50,371 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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:30:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:50,885 INFO L93 Difference]: Finished difference Result 680 states and 884 transitions. [2025-02-08 13:30:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:50,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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 50 [2025-02-08 13:30:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:50,890 INFO L225 Difference]: With dead ends: 680 [2025-02-08 13:30:50,890 INFO L226 Difference]: Without dead ends: 679 [2025-02-08 13:30:50,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:50,891 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 697 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:50,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1239 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:30:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-08 13:30:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 235. [2025-02-08 13:30:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 198 states have (on average 1.3838383838383839) internal successors, (274), 222 states have internal predecessors, (274), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 289 transitions. [2025-02-08 13:30:50,903 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 289 transitions. Word has length 50 [2025-02-08 13:30:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:50,903 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 289 transitions. [2025-02-08 13:30:50,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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:30:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 289 transitions. [2025-02-08 13:30:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:30:50,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:50,905 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:50,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:30:51,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:30:51,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-02-08 13:30:51,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash -26493828, now seen corresponding path program 1 times [2025-02-08 13:30:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662605618] [2025-02-08 13:30:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:51,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:30:52,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662605618] [2025-02-08 13:30:52,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662605618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:52,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766172285] [2025-02-08 13:30:52,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:52,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:52,039 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:52,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:30:53,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:30:53,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:30:53,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:53,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:53,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 2196 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:53,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:30:53,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:30:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766172285] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:53,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:30:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583860275] [2025-02-08 13:30:53,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:53,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:53,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:53,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:53,730 INFO L87 Difference]: Start difference. First operand 235 states and 289 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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:30:57,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:01,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:05,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:09,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []