./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/tee-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/tee-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 5840b84a3081e97c556462e79494d7bdbd67c33b7e35e6dce1209017cae26b3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:29:21,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:29:21,699 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:21,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:29:21,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:29:21,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:29:21,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:29:21,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:29:21,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:29:21,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:29:21,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:29:21,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:29:21,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:29:21,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:29:21,731 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:29:21,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:29:21,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:29:21,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:21,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:29:21,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:29:21,733 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 -> 5840b84a3081e97c556462e79494d7bdbd67c33b7e35e6dce1209017cae26b3d [2025-02-08 13:29:21,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:29:22,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:29:22,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:29:22,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:29:22,012 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:29:22,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/tee-1.i [2025-02-08 13:29:23,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/030bfb08a/0bd09684e1de4f6ba38a64d6398ca364/FLAGd51be19f8 [2025-02-08 13:29:23,906 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:29:23,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/tee-1.i [2025-02-08 13:29:23,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/030bfb08a/0bd09684e1de4f6ba38a64d6398ca364/FLAGd51be19f8 [2025-02-08 13:29:23,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/030bfb08a/0bd09684e1de4f6ba38a64d6398ca364 [2025-02-08 13:29:23,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:23,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:23,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:23,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:23,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:23,971 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:23" (1/1) ... [2025-02-08 13:29:23,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fc3430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:23, skipping insertion in model container [2025-02-08 13:29:23,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:23" (1/1) ... [2025-02-08 13:29:24,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:25,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:25,219 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:25,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:25,741 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:25,748 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:25,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:25 WrapperNode [2025-02-08 13:29:25,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:25,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:25,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:25,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:25,756 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:25" (1/1) ... [2025-02-08 13:29:25,891 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:25" (1/1) ... [2025-02-08 13:29:26,265 INFO L138 Inliner]: procedures = 575, calls = 8940, calls flagged for inlining = 28, calls inlined = 26, statements flattened = 10183 [2025-02-08 13:29:26,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:26,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:26,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:26,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:26,277 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:25" (1/1) ... [2025-02-08 13:29:26,277 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:25" (1/1) ... [2025-02-08 13:29:26,353 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:25" (1/1) ... [2025-02-08 13:29:26,365 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:29:26,365 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:25" (1/1) ... [2025-02-08 13:29:26,366 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:25" (1/1) ... [2025-02-08 13:29:26,565 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:25" (1/1) ... [2025-02-08 13:29:26,585 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:25" (1/1) ... [2025-02-08 13:29:26,618 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:25" (1/1) ... [2025-02-08 13:29:26,643 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:25" (1/1) ... [2025-02-08 13:29:26,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:26,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:26,698 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:26,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:26,699 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:25" (1/1) ... [2025-02-08 13:29:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:26,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:26,733 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:26,736 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:26,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:26,757 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-02-08 13:29:26,757 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:26,758 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:29:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:26,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:29:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:29:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:29:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:29:26,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:29:26,760 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:29:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:26,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:29:26,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:29:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:29:26,762 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:26,762 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:26,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:29:27,237 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:27,239 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356: #t~ret66#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet74#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret66#1 && #t~ret66#1 <= 2147483647;havoc #t~ret66#1;call #t~mem67#1.base, #t~mem67#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~mem67#1.base, #t~mem67#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret78#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:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2406: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:29:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: 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~nondet271#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#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~nondet271#1;assume -9223372036854775808 <= write_#t~nondet271#1 && write_#t~nondet271#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet271#1;havoc write_#t~nondet271#1; [2025-02-08 13:29:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: assume !true; [2025-02-08 13:29:27,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2357: #t~ret68#1 := full_write_#res#1;havoc full_write_#t~ret78#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~ret68#1 && #t~ret68#1 <= 9223372036854775807;havoc #t~mem67#1.base, #t~mem67#1.offset;havoc #t~ret68#1; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2853-1: safe_write_#res#1 := safe_write_~n~1#1; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2846: safe_write_#t~ret194#1 := write_#res#1;havoc write_#t~nondet271#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#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~ret194#1 && safe_write_#t~ret194#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret194#1;havoc safe_write_#t~ret194#1; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: 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~ret194#1, safe_write_#t~mem195#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~2#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~1#1;havoc safe_write_~tmp_if_expr$1~2#1; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: assume safe_write_~n~1#1 < 0;call safe_write_#t~mem195#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem195#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410: 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:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:27,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:27,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:29:27,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: write_#res#1 := write_~ret~1#1; [2025-02-08 13:29:27,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: full_write_#t~ret78#1 := safe_write_#res#1;havoc safe_write_#t~ret194#1, safe_write_#t~mem195#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~2#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret78#1 && full_write_#t~ret78#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret78#1;havoc full_write_#t~ret78#1; [2025-02-08 13:29:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: assume full_write_~cc~0#1 < 0; [2025-02-08 13:29:27,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:29:50,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3107-2: getopt_long_#t~ret267#1 := getopt_#res#1;havoc getopt_#t~mem247#1.base, getopt_#t~mem247#1.offset, getopt_#t~mem248#1, getopt_#t~short249#1, getopt_#t~nondet250#1, getopt_#t~nondet251#1, getopt_#t~mem252#1, getopt_#t~short253#1, getopt_#t~nondet254#1, getopt_#t~mem255#1, getopt_#t~nondet256#1, getopt_#t~pre257#1, getopt_#t~mem258#1, getopt_#t~short259#1, getopt_#t~nondet260#1, getopt_#t~mem261#1.base, getopt_#t~mem261#1.offset, getopt_#t~pre262#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret267#1 && getopt_long_#t~ret267#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret267#1;havoc getopt_long_#t~ret267#1; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3042: havoc xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3042-2: call xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs235#1.base, 8 + xstrtou_range_sfx_#t~varargs235#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs235#1.base, 16 + xstrtou_range_sfx_#t~varargs235#1.offset, 8); [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3042-1: SUMMARY for call bb_error_msg_and_die(11, 0, xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset); srcloc: null [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3009: xstrtou_range_sfx_#t~ret225#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet44#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret225#1;havoc xstrtou_range_sfx_#t~ret225#1;call xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#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,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3010: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem226#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem226#1.offset);havoc xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset;call xstrtou_range_sfx_#t~mem227#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3010: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem226#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem226#1.offset);havoc xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: assume true;call getopt32_#t~mem156#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: assume !true; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746-2: assume !!((if getopt32_#t~mem156#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem156#1 % 256 % 4294967296 else getopt32_#t~mem156#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem156#1; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746-2: assume !((if getopt32_#t~mem156#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem156#1 % 256 % 4294967296 else getopt32_#t~mem156#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem156#1;call getopt32_#t~mem157#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: assume 0 == (if getopt32_#t~mem157#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem157#1 % 256 % 4294967296 else getopt32_#t~mem157#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem157#1; [2025-02-08 13:29:50,572 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: assume !(0 == (if getopt32_#t~mem157#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem157#1 % 256 % 4294967296 else getopt32_#t~mem157#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem157#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,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3012: assume 0 == xstrtou_range_sfx_#t~mem227#1;havoc xstrtou_range_sfx_#t~mem227#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:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3012: assume !(0 == xstrtou_range_sfx_#t~mem227#1);havoc xstrtou_range_sfx_#t~mem227#1; [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-1: [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: assume 0 != getopt32_#t~bitwise159#1 % 4294967296;havoc getopt32_#t~mem158#1;havoc getopt32_#t~bitwise159#1; [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: assume !(0 != getopt32_#t~bitwise159#1 % 4294967296);havoc getopt32_#t~mem158#1;havoc getopt32_#t~bitwise159#1;call getopt32_#t~mem160#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem161#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-3: assume getopt32_#t~mem158#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise159#1 := getopt32_#t~mem158#1; [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-3: assume !(getopt32_#t~mem158#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-2: havoc getopt32_#t~bitwise159#1;assume getopt32_#t~bitwise159#1 % 4294967296 <= getopt32_#t~mem158#1 % 4294967296 && getopt32_#t~bitwise159#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-5: call getopt32_#t~mem158#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-4: assume 0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise159#1 := 0; [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749-4: assume !(0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,573 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: 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,576 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3015: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3015: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2916-1: assume true; [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2916-1: assume !true; [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-1: [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751: getopt32_~trigger~0#1 := getopt32_#t~bitwise162#1;havoc getopt32_#t~mem160#1;havoc getopt32_#t~mem161#1;havoc getopt32_#t~bitwise162#1;call getopt32_#t~mem163#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-3: assume getopt32_#t~mem160#1 % 4294967296 == getopt32_#t~mem161#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_#t~mem160#1; [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-3: assume !(getopt32_#t~mem160#1 % 4294967296 == getopt32_#t~mem161#1 % 4294967296); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-2: havoc getopt32_#t~bitwise162#1;assume getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_#t~mem160#1 % 4294967296 && getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_#t~mem161#1 % 4294967296; [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-4: assume 0 == getopt32_#t~mem160#1 % 4294967296 || 0 == getopt32_#t~mem161#1 % 4294967296;getopt32_#t~bitwise162#1 := 0; [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751-4: assume !(0 == getopt32_#t~mem160#1 % 4294967296 || 0 == getopt32_#t~mem161#1 % 4294967296); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049-1: SUMMARY for call bb_error_msg_and_die(12, 0, xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#1.offset); srcloc: null [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: assume true;call xstrtou_range_sfx_#t~mem228#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:50,577 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: assume !true; [2025-02-08 13:29:50,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#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~ret217#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem221#1, xstrtou_range_sfx_#t~mem222#1, xstrtou_range_sfx_#t~mem223#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~ret225#1, xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~mem228#1, xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset, xstrtou_range_sfx_#t~nondet230#1, xstrtou_range_sfx_#t~mem231#1, xstrtou_range_sfx_#t~mem232#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~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset, xstrtou_range_sfx_#t~mem234#1, xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset, xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#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~3#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~ret217#1;havoc xatou_range_#t~ret217#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:29:50,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049-2: call xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#1.offset, 8); [2025-02-08 13:29:50,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016-1: assume !(0 == xstrtou_range_sfx_#t~mem228#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem228#1; [2025-02-08 13:29:50,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016-1: assume !!(0 == xstrtou_range_sfx_#t~mem228#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem228#1; [2025-02-08 13:29:50,578 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: call write~$Pointer$(~stdout~0.base, ~stdout~0.offset, __main_~fp~1#1.base, __main_~fp~1#1.offset, 8);havoc __main_~tmp_if_expr$3~1#1;call __main_#t~mem200#1.base, __main_#t~mem200#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);call __main_#t~mem201#1 := read~int(__main_#t~mem200#1.base, __main_#t~mem200#1.offset, 1); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2818: assume true;call llist_add_to_end_#t~mem188#1.base, llist_add_to_end_#t~mem188#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:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2818: assume !true; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2818-2: assume !!(llist_add_to_end_#t~mem188#1.base == 0 && llist_add_to_end_#t~mem188#1.offset == 0);havoc llist_add_to_end_#t~mem188#1.base, llist_add_to_end_#t~mem188#1.offset; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2818-2: assume !(llist_add_to_end_#t~mem188#1.base == 0 && llist_add_to_end_#t~mem188#1.offset == 0);havoc llist_add_to_end_#t~mem188#1.base, llist_add_to_end_#t~mem188#1.offset;call llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#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~mem189#1.base, llist_add_to_end_#t~mem189#1.offset;havoc llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: getopt32_~flags~0#1 := getopt32_#t~bitwise165#1;havoc getopt32_#t~mem163#1;havoc getopt32_#t~bitwise164#1;havoc getopt32_#t~bitwise165#1;call getopt32_#t~mem166#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-2: havoc getopt32_#t~bitwise165#1;assume getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise165#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise164#1) % 4294967296; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-1: [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise164#1) % 4294967296;getopt32_#t~bitwise165#1 := 0; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise164#1) % 4294967296); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise164#1) % 4294967296;getopt32_#t~bitwise165#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise164#1) % 4294967296); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-6: havoc getopt32_#t~bitwise164#1;assume getopt32_#t~bitwise164#1 % 4294967296 <= getopt32_#t~mem163#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-5: [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise164#1 := getopt32_#t~mem163#1; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-7: assume getopt32_#t~mem163#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise164#1 := 0; [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-7: assume !(getopt32_#t~mem163#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-9: assume 0 == getopt32_#t~mem163#1 % 4294967296;getopt32_#t~bitwise164#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-9: assume !(0 == getopt32_#t~mem163#1 % 4294967296); [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2918: __main_#t~ret209#1 := safe_read_#res#1;havoc safe_read_#t~ret192#1, safe_read_#t~mem193#1, safe_read_~fd#1, safe_read_~buf#1.base, safe_read_~buf#1.offset, safe_read_~count#1, safe_read_~n~0#1, safe_read_~tmp_if_expr$1~1#1;havoc safe_read_#in~fd#1, safe_read_#in~buf#1.base, safe_read_#in~buf#1.offset, safe_read_#in~count#1;assume { :end_inline_safe_read } true;assume -9223372036854775808 <= __main_#t~ret209#1 && __main_#t~ret209#1 <= 9223372036854775807;__main_~c~1#1 := __main_#t~ret209#1;havoc __main_#t~ret209#1; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-1: [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: getopt32_~flags~0#1 := getopt32_#t~bitwise168#1;havoc getopt32_#t~mem166#1;havoc getopt32_#t~bitwise167#1;havoc getopt32_#t~bitwise168#1; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-3: assume 0 == getopt32_#t~bitwise167#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-3: assume !(0 == getopt32_#t~bitwise167#1 % 4294967296); [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-2: havoc getopt32_#t~bitwise168#1;assume (getopt32_#t~bitwise168#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise168#1 % 4294967296 >= getopt32_#t~bitwise167#1 % 4294967296) && getopt32_#t~bitwise168#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise167#1 % 4294967296; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-5: [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise167#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_#t~bitwise167#1; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise167#1 % 4294967296); [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-7: assume getopt32_#t~mem166#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := 0; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-7: assume !(getopt32_#t~mem166#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-6: havoc getopt32_#t~bitwise167#1;assume getopt32_#t~bitwise167#1 % 4294967296 <= getopt32_#t~mem166#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-9: assume 0 == getopt32_#t~mem166#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,582 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-9: assume !(0 == getopt32_#t~mem166#1 % 4294967296); [2025-02-08 13:29:50,582 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_#t~mem166#1; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: 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~mem229#1.base, xstrtou_range_sfx_#t~mem229#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~nondet230#1;havoc xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset;havoc xstrtou_range_sfx_#t~nondet230#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:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: assume !(45 == __main_#t~mem201#1);havoc __main_#t~mem200#1.base, __main_#t~mem200#1.offset;havoc __main_#t~mem201#1;__main_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: assume !!(45 == __main_#t~mem201#1);havoc __main_#t~mem200#1.base, __main_#t~mem200#1.offset;havoc __main_#t~mem201#1;call __main_#t~mem202#1.base, __main_#t~mem202#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);call __main_#t~mem203#1 := read~int(__main_#t~mem202#1.base, 1 + __main_#t~mem202#1.offset, 1);__main_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != __main_#t~mem203#1 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem202#1.base, __main_#t~mem202#1.offset;havoc __main_#t~mem203#1; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2919: assume !(__main_~c~1#1 > 0); [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2919: assume !!(__main_~c~1#1 > 0);__main_~fp~1#1.base, __main_~fp~1#1.offset := __main_~files~0#1.base, __main_~files~0#1.offset; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2820: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: getopt32_~flags~0#1 := getopt32_#t~bitwise169#1;havoc getopt32_#t~bitwise169#1;call getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-2: havoc getopt32_#t~bitwise169#1;assume getopt32_#t~bitwise169#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-1: [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise169#1 := getopt32_~flags~0#1; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise169#1 := 0; [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:50,583 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise169#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821-1: SUMMARY for call llist_add_to_end_#t~ret190#1.base, llist_add_to_end_#t~ret190#1.offset := xzalloc(16); srcloc: null [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821: 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~ret190#1.base, llist_add_to_end_#t~ret190#1.offset;havoc llist_add_to_end_#t~ret190#1.base, llist_add_to_end_#t~ret190#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~mem191#1.base, llist_add_to_end_#t~mem191#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~mem191#1.base, 8 + llist_add_to_end_#t~mem191#1.offset, 8);havoc llist_add_to_end_#t~mem191#1.base, llist_add_to_end_#t~mem191#1.offset;havoc llist_add_to_end_#t~mem188#1.base, llist_add_to_end_#t~mem188#1.offset, llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset, llist_add_to_end_#t~ret190#1.base, llist_add_to_end_#t~ret190#1.offset, llist_add_to_end_#t~mem191#1.base, llist_add_to_end_#t~mem191#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:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2755: assume !(getopt32_#t~mem170#1.base == 0 && getopt32_#t~mem170#1.offset == 0);havoc getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset;call getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem173#1 := read~int(getopt32_#t~mem172#1.base, getopt32_#t~mem172#1.offset, 4); [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2755: assume !!(getopt32_#t~mem170#1.base == 0 && getopt32_#t~mem170#1.offset == 0);havoc getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset; [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954: xatoi_positive_#t~ret216#1 := xatou_range_#res#1;havoc xatou_range_#t~ret217#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~ret216#1;havoc xatoi_positive_#t~ret216#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,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2756: assume 1 + getopt32_#t~mem173#1 <= 2147483647;call write~int(1 + getopt32_#t~mem173#1, getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset, 4); [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2756: assume !(1 + getopt32_#t~mem173#1 <= 2147483647); [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2756-1: assume 1 + getopt32_#t~mem173#1 >= -2147483648; [2025-02-08 13:29:50,584 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2756-1: assume !(1 + getopt32_#t~mem173#1 >= -2147483648); [2025-02-08 13:29:50,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: assume fopen_or_warn_~fp~0#1.base == 0 && fopen_or_warn_~fp~0#1.offset == 0;assume { :begin_inline_bb_simple_perror_msg } true;bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset := fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset;havoc bb_simple_perror_msg_#t~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#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~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#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~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#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~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#1.offset;havoc bb_perror_msg_#t~mem37#1, bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset, bb_perror_msg_#t~nondet39#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~mem37#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: assume !(fopen_or_warn_~fp~0#1.base == 0 && fopen_or_warn_~fp~0#1.offset == 0); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922: assume true; [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2922: assume !true; [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2757: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem174#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2757: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2395-1: fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset := fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset; [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: assume 45 == xstrtou_range_sfx_#t~mem221#1;havoc xstrtou_range_sfx_#t~mem221#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2990: assume !(45 == xstrtou_range_sfx_#t~mem221#1);havoc xstrtou_range_sfx_#t~mem221#1;call xstrtou_range_sfx_#t~mem222#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem222#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem231#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023: 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:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924: assume true; [2025-02-08 13:29:50,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924: assume !true;havoc __main_#t~nondet210#1;__main_~fp~1#1.base, __main_~fp~1#1.offset := __main_~fp~1#1.base, 8 + __main_~fp~1#1.offset;call __main_#t~mem211#1.base, __main_#t~mem211#1.offset := read~$Pointer$(__main_~fp~1#1.base, __main_~fp~1#1.offset, 8); [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-1: assume false; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924-1: assume !false; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2759: assume 1 == getopt32_#t~mem174#1;havoc getopt32_#t~mem174#1;call getopt32_#t~mem175#1.base, getopt32_#t~mem175#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~mem175#1.base, getopt32_#t~mem175#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem188#1.base, llist_add_to_end_#t~mem188#1.offset, llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset, llist_add_to_end_#t~ret190#1.base, llist_add_to_end_#t~ret190#1.offset, llist_add_to_end_#t~mem191#1.base, llist_add_to_end_#t~mem191#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,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2759: assume !(1 == getopt32_#t~mem174#1);havoc getopt32_#t~mem174#1;call getopt32_#t~mem176#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2892: havoc __main_~tmp_post$4~0#1.base, __main_~tmp_post$4~0#1.offset; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume !(4294967295 / (xstrtou_range_sfx_#t~mem231#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem231#1; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem231#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem231#1;call xstrtou_range_sfx_#t~mem232#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~mem232#1;havoc xstrtou_range_sfx_#t~mem232#1; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume __main_#t~mem211#1.base == 0 && __main_#t~mem211#1.offset == 0;havoc __main_#t~mem211#1.base, __main_#t~mem211#1.offset; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: assume !(__main_#t~mem211#1.base == 0 && __main_#t~mem211#1.offset == 0);havoc __main_#t~mem211#1.base, __main_#t~mem211#1.offset; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2893: assume !(0 == __main_~tmp_if_expr$3~1#1 % 256);call __main_#t~mem204#1.base, __main_#t~mem204#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);assume { :begin_inline_fopen_or_warn } true;fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset := __main_#t~mem204#1.base, __main_#t~mem204#1.offset, __main_~mode~0#1.base, __main_~mode~0#1.offset;havoc fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet77#1.base, fopen_or_warn_#t~nondet77#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset := fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset;fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset := fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;havoc fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset := fopen_or_warn_#t~nondet77#1.base, fopen_or_warn_#t~nondet77#1.offset;havoc fopen_or_warn_#t~nondet77#1.base, fopen_or_warn_#t~nondet77#1.offset; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2893: assume !!(0 == __main_~tmp_if_expr$3~1#1 % 256);__main_~tmp_post$4~0#1.base, __main_~tmp_post$4~0#1.offset := __main_~argv#1.base, __main_~argv#1.offset;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;call __main_#t~mem207#1.base, __main_#t~mem207#1.offset := read~$Pointer$(__main_~tmp_post$4~0#1.base, __main_~tmp_post$4~0#1.offset, 8);call write~$Pointer$(__main_#t~mem207#1.base, __main_#t~mem207#1.offset, __main_~np~0#1.base, __main_~np~0#1.offset, 8);havoc __main_#t~mem207#1.base, __main_#t~mem207#1.offset; [2025-02-08 13:29:50,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: assume 2 == getopt32_#t~mem176#1;havoc getopt32_#t~mem176#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~ret216#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~ret217#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~mem221#1, xstrtou_range_sfx_#t~mem222#1, xstrtou_range_sfx_#t~mem223#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~ret225#1, xstrtou_range_sfx_#t~mem226#1.base, xstrtou_range_sfx_#t~mem226#1.offset, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~mem228#1, xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset, xstrtou_range_sfx_#t~nondet230#1, xstrtou_range_sfx_#t~mem231#1, xstrtou_range_sfx_#t~mem232#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~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset, xstrtou_range_sfx_#t~mem234#1, xstrtou_range_sfx_#t~varargs235#1.base, xstrtou_range_sfx_#t~varargs235#1.offset, xstrtou_range_sfx_#t~varargs236#1.base, xstrtou_range_sfx_#t~varargs236#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~3#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~3#1;call xstrtou_range_sfx_#t~mem221#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:50,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: assume !(2 == getopt32_#t~mem176#1);havoc getopt32_#t~mem176#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); [2025-02-08 13:29:50,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2994: 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,589 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2895: __main_#t~ret205#1.base, __main_#t~ret205#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet77#1.base, fopen_or_warn_#t~nondet77#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;havoc fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;assume { :end_inline_fopen_or_warn } true;call write~$Pointer$(__main_#t~ret205#1.base, __main_#t~ret205#1.offset, __main_~fp~1#1.base, __main_~fp~1#1.offset, 8);havoc __main_#t~mem204#1.base, __main_#t~mem204#1.offset;havoc __main_#t~ret205#1.base, __main_#t~ret205#1.offset;call __main_#t~mem206#1.base, __main_#t~mem206#1.offset := read~$Pointer$(__main_~fp~1#1.base, __main_~fp~1#1.offset, 8); [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2829-1: assume 0 != safe_read_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2829-1: assume !(0 != safe_read_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2896: assume !(__main_#t~mem206#1.base == 0 && __main_#t~mem206#1.offset == 0);havoc __main_#t~mem206#1.base, __main_#t~mem206#1.offset; [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2896: assume !!(__main_#t~mem206#1.base == 0 && __main_#t~mem206#1.offset == 0);havoc __main_#t~mem206#1.base, __main_#t~mem206#1.offset;__main_~retval~0#1 := 1;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset; [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:29:50,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2996: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem223#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2831: safe_read_#t~ret192#1 := read_#res#1;havoc read_#t~nondet268#1, read_#t~nondet269#1, read_#t~nondet270#1, read_~fildes#1, read_~buf#1.base, read_~buf#1.offset, read_~nbyte#1, read_~ret~0#1, read_~offset~0#1;havoc read_#in~fildes#1, read_#in~buf#1.base, read_#in~buf#1.offset, read_#in~nbyte#1;assume { :end_inline_read } true;assume -9223372036854775808 <= safe_read_#t~ret192#1 && safe_read_#t~ret192#1 <= 9223372036854775807;safe_read_~n~0#1 := safe_read_#t~ret192#1;havoc safe_read_#t~ret192#1; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2765: getopt32_#t~ret177#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret216#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~ret177#1 && getopt32_#t~ret177#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret177#1;havoc getopt32_#t~ret177#1;call getopt32_#t~mem178#1.base, getopt32_#t~mem178#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~mem178#1.base, getopt32_#t~mem178#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832: assume safe_read_~n~0#1 < 0;call safe_read_#t~mem193#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_read_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_read_#t~mem193#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2832: assume !(safe_read_~n~0#1 < 0);safe_read_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031-1: call xstrtou_range_sfx_#t~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem234#1 := read~int(xstrtou_range_sfx_#t~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset, 1); [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: assume 0 == xstrtou_range_sfx_#t~mem234#1;havoc xstrtou_range_sfx_#t~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset;havoc xstrtou_range_sfx_#t~mem234#1; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3031: assume !(0 == xstrtou_range_sfx_#t~mem234#1);havoc xstrtou_range_sfx_#t~mem233#1.base, xstrtou_range_sfx_#t~mem233#1.offset;havoc xstrtou_range_sfx_#t~mem234#1; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2239: assume !(0 == bb_perror_msg_#t~mem37#1);havoc bb_perror_msg_#t~mem37#1; [2025-02-08 13:29:50,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2239: assume !!(0 == bb_perror_msg_#t~mem37#1);havoc bb_perror_msg_#t~mem37#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,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000: assume xstrtou_range_sfx_#t~mem223#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem223#1 - 9;havoc xstrtou_range_sfx_#t~mem223#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,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000: assume !(xstrtou_range_sfx_#t~mem223#1 - 9 <= 2147483647); [2025-02-08 13:29:50,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000-1: assume xstrtou_range_sfx_#t~mem223#1 - 9 >= -2147483648; [2025-02-08 13:29:50,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3000-1: assume !(xstrtou_range_sfx_#t~mem223#1 - 9 >= -2147483648); [2025-02-08 13:29:50,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: assume !(getopt32_#t~mem179#1.base == 0 && getopt32_#t~mem179#1.offset == 0);havoc getopt32_#t~mem179#1.base, getopt32_#t~mem179#1.offset;call getopt32_#t~mem180#1.base, getopt32_#t~mem180#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~mem180#1.base, getopt32_#t~mem180#1.offset, 8); [2025-02-08 13:29:50,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: assume !!(getopt32_#t~mem179#1.base == 0 && getopt32_#t~mem179#1.offset == 0);havoc getopt32_#t~mem179#1.base, getopt32_#t~mem179#1.offset; [2025-02-08 13:29:50,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2241-1: assume true;bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset := 0, 0; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2241-1: assume true;havoc bb_perror_msg_#t~nondet39#1;assume bb_perror_msg_#t~nondet39#1 % 18446744073709551616 > 0;call bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset := #Ultimate.allocOnHeap(bb_perror_msg_#t~nondet39#1 % 18446744073709551616);call write~int(0, bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet39#1 % 18446744073709551616 - 1, 1); [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2241: bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset := bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset;havoc bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset;havoc bb_perror_msg_#t~nondet39#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,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3035: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: assume true; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: assume !true; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3004: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3037: 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,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3037: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3005: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem224#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem224#1;havoc xstrtou_range_sfx_#t~mem224#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~nondet44#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet44#1;havoc bb_strtoui_#t~nondet44#1; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3005: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2246: call ULTIMATE.dealloc(bb_perror_msg_~p~1#1.base, 0);havoc bb_perror_msg_#t~mem37#1, bb_perror_msg_#t~nondet38#1.base, bb_perror_msg_#t~nondet38#1.offset, bb_perror_msg_#t~nondet39#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~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#1.offset;havoc bb_simple_perror_msg_#t~varargs43#1.base, bb_simple_perror_msg_#t~varargs43#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; [2025-02-08 13:29:50,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2246-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,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2742: assume -1 == getopt32_~c~0#1; [2025-02-08 13:29:50,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2742: 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:50,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3107: havoc getopt_long_#t~ret267#1;getopt32_#t~ret155#1 := getopt_long_#res#1;havoc getopt_long_#t~mem263#1.base, getopt_long_#t~mem263#1.offset, getopt_long_#t~mem264#1, getopt_long_#t~mem265#1.base, getopt_long_#t~mem265#1.offset, getopt_long_#t~mem266#1, getopt_long_#t~ret267#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~ret155#1 && getopt32_#t~ret155#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret155#1;havoc getopt32_#t~ret155#1; [2025-02-08 13:29:50,718 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-02-08 13:29:50,719 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:29:50,757 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:29:50,759 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:29:50,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:50 BoogieIcfgContainer [2025-02-08 13:29:50,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:29:50,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:29:50,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:29:50,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:29:50,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:23" (1/3) ... [2025-02-08 13:29:50,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fd27f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:50, skipping insertion in model container [2025-02-08 13:29:50,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:25" (2/3) ... [2025-02-08 13:29:50,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33fd27f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:50, skipping insertion in model container [2025-02-08 13:29:50,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:50" (3/3) ... [2025-02-08 13:29:50,770 INFO L128 eAbstractionObserver]: Analyzing ICFG tee-1.i [2025-02-08 13:29:50,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:29:50,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tee-1.i that has 8 procedures, 420 locations, 1 initial locations, 36 loop locations, and 75 error locations. [2025-02-08 13:29:50,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:29:50,861 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;@6d1ebcc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:29:50,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-02-08 13:29:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 420 states, 306 states have (on average 1.7091503267973855) internal successors, (523), 396 states have internal predecessors, (523), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-08 13:29:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:29:50,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:50,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:29:50,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:29:50,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:50,874 INFO L85 PathProgramCache]: Analyzing trace with hash 874801, now seen corresponding path program 1 times [2025-02-08 13:29:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487449861] [2025-02-08 13:29:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:50,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:29:54,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:29:54,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:54,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:56,725 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:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487449861] [2025-02-08 13:29:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487449861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:56,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:29:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779886460] [2025-02-08 13:29:56,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:56,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:56,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:56,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:56,754 INFO L87 Difference]: Start difference. First operand has 420 states, 306 states have (on average 1.7091503267973855) internal successors, (523), 396 states have internal predecessors, (523), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:56,898 INFO L93 Difference]: Finished difference Result 631 states and 851 transitions. [2025-02-08 13:29:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:56,900 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:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:56,907 INFO L225 Difference]: With dead ends: 631 [2025-02-08 13:29:56,907 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 13:29:56,911 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:56,914 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:56,914 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:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 13:29:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 13:29:56,964 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:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:29:56,974 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 3 [2025-02-08 13:29:56,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:56,975 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:29:56,975 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:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:29:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:29:56,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:56,976 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:29:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:29:56,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:29:56,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:56,979 INFO L85 PathProgramCache]: Analyzing trace with hash 292203229, now seen corresponding path program 1 times [2025-02-08 13:29:56,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:56,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353907296] [2025-02-08 13:29:56,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:56,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:59,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:59,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:59,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:59,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:01,151 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:30:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353907296] [2025-02-08 13:30:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353907296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:01,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620260806] [2025-02-08 13:30:01,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:01,157 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:30:01,158 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:30:04,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:06,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 17848 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:06,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:06,460 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:30:06,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620260806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:30:06,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234696550] [2025-02-08 13:30:06,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:06,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:06,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:06,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:06,463 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:30:10,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:10,970 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:30:10,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:10,971 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:30:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:10,972 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:30:10,973 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:30:10,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:10,973 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:10,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 688 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 13:30:10,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:30:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:30:10,987 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:30:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2025-02-08 13:30:10,989 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 6 [2025-02-08 13:30:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2025-02-08 13:30:10,989 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:30:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2025-02-08 13:30:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:10,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:10,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:11,034 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:30:11,190 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:30:11,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:30:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash 468366323, now seen corresponding path program 1 times [2025-02-08 13:30:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565036396] [2025-02-08 13:30:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:13,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:14,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:14,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:14,879 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:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:14,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565036396] [2025-02-08 13:30:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565036396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:14,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711775877] [2025-02-08 13:30:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:14,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:14,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:14,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:14,882 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:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:15,203 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2025-02-08 13:30:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:15,204 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:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:15,205 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:30:15,205 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:30:15,205 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:15,206 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:15,206 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.3s Time] [2025-02-08 13:30:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:30:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-02-08 13:30:15,218 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:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2025-02-08 13:30:15,219 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 7 [2025-02-08 13:30:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2025-02-08 13:30:15,220 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:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2025-02-08 13:30:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:15,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:15,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:15,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:15,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:30:15,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash 179908887, now seen corresponding path program 1 times [2025-02-08 13:30:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:15,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430127701] [2025-02-08 13:30:15,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:18,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:19,163 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:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430127701] [2025-02-08 13:30:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430127701] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:19,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294388377] [2025-02-08 13:30:19,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:19,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:19,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:19,166 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:19,167 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:22,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:24,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:24,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:24,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:24,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 17865 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:24,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:24,162 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:24,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:24,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294388377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:24,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843486557] [2025-02-08 13:30:24,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:24,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:24,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:24,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:24,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:24,164 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:28,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:28,541 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2025-02-08 13:30:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:28,542 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:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:28,543 INFO L225 Difference]: With dead ends: 191 [2025-02-08 13:30:28,544 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 13:30:28,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:28,544 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 187 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:28,545 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.4s Time] [2025-02-08 13:30:28,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 13:30:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 13:30:28,553 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:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2025-02-08 13:30:28,554 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 11 [2025-02-08 13:30:28,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:28,556 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2025-02-08 13:30:28,556 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:28,556 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2025-02-08 13:30:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:28,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:28,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:28,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:30:28,757 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:28,758 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:30:28,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:28,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1282209011, now seen corresponding path program 1 times [2025-02-08 13:30:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:28,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558424969] [2025-02-08 13:30:28,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:28,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:31,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:31,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:31,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:31,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:32,404 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:32,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558424969] [2025-02-08 13:30:32,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558424969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:32,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695442521] [2025-02-08 13:30:32,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:32,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:32,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:32,407 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:32,408 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:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:37,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:37,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:37,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:37,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 17866 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:37,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:37,593 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:37,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:37,637 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:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695442521] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:37,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57356565] [2025-02-08 13:30:37,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:37,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:37,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:37,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:37,639 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:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:37,722 INFO L93 Difference]: Finished difference Result 382 states and 480 transitions. [2025-02-08 13:30:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:37,724 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:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:37,725 INFO L225 Difference]: With dead ends: 382 [2025-02-08 13:30:37,725 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:30:37,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:37,726 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:37,726 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.1s Time] [2025-02-08 13:30:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:30:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:30:37,733 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:37,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:30:37,735 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 12 [2025-02-08 13:30:37,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:37,735 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:30:37,735 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:37,735 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:30:37,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:37,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:37,736 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:37,786 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:37,936 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:37,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:30:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1828809401, now seen corresponding path program 2 times [2025-02-08 13:30:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:37,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382991101] [2025-02-08 13:30:37,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:40,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:41,026 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:41,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:41,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:42,761 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:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:42,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382991101] [2025-02-08 13:30:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382991101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:42,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:42,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695795153] [2025-02-08 13:30:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:42,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:42,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:42,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:42,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:42,762 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:47,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:47,320 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:30:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:47,321 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:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:47,322 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:30:47,322 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 13:30:47,322 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:47,323 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 186 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:47,323 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.5s Time] [2025-02-08 13:30:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 13:30:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 13:30:47,330 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:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2025-02-08 13:30:47,332 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 21 [2025-02-08 13:30:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:47,332 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2025-02-08 13:30:47,332 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:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2025-02-08 13:30:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:47,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:47,333 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:47,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:47,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 72 more)] === [2025-02-08 13:30:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2064424002, now seen corresponding path program 1 times [2025-02-08 13:30:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682238969] [2025-02-08 13:30:47,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms