./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/expand-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/expand-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 dc7342a0709e0ad0c6582cb911dd40df44549e95bb4f798eec940d79e28053fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:24:51,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:24:51,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:24:51,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:24:51,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:24:51,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:24:51,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:24:51,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:24:51,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:24:51,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:24:51,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:24:51,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:24:51,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:24:51,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:24:51,679 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:24:51,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:24:51,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:24:51,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:24:51,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:24:51,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:24:51,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:24:51,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:24:51,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:51,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:24:51,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:24:51,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:24:51,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:24:51,683 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 -> dc7342a0709e0ad0c6582cb911dd40df44549e95bb4f798eec940d79e28053fc [2025-02-08 13:24:51,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:24:51,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:24:51,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:24:51,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:24:51,926 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:24:51,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/expand-1.i [2025-02-08 13:24:53,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01de81a50/595f444685a24b77a6ac44052b58e003/FLAG5e05ea32a [2025-02-08 13:24:53,585 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:24:53,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/expand-1.i [2025-02-08 13:24:53,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01de81a50/595f444685a24b77a6ac44052b58e003/FLAG5e05ea32a [2025-02-08 13:24:53,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01de81a50/595f444685a24b77a6ac44052b58e003 [2025-02-08 13:24:53,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:24:53,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:24:53,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:53,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:24:53,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:24:53,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:53" (1/1) ... [2025-02-08 13:24:53,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4938a555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:53, skipping insertion in model container [2025-02-08 13:24:53,734 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:24:53" (1/1) ... [2025-02-08 13:24:53,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:24:54,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:54,656 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:24:54,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:24:54,902 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:24:54,908 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:24:54,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54 WrapperNode [2025-02-08 13:24:54,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:24:54,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:54,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:24:54,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:24:54,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:54,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,063 INFO L138 Inliner]: procedures = 591, calls = 933, calls flagged for inlining = 37, calls inlined = 36, statements flattened = 2713 [2025-02-08 13:24:55,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:24:55,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:24:55,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:24:55,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:24:55,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,175 INFO L175 MemorySlicer]: Split 771 memory accesses to 27 slices as follows [41, 10, 2, 17, 5, 11, 3, 1, 15, 1, 107, 2, 19, 3, 3, 2, 3, 3, 11, 1, 17, 6, 6, 355, 44, 33, 50]. 46 percent of accesses are in the largest equivalence class. The 395 initializations are split as follows [12, 0, 0, 4, 0, 0, 0, 0, 0, 0, 7, 2, 0, 0, 3, 2, 3, 0, 1, 0, 0, 0, 4, 355, 0, 2, 0]. The 207 writes are split as follows [0, 9, 1, 4, 2, 6, 0, 1, 1, 1, 65, 0, 4, 0, 0, 0, 0, 3, 5, 1, 17, 6, 1, 0, 12, 21, 47]. [2025-02-08 13:24:55,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:24:55,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:24:55,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:24:55,316 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:24:55,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (1/1) ... [2025-02-08 13:24:55,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:24:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:24:55,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:24:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure getopt32 [2025-02-08 13:24:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getopt32 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:24:55,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:24:55,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:24:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:24:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:24:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:24:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#21 [2025-02-08 13:24:55,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#22 [2025-02-08 13:24:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#23 [2025-02-08 13:24:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#24 [2025-02-08 13:24:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#25 [2025-02-08 13:24:55,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#26 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:24:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#21 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#22 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#23 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#24 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#25 [2025-02-08 13:24:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#26 [2025-02-08 13:24:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:24:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#21 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#22 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#23 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#24 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#25 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#26 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:24:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:24:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:24:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-02-08 13:24:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:24:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:24:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:24:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:24:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:24:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:24:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:24:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:24:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:24:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:24:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#23 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#24 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#25 [2025-02-08 13:24:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#26 [2025-02-08 13:24:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:24:55,410 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:24:55,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#21 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#22 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#23 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#24 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#25 [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#26 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:24:55,412 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#21 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#22 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#23 [2025-02-08 13:24:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#24 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#25 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#26 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#22 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#23 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#24 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#25 [2025-02-08 13:24:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#26 [2025-02-08 13:24:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:24:55,417 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:24:55,417 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:24:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#21 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#22 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#23 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#24 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#25 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#26 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#21 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#22 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#23 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#24 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#25 [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#26 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:24:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:24:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-02-08 13:24:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure xatou_range [2025-02-08 13:24:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure xatou_range [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure unicode_strwidth [2025-02-08 13:24:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure unicode_strwidth [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:24:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-02-08 13:24:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc_fgets [2025-02-08 13:24:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc_fgets [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:24:55,424 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-02-08 13:24:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-02-08 13:24:55,960 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:24:55,962 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:24:56,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3456: xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret275#1;havoc xatoi_positive_#t~ret275#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:24:56,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977: assume 2 == #t~mem207#1;havoc #t~mem207#1;havoc ~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~ret275#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; [2025-02-08 13:24:56,560 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977: assume !(2 == #t~mem207#1);havoc #t~mem207#1;call #t~mem210#1.base, #t~mem210#1.offset := read~$Pointer$#24(~on_off~0#1.base, 18 + ~on_off~0#1.offset, 8); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3456-1: SUMMARY for call xatoi_positive_#t~ret275#1 := xatou_range(xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647); srcloc: null [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume true;call #t~mem187#1 := read~int#24(~on_off~0#1.base, ~on_off~0#1.offset, 1); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !true; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-2: assume !!((if #t~mem187#1 % 256 % 4294967296 <= 2147483647 then #t~mem187#1 % 256 % 4294967296 else #t~mem187#1 % 256 % 4294967296 - 4294967296) == ~c~1#1);havoc #t~mem187#1; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961-2: assume !((if #t~mem187#1 % 256 % 4294967296 <= 2147483647 then #t~mem187#1 % 256 % 4294967296 else #t~mem187#1 % 256 % 4294967296 - 4294967296) == ~c~1#1);havoc #t~mem187#1;call #t~mem188#1 := read~int#24(~on_off~0#1.base, ~on_off~0#1.offset, 1); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume 0 == (if #t~mem188#1 % 256 % 4294967296 <= 2147483647 then #t~mem188#1 % 256 % 4294967296 else #t~mem188#1 % 256 % 4294967296 - 4294967296);havoc #t~mem188#1; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2962: assume !(0 == (if #t~mem188#1 % 256 % 4294967296 <= 2147483647 then #t~mem188#1 % 256 % 4294967296 else #t~mem188#1 % 256 % 4294967296 - 4294967296));havoc #t~mem188#1;~on_off~0#1.base, ~on_off~0#1.offset := ~on_off~0#1.base, 34 + ~on_off~0#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3046: assume true;call llist_add_to_end_#t~mem225#1.base, llist_add_to_end_#t~mem225#1.offset := read~$Pointer$#10(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3046: assume !true; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3046-2: assume !!(llist_add_to_end_#t~mem225#1.base == 0 && llist_add_to_end_#t~mem225#1.offset == 0);havoc llist_add_to_end_#t~mem225#1.base, llist_add_to_end_#t~mem225#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3046-2: assume !(llist_add_to_end_#t~mem225#1.base == 0 && llist_add_to_end_#t~mem225#1.offset == 0);havoc llist_add_to_end_#t~mem225#1.base, llist_add_to_end_#t~mem225#1.offset;call llist_add_to_end_#t~mem226#1.base, llist_add_to_end_#t~mem226#1.offset := read~$Pointer$#10(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~mem226#1.base, llist_add_to_end_#t~mem226#1.offset;havoc llist_add_to_end_#t~mem226#1.base, llist_add_to_end_#t~mem226#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: #t~ret208#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret275#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 <= #t~ret208#1 && #t~ret208#1 <= 2147483647;~return_value_xatoi_positive$13~0#1 := #t~ret208#1;havoc #t~ret208#1;call #t~mem209#1.base, #t~mem209#1.offset := read~$Pointer$#24(~on_off~0#1.base, 18 + ~on_off~0#1.offset, 8);call write~int#10(~return_value_xatoi_positive$13~0#1, #t~mem209#1.base, #t~mem209#1.offset, 4);havoc ~return_value_xatoi_positive$13~0#1;havoc #t~mem209#1.base, #t~mem209#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume 0 != #t~bitwise190#1 % 4294967296;havoc #t~mem189#1;havoc #t~bitwise190#1; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964: assume !(0 != #t~bitwise190#1 % 4294967296);havoc #t~mem189#1;havoc #t~bitwise190#1;call #t~mem191#1 := read~int#24(~on_off~0#1.base, 2 + ~on_off~0#1.offset, 4);call #t~mem192#1 := read~int#24(~on_off~0#1.base, 6 + ~on_off~0#1.offset, 4); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-2: havoc #t~bitwise190#1;assume #t~bitwise190#1 % 4294967296 <= #t~mem189#1 % 4294967296 && #t~bitwise190#1 % 4294967296 <= ~flags~0#1 % 4294967296; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-1: [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-4: assume 0 == #t~mem189#1 % 4294967296 || 0 == ~flags~0#1 % 4294967296;#t~bitwise190#1 := 0; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-4: assume !(0 == #t~mem189#1 % 4294967296 || 0 == ~flags~0#1 % 4294967296); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-3: assume #t~mem189#1 % 4294967296 == ~flags~0#1 % 4294967296;#t~bitwise190#1 := #t~mem189#1; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-3: assume !(#t~mem189#1 % 4294967296 == ~flags~0#1 % 4294967296); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2964-5: call #t~mem189#1 := read~int#24(~on_off~0#1.base, 10 + ~on_off~0#1.offset, 4); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: call ULTIMATE.dealloc(~#complementary~0#1.base, ~#complementary~0#1.offset);havoc ~#complementary~0#1.base, ~#complementary~0#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3048: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret302#1.base, xzalloc_#t~ret302#1.offset, xzalloc_#t~memset~res303#1.base, xzalloc_#t~memset~res303#1.offset, xzalloc_~size#1, xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset; [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966: ~trigger~0#1 := #t~bitwise193#1;havoc #t~mem191#1;havoc #t~mem192#1;havoc #t~bitwise193#1;call #t~mem194#1 := read~int#24(~on_off~0#1.base, 6 + ~on_off~0#1.offset, 4); [2025-02-08 13:24:56,561 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-2: havoc #t~bitwise193#1;assume #t~bitwise193#1 % 4294967296 <= #t~mem191#1 % 4294967296 && #t~bitwise193#1 % 4294967296 <= #t~mem192#1 % 4294967296; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-1: [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-4: assume 0 == #t~mem191#1 % 4294967296 || 0 == #t~mem192#1 % 4294967296;#t~bitwise193#1 := 0; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-4: assume !(0 == #t~mem191#1 % 4294967296 || 0 == #t~mem192#1 % 4294967296); [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-3: assume #t~mem191#1 % 4294967296 == #t~mem192#1 % 4294967296;#t~bitwise193#1 := #t~mem191#1; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-3: assume !(#t~mem191#1 % 4294967296 == #t~mem192#1 % 4294967296); [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset := xzalloc_#t~ret302#1.base, xzalloc_#t~ret302#1.offset;havoc xzalloc_#t~ret302#1.base, xzalloc_#t~ret302#1.offset; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: llist_add_to_end_#t~ret227#1.base, llist_add_to_end_#t~ret227#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret302#1.base, xzalloc_#t~ret302#1.offset, xzalloc_#t~memset~res303#1.base, xzalloc_#t~memset~res303#1.offset, xzalloc_~size#1, xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret227#1.base, llist_add_to_end_#t~ret227#1.offset;havoc llist_add_to_end_#t~ret227#1.base, llist_add_to_end_#t~ret227#1.offset;call write~$Pointer$#10(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~mem228#1.base, llist_add_to_end_#t~mem228#1.offset := read~$Pointer$#10(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#10(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem228#1.base, 8 + llist_add_to_end_#t~mem228#1.offset, 8);havoc llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#1.offset;havoc llist_add_to_end_#t~mem225#1.base, llist_add_to_end_#t~mem225#1.offset, llist_add_to_end_#t~mem226#1.base, llist_add_to_end_#t~mem226#1.offset, llist_add_to_end_#t~ret227#1.base, llist_add_to_end_#t~ret227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#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:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-1: SUMMARY for call xzalloc_#t~ret302#1.base, xzalloc_#t~ret302#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-1: [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: ~flags~0#1 := #t~bitwise196#1;havoc #t~mem194#1;havoc #t~bitwise195#1;havoc #t~bitwise196#1;call #t~mem197#1 := read~int#24(~on_off~0#1.base, 2 + ~on_off~0#1.offset, 4); [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-3: assume ~flags~0#1 % 4294967296 == (4294967295 - #t~bitwise195#1) % 4294967296;#t~bitwise196#1 := ~flags~0#1; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-3: assume !(~flags~0#1 % 4294967296 == (4294967295 - #t~bitwise195#1) % 4294967296); [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-2: havoc #t~bitwise196#1;assume #t~bitwise196#1 % 4294967296 <= ~flags~0#1 % 4294967296 && #t~bitwise196#1 % 4294967296 <= (4294967295 - #t~bitwise195#1) % 4294967296; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-5: [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-4: assume 0 == ~flags~0#1 % 4294967296 || 0 == (4294967295 - #t~bitwise195#1) % 4294967296;#t~bitwise196#1 := 0; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-4: assume !(0 == ~flags~0#1 % 4294967296 || 0 == (4294967295 - #t~bitwise195#1) % 4294967296); [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-7: assume #t~mem194#1 % 4294967296 == ~trigger~0#1 % 4294967296;#t~bitwise195#1 := 0; [2025-02-08 13:24:56,562 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-7: assume !(#t~mem194#1 % 4294967296 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-6: havoc #t~bitwise195#1;assume #t~bitwise195#1 % 4294967296 <= #t~mem194#1 % 4294967296 + ~trigger~0#1 % 4294967296; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-9: assume 0 == #t~mem194#1 % 4294967296;#t~bitwise195#1 := ~trigger~0#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-9: assume !(0 == #t~mem194#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-8: assume 0 == ~trigger~0#1 % 4294967296;#t~bitwise195#1 := #t~mem194#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967-8: assume !(0 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595-1: SUMMARY for call xzalloc_#t~memset~res303#1.base, xzalloc_#t~memset~res303#1.offset := #Ultimate.C_memset#10(xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595: havoc xzalloc_#t~memset~res303#1.base, xzalloc_#t~memset~res303#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~3#1.base, xzalloc_~ptr~3#1.offset; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !(#t~mem210#1.base == 0 && #t~mem210#1.offset == 0);havoc #t~mem210#1.base, #t~mem210#1.offset;call #t~mem211#1.base, #t~mem211#1.offset := read~$Pointer$#24(~on_off~0#1.base, 18 + ~on_off~0#1.offset, 8);call write~$Pointer$#10(~optarg~0.base, ~optarg~0.offset, #t~mem211#1.base, #t~mem211#1.offset, 8); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !!(#t~mem210#1.base == 0 && #t~mem210#1.offset == 0);havoc #t~mem210#1.base, #t~mem210#1.offset; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968: ~flags~0#1 := #t~bitwise199#1;havoc #t~mem197#1;havoc #t~bitwise198#1;havoc #t~bitwise199#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-2: havoc #t~bitwise199#1;assume (#t~bitwise199#1 % 4294967296 >= ~flags~0#1 % 4294967296 && #t~bitwise199#1 % 4294967296 >= #t~bitwise198#1 % 4294967296) && #t~bitwise199#1 % 4294967296 <= ~flags~0#1 % 4294967296 + #t~bitwise198#1 % 4294967296; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-1: [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-4: assume 0 == ~flags~0#1 % 4294967296 || ~flags~0#1 % 4294967296 == #t~bitwise198#1 % 4294967296;#t~bitwise199#1 := #t~bitwise198#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-4: assume !(0 == ~flags~0#1 % 4294967296 || ~flags~0#1 % 4294967296 == #t~bitwise198#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-3: assume 0 == #t~bitwise198#1 % 4294967296;#t~bitwise199#1 := ~flags~0#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-3: assume !(0 == #t~bitwise198#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-6: havoc #t~bitwise198#1;assume #t~bitwise198#1 % 4294967296 <= #t~mem197#1 % 4294967296 + ~trigger~0#1 % 4294967296; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-5: [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-8: assume 0 == ~trigger~0#1 % 4294967296;#t~bitwise198#1 := #t~mem197#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-8: assume !(0 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-7: assume #t~mem197#1 % 4294967296 == ~trigger~0#1 % 4294967296;#t~bitwise198#1 := 0; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-7: assume !(#t~mem197#1 % 4294967296 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-9: assume 0 == #t~mem197#1 % 4294967296;#t~bitwise198#1 := ~trigger~0#1; [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2968-9: assume !(0 == #t~mem197#1 % 4294967296); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-1: [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969: ~flags~0#1 := #t~bitwise200#1;havoc #t~bitwise200#1;call #t~mem201#1.base, #t~mem201#1.offset := read~$Pointer$#24(~on_off~0#1.base, 26 + ~on_off~0#1.offset, 8); [2025-02-08 13:24:56,565 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-3: assume ~flags~0#1 % 4294967296 == ~trigger~0#1 % 4294967296;#t~bitwise200#1 := 0; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-3: assume !(~flags~0#1 % 4294967296 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-2: havoc #t~bitwise200#1;assume #t~bitwise200#1 % 4294967296 <= ~flags~0#1 % 4294967296 + ~trigger~0#1 % 4294967296; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-5: assume 0 == ~flags~0#1 % 4294967296;#t~bitwise200#1 := ~trigger~0#1; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-5: assume !(0 == ~flags~0#1 % 4294967296); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-4: assume 0 == ~trigger~0#1 % 4294967296;#t~bitwise200#1 := ~flags~0#1; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2969-4: assume !(0 == ~trigger~0#1 % 4294967296); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume !(#t~mem201#1.base == 0 && #t~mem201#1.offset == 0);havoc #t~mem201#1.base, #t~mem201#1.offset;call #t~mem202#1.base, #t~mem202#1.offset := read~$Pointer$#24(~on_off~0#1.base, 26 + ~on_off~0#1.offset, 8);call #t~mem203#1.base, #t~mem203#1.offset := read~$Pointer$#24(~on_off~0#1.base, 26 + ~on_off~0#1.offset, 8);call #t~mem204#1 := read~int#10(#t~mem203#1.base, #t~mem203#1.offset, 4); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume !!(#t~mem201#1.base == 0 && #t~mem201#1.offset == 0);havoc #t~mem201#1.base, #t~mem201#1.offset; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: assume true; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: assume !true; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971-1: assume 1 + #t~mem204#1 >= -2147483648; [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971-1: assume !(1 + #t~mem204#1 >= -2147483648); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971: assume 1 + #t~mem204#1 <= 2147483647;call write~int#10(1 + #t~mem204#1, #t~mem202#1.base, #t~mem202#1.offset, 4); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2971: assume !(1 + #t~mem204#1 <= 2147483647); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call #t~mem205#1 := read~int#24(~on_off~0#1.base, 1 + ~on_off~0#1.offset, 1); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:24:56,566 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3650: havoc getopt_long_#t~ret333#1;#t~ret186#1 := getopt_long_#res#1;havoc getopt_long_#t~mem329#1.base, getopt_long_#t~mem329#1.offset, getopt_long_#t~mem330#1, getopt_long_#t~mem331#1.base, getopt_long_#t~mem331#1.offset, getopt_long_#t~mem332#1, getopt_long_#t~ret333#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 <= #t~ret186#1 && #t~ret186#1 <= 2147483647;~c~1#1 := #t~ret186#1;havoc #t~ret186#1; [2025-02-08 13:24:56,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3650-2: getopt_long_#t~ret333#1 := getopt_#res#1;havoc getopt_#t~mem313#1.base, getopt_#t~mem313#1.offset, getopt_#t~mem314#1, getopt_#t~short315#1, getopt_#t~nondet316#1, getopt_#t~nondet317#1, getopt_#t~mem318#1, getopt_#t~short319#1, getopt_#t~nondet320#1, getopt_#t~mem321#1, getopt_#t~nondet322#1, getopt_#t~pre323#1, getopt_#t~mem324#1, getopt_#t~short325#1, getopt_#t~nondet326#1, getopt_#t~mem327#1.base, getopt_#t~mem327#1.offset, getopt_#t~pre328#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~ret333#1 && getopt_long_#t~ret333#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret333#1;havoc getopt_long_#t~ret333#1; [2025-02-08 13:24:56,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume -1 == ~c~1#1; [2025-02-08 13:24:56,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume !(-1 == ~c~1#1);~c~1#1 := ~c~1#1 % 256;~on_off~0#1.base, ~on_off~0#1.offset := ~#complementary~0#1.base, ~#complementary~0#1.offset; [2025-02-08 13:24:56,567 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume 1 == #t~mem205#1;havoc #t~mem205#1;call #t~mem206#1.base, #t~mem206#1.offset := read~$Pointer$#24(~on_off~0#1.base, 18 + ~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 := #t~mem206#1.base, #t~mem206#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem225#1.base, llist_add_to_end_#t~mem225#1.offset, llist_add_to_end_#t~mem226#1.base, llist_add_to_end_#t~mem226#1.offset, llist_add_to_end_#t~ret227#1.base, llist_add_to_end_#t~ret227#1.offset, llist_add_to_end_#t~mem228#1.base, llist_add_to_end_#t~mem228#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:24:56,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(1 == #t~mem205#1);havoc #t~mem205#1;call #t~mem207#1 := read~int#24(~on_off~0#1.base, 1 + ~on_off~0#1.offset, 1); [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3664: write_#res#1 := write_~ret~1#1; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3664-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:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616: 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~ret242#1, safe_write_#t~mem243#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~2#1; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3161-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:24:56,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3161-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3161: 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~nondet337#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~nondet337#1;assume -9223372036854775808 <= write_#t~nondet337#1 && write_#t~nondet337#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet337#1;havoc write_#t~nondet337#1; [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3161: assume !true; [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2418: #t~ret69#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet102#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret69#1 && #t~ret69#1 <= 2147483647;havoc #t~ret69#1;call #t~mem70#1.base, #t~mem70#1.offset := read~$Pointer$#8(~#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~mem70#1.base, #t~mem70#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret109#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:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: 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:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:24:56,880 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419: #t~ret71#1 := full_write_#res#1;havoc full_write_#t~ret109#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~ret71#1 && #t~ret71#1 <= 9223372036854775807;havoc #t~mem70#1.base, #t~mem70#1.offset;havoc #t~ret71#1; [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: full_write_#t~ret109#1 := safe_write_#res#1;havoc safe_write_#t~ret242#1, safe_write_#t~mem243#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~2#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret109#1 && full_write_#t~ret109#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret109#1;havoc full_write_#t~ret109#1; [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3163: safe_write_#t~ret242#1 := write_#res#1;havoc write_#t~nondet337#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~ret242#1 && safe_write_#t~ret242#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret242#1;havoc safe_write_#t~ret242#1; [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem243#1 := read~int#18(~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~mem243#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3164: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2619: assume full_write_~cc~0#1 < 0; [2025-02-08 13:24:56,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2619: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:24:56,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582: havoc xstrtou_range_sfx_#t~varargs300#1.base, xstrtou_range_sfx_#t~varargs300#1.offset; [2025-02-08 13:24:56,999 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582-2: call xstrtou_range_sfx_#t~varargs300#1.base, xstrtou_range_sfx_#t~varargs300#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#21(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs300#1.base, xstrtou_range_sfx_#t~varargs300#1.offset, 8);call write~int#21(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs300#1.base, 8 + xstrtou_range_sfx_#t~varargs300#1.offset, 8);call write~int#21(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs300#1.base, 16 + xstrtou_range_sfx_#t~varargs300#1.offset, 8); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582-1: SUMMARY for call bb_error_msg_and_die(14, 0, xstrtou_range_sfx_#t~varargs300#1.base, xstrtou_range_sfx_#t~varargs300#1.offset); srcloc: null [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3549: xstrtou_range_sfx_#t~ret290#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet47#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_#t~ret290#1;havoc xstrtou_range_sfx_#t~ret290#1;call xstrtou_range_sfx_#t~mem291#1.base, xstrtou_range_sfx_#t~mem291#1.offset := read~$Pointer$#6(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3558: 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~mem294#1.base, xstrtou_range_sfx_#t~mem294#1.offset := read~$Pointer$#6(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~nondet295#1;havoc xstrtou_range_sfx_#t~mem294#1.base, xstrtou_range_sfx_#t~mem294#1.offset;havoc xstrtou_range_sfx_#t~nondet295#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3556: assume true;call xstrtou_range_sfx_#t~mem293#1 := read~int#13(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3556: assume !true; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3556-1: assume !(0 == xstrtou_range_sfx_#t~mem293#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem293#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3556-1: assume !!(0 == xstrtou_range_sfx_#t~mem293#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem293#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3552: assume 0 == xstrtou_range_sfx_#t~mem292#1;havoc xstrtou_range_sfx_#t~mem292#1;call write~int#18(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3552: assume !(0 == xstrtou_range_sfx_#t~mem292#1);havoc xstrtou_range_sfx_#t~mem292#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem291#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem291#1.offset);havoc xstrtou_range_sfx_#t~mem291#1.base, xstrtou_range_sfx_#t~mem291#1.offset;call xstrtou_range_sfx_#t~mem292#1 := read~int#18(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3550: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem291#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem291#1.offset);havoc xstrtou_range_sfx_#t~mem291#1.base, xstrtou_range_sfx_#t~mem291#1.offset; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3577: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~1#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3577: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: assume xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3575: assume !(xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3571-1: call xstrtou_range_sfx_#t~mem298#1.base, xstrtou_range_sfx_#t~mem298#1.offset := read~$Pointer$#6(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem299#1 := read~int#10(xstrtou_range_sfx_#t~mem298#1.base, xstrtou_range_sfx_#t~mem298#1.offset, 1); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3571: assume 0 == xstrtou_range_sfx_#t~mem299#1;havoc xstrtou_range_sfx_#t~mem298#1.base, xstrtou_range_sfx_#t~mem298#1.offset;havoc xstrtou_range_sfx_#t~mem299#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3571: assume !(0 == xstrtou_range_sfx_#t~mem299#1);havoc xstrtou_range_sfx_#t~mem298#1.base, xstrtou_range_sfx_#t~mem298#1.offset;havoc xstrtou_range_sfx_#t~mem299#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: assume !(4294967295 / (xstrtou_range_sfx_#t~mem296#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem296#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem296#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem296#1;call xstrtou_range_sfx_#t~mem297#1 := read~int#13(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_~r~1#1 * xstrtou_range_sfx_#t~mem297#1;havoc xstrtou_range_sfx_#t~mem297#1; [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3563: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem296#1 := read~int#13(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3563: 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:24:57,000 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:24:57,001 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3421: havoc #t~mem271#1;call ULTIMATE.dealloc(~#uni_stat~0#1.base, ~#uni_stat~0#1.offset);havoc ~#uni_stat~0#1.base, ~#uni_stat~0#1.offset; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3355: assume !(-1 == unicode_conv_to_printable2_#t~mem261#1);havoc unicode_conv_to_printable2_#t~mem261#1;call unicode_conv_to_printable2_#t~mem262#1 := read~int#5(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3355: assume !!(-1 == unicode_conv_to_printable2_#t~mem261#1);havoc unicode_conv_to_printable2_#t~mem261#1;call write~int#5(63, unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4);unicode_conv_to_printable2_~w~0#1 := 1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446: call write~int#10((if wcrtomb_internal_#t~bitwise272#1 % 256 <= 127 then wcrtomb_internal_#t~bitwise272#1 % 256 else wcrtomb_internal_#t~bitwise272#1 % 256 - 256), wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset + wcrtomb_internal_~i~1#1, 1);havoc wcrtomb_internal_#t~bitwise272#1;wcrtomb_internal_~wc#1 := wcrtomb_internal_~wc#1 / 64; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-2: havoc wcrtomb_internal_#t~bitwise272#1;assume ((((wcrtomb_internal_~wc#1 % 64 < 0 || wcrtomb_internal_#t~bitwise272#1 >= 128) && wcrtomb_internal_#t~bitwise272#1 >= wcrtomb_internal_~wc#1 % 64) && (wcrtomb_internal_~wc#1 % 64 < 0 || wcrtomb_internal_#t~bitwise272#1 <= 128 + wcrtomb_internal_~wc#1 % 64)) && (wcrtomb_internal_~wc#1 % 64 >= 0 || wcrtomb_internal_#t~bitwise272#1 < 0)) && wcrtomb_internal_#t~bitwise272#1 <= 2147483647; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-1: [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-4: assume 0 == wcrtomb_internal_~wc#1 % 64 || 128 == wcrtomb_internal_~wc#1 % 64;wcrtomb_internal_#t~bitwise272#1 := 128; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-4: assume !(0 == wcrtomb_internal_~wc#1 % 64 || 128 == wcrtomb_internal_~wc#1 % 64); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-3: assume false;wcrtomb_internal_#t~bitwise272#1 := wcrtomb_internal_~wc#1 % 64; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3446-3: assume !false; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: assume unicode_conv_to_printable2_~w~0#1 > 1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: assume !(unicode_conv_to_printable2_~w~0#1 > 1); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2431: assume 127 == bb_wcwidth_~ucs#1 % 4294967296; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2431: assume !(127 == bb_wcwidth_~ucs#1 % 4294967296); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume bb_wcwidth_~ucs#1 % 4294967296 > 767;bb_wcwidth_#res#1 := -1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2440: assume !(bb_wcwidth_~ucs#1 % 4294967296 > 767);bb_wcwidth_#res#1 := 1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3324: assume !((if unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 else unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 - 4294967296) < 32); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3324: assume !!((if unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 else unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 - 4294967296) < 32);call write~int#10(63, unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset, 1); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3357: assume 0 == unicode_conv_to_printable2_#t~mem262#1;havoc unicode_conv_to_printable2_#t~mem262#1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3357: assume !(0 == unicode_conv_to_printable2_#t~mem262#1);havoc unicode_conv_to_printable2_#t~mem262#1;call unicode_conv_to_printable2_#t~mem263#1 := read~int#5(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4); [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: havoc unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3440: wcrtomb_internal_~i~1#1 := wcrtomb_internal_~n~2#1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374: unicode_conv_to_printable2_~width#1 := unicode_conv_to_printable2_~width#1 - unicode_conv_to_printable2_~w~0#1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3383-1: SUMMARY for call unicode_conv_to_printable2_#t~ret266#1.base, unicode_conv_to_printable2_#t~ret266#1.offset := xrealloc(unicode_conv_to_printable2_~dst~1#1.base, unicode_conv_to_printable2_~dst~1#1.offset, (6 + unicode_conv_to_printable2_~dst_len~0#1) % 4294967296); srcloc: null [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3383: unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.base, unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.offset := unicode_conv_to_printable2_#t~ret266#1.base, unicode_conv_to_printable2_#t~ret266#1.offset;havoc unicode_conv_to_printable2_#t~ret266#1.base, unicode_conv_to_printable2_#t~ret266#1.offset;unicode_conv_to_printable2_~dst~1#1.base, unicode_conv_to_printable2_~dst~1#1.offset := unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.base, unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.offset;havoc unicode_conv_to_printable2_~return_value_wcrtomb_internal$5~0#1;call unicode_conv_to_printable2_#t~mem267#1 := read~int#5(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4);assume { :begin_inline_wcrtomb_internal } true;wcrtomb_internal_#in~s#1.base, wcrtomb_internal_#in~s#1.offset, wcrtomb_internal_#in~wc#1 := unicode_conv_to_printable2_~dst~1#1.base, unicode_conv_to_printable2_~dst~1#1.offset + (if unicode_conv_to_printable2_~dst_len~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then unicode_conv_to_printable2_~dst_len~0#1 % 4294967296 % 18446744073709551616 else unicode_conv_to_printable2_~dst_len~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), unicode_conv_to_printable2_#t~mem267#1;havoc wcrtomb_internal_#res#1;havoc wcrtomb_internal_#t~bitwise272#1, wcrtomb_internal_#t~bitwise273#1, wcrtomb_internal_#t~bitwise274#1, wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset, wcrtomb_internal_~wc#1, wcrtomb_internal_~n~2#1, wcrtomb_internal_~i~1#1, wcrtomb_internal_~v~1#1;wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset := wcrtomb_internal_#in~s#1.base, wcrtomb_internal_#in~s#1.offset;wcrtomb_internal_~wc#1 := wcrtomb_internal_#in~wc#1;havoc wcrtomb_internal_~n~2#1;havoc wcrtomb_internal_~i~1#1;wcrtomb_internal_~v~1#1 := wcrtomb_internal_~wc#1; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441-1: assume true; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441-1: assume !true; [2025-02-08 13:24:57,214 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441: assume true; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441: assume !true; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: assume (if unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 else unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 - 4294967296) < 0;unicode_conv_to_printable2_~width#1 := unicode_conv_to_printable2_~width#1 + unicode_conv_to_printable2_~w~0#1; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: assume !((if unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 else unicode_conv_to_printable2_~width#1 % 4294967296 % 4294967296 - 4294967296) < 0);unicode_conv_to_printable2_~uni_count~0#1 := 1 + unicode_conv_to_printable2_~uni_count~0#1;unicode_conv_to_printable2_~uni_width~0#1 := unicode_conv_to_printable2_~uni_width~0#1 + unicode_conv_to_printable2_~w~0#1;havoc unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.base, unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.offset; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: assume (if unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 else unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 - 4294967296) >= 127; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: assume !((if unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 <= 2147483647 then unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 else unicode_conv_to_printable2_~c~5#1 % 256 % 4294967296 - 4294967296) >= 127); [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: assume unicode_conv_to_printable2_#t~mem263#1 > 767;havoc unicode_conv_to_printable2_#t~mem263#1; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3359: assume !(unicode_conv_to_printable2_#t~mem263#1 > 767);havoc unicode_conv_to_printable2_#t~mem263#1;call unicode_conv_to_printable2_#t~mem264#1 := read~int#5(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4);assume { :begin_inline_bb_wcwidth } true;bb_wcwidth_#in~ucs#1 := unicode_conv_to_printable2_#t~mem264#1;havoc bb_wcwidth_#res#1;havoc bb_wcwidth_#t~bitwise75#1, bb_wcwidth_~ucs#1;bb_wcwidth_~ucs#1 := bb_wcwidth_#in~ucs#1; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450: call write~int#10((if wcrtomb_internal_#t~bitwise274#1 % 256 <= 127 then wcrtomb_internal_#t~bitwise274#1 % 256 else wcrtomb_internal_#t~bitwise274#1 % 256 - 256), wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset, 1);havoc wcrtomb_internal_#t~bitwise273#1;havoc wcrtomb_internal_#t~bitwise274#1;wcrtomb_internal_#res#1 := wcrtomb_internal_~n~2#1; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-2: havoc wcrtomb_internal_#t~bitwise274#1;assume (((((wcrtomb_internal_~wc#1 < 0 && (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296) >= 0) || wcrtomb_internal_#t~bitwise274#1 >= (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296)) && ((wcrtomb_internal_~wc#1 >= 0 && (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296) < 0) || wcrtomb_internal_#t~bitwise274#1 >= wcrtomb_internal_~wc#1)) && ((wcrtomb_internal_~wc#1 < 0 || (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296) < 0) || wcrtomb_internal_#t~bitwise274#1 <= wcrtomb_internal_~wc#1 + (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296))) && ((wcrtomb_internal_~wc#1 >= 0 && (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296) >= 0) || wcrtomb_internal_#t~bitwise274#1 < 0)) && wcrtomb_internal_#t~bitwise274#1 <= 2147483647; [2025-02-08 13:24:57,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-1: [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-4: assume 0 == wcrtomb_internal_~wc#1 || wcrtomb_internal_~wc#1 == (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296);wcrtomb_internal_#t~bitwise274#1 := (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-4: assume !(0 == wcrtomb_internal_~wc#1 || wcrtomb_internal_~wc#1 == (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296)); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-3: assume 0 == (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296);wcrtomb_internal_#t~bitwise274#1 := wcrtomb_internal_~wc#1; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-3: assume !(0 == (if wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 <= 2147483647 then wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 else wcrtomb_internal_#t~bitwise273#1 % 256 % 4294967296 - 4294967296)); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-6: havoc wcrtomb_internal_#t~bitwise273#1;assume wcrtomb_internal_#t~bitwise273#1 < 16128; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-5: [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-8: assume 0 <= wcrtomb_internal_~n~2#1 && wcrtomb_internal_~n~2#1 < 32; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-8: assume !(0 <= wcrtomb_internal_~n~2#1 && wcrtomb_internal_~n~2#1 < 32); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-7: assume 0 == wcrtomb_internal_~n~2#1;wcrtomb_internal_#t~bitwise273#1 := 16128; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3450-7: assume !(0 == wcrtomb_internal_~n~2#1); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434: assume wcrtomb_internal_~v~1#1 % 4294967296 >= 2048; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434: assume !(wcrtomb_internal_~v~1#1 % 4294967296 >= 2048); [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434-2: assume 1 + wcrtomb_internal_~n~2#1 >= -2147483648; [2025-02-08 13:24:57,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434-2: assume !(1 + wcrtomb_internal_~n~2#1 >= -2147483648); [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434-1: assume 1 + wcrtomb_internal_~n~2#1 <= 2147483647;wcrtomb_internal_~n~2#1 := 1 + wcrtomb_internal_~n~2#1; [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3434-1: assume !(1 + wcrtomb_internal_~n~2#1 <= 2147483647); [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3335: unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset := unicode_conv_to_printable2_~d~0#1.base, 1 + unicode_conv_to_printable2_~d~0#1.offset;havoc unicode_conv_to_printable2_~c~5#1; [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2427: assume 0 == bb_wcwidth_~ucs#1 % 4294967296;bb_wcwidth_#res#1 := 0; [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2427: assume !(0 == bb_wcwidth_~ucs#1 % 4294967296); [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3319: unicode_conv_to_printable2_#t~ret257#1.base, unicode_conv_to_printable2_#t~ret257#1.offset := xstrndup_#res#1.base, xstrndup_#res#1.offset;havoc xstrndup_#t~mem283#1, xstrndup_#t~ret284#1.base, xstrndup_#t~ret284#1.offset, xstrndup_#t~memcpy~res285#1.base, xstrndup_#t~memcpy~res285#1.offset, xstrndup_~s#1.base, xstrndup_~s#1.offset, xstrndup_~n#1, xstrndup_~m~0#1, xstrndup_~t~0#1.base, xstrndup_~t~0#1.offset, xstrndup_~return_value_xmalloc$1~1#1.base, xstrndup_~return_value_xmalloc$1~1#1.offset, xstrndup_~return_value_memcpy$2~0#1.base, xstrndup_~return_value_memcpy$2~0#1.offset;havoc xstrndup_#in~s#1.base, xstrndup_#in~s#1.offset, xstrndup_#in~n#1;assume { :end_inline_xstrndup } true;unicode_conv_to_printable2_~dst~1#1.base, unicode_conv_to_printable2_~dst~1#1.offset := unicode_conv_to_printable2_#t~ret257#1.base, unicode_conv_to_printable2_#t~ret257#1.offset;havoc unicode_conv_to_printable2_#t~ret257#1.base, unicode_conv_to_printable2_#t~ret257#1.offset;unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset := unicode_conv_to_printable2_~dst~1#1.base, unicode_conv_to_printable2_~dst~1#1.offset; [2025-02-08 13:24:57,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443-1: assume wcrtomb_internal_~i~1#1 - 1 >= -2147483648; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443-1: assume !(wcrtomb_internal_~i~1#1 - 1 >= -2147483648); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: assume wcrtomb_internal_~i~1#1 - 1 <= 2147483647;wcrtomb_internal_~i~1#1 := wcrtomb_internal_~i~1#1 - 1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: assume !(wcrtomb_internal_~i~1#1 - 1 <= 2147483647); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: unicode_conv_to_printable2_#t~ret265#1 := bb_wcwidth_#res#1;havoc bb_wcwidth_#t~bitwise75#1, bb_wcwidth_~ucs#1;havoc bb_wcwidth_#in~ucs#1;assume { :end_inline_bb_wcwidth } true;assume -2147483648 <= unicode_conv_to_printable2_#t~ret265#1 && unicode_conv_to_printable2_#t~ret265#1 <= 2147483647;unicode_conv_to_printable2_~w~0#1 := unicode_conv_to_printable2_#t~ret265#1;havoc unicode_conv_to_printable2_#t~mem264#1;havoc unicode_conv_to_printable2_#t~ret265#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3386: unicode_conv_to_printable2_#t~ret268#1 := wcrtomb_internal_#res#1;havoc wcrtomb_internal_#t~bitwise272#1, wcrtomb_internal_#t~bitwise273#1, wcrtomb_internal_#t~bitwise274#1, wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset, wcrtomb_internal_~wc#1, wcrtomb_internal_~n~2#1, wcrtomb_internal_~i~1#1, wcrtomb_internal_~v~1#1;havoc wcrtomb_internal_#in~s#1.base, wcrtomb_internal_#in~s#1.offset, wcrtomb_internal_#in~wc#1;assume { :end_inline_wcrtomb_internal } true;unicode_conv_to_printable2_~return_value_wcrtomb_internal$5~0#1 := unicode_conv_to_printable2_#t~ret268#1;havoc unicode_conv_to_printable2_#t~mem267#1;havoc unicode_conv_to_printable2_#t~ret268#1;unicode_conv_to_printable2_~dst_len~0#1 := unicode_conv_to_printable2_~dst_len~0#1 + unicode_conv_to_printable2_~return_value_wcrtomb_internal$5~0#1;call ULTIMATE.dealloc(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset);havoc unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset;havoc unicode_conv_to_printable2_~w~0#1, unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.base, unicode_conv_to_printable2_~return_value_xrealloc$4~0#1.offset, unicode_conv_to_printable2_~return_value_wcrtomb_internal$5~0#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: assume 0 == wcrtomb_internal_~i~1#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3444: assume !(0 == wcrtomb_internal_~i~1#1); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3436: assume !(wcrtomb_internal_~n~2#1 < 6); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3436: assume !!(wcrtomb_internal_~n~2#1 < 6);wcrtomb_internal_~v~1#1 := wcrtomb_internal_~v~1#1 % 4294967296 / 32; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: assume wcrtomb_internal_~v~1#1 % 4294967296 <= 127;call write~int#10((if wcrtomb_internal_~v~1#1 % 4294967296 % 256 <= 127 then wcrtomb_internal_~v~1#1 % 4294967296 % 256 else wcrtomb_internal_~v~1#1 % 4294967296 % 256 - 256), wcrtomb_internal_~s#1.base, wcrtomb_internal_~s#1.offset, 1);wcrtomb_internal_#res#1 := 1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: assume !(wcrtomb_internal_~v~1#1 % 4294967296 <= 127);wcrtomb_internal_~n~2#1 := 2; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3362: assume unicode_conv_to_printable2_~w~0#1 <= 0; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3362: assume !(unicode_conv_to_printable2_~w~0#1 <= 0); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-1: [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429: assume !(bb_wcwidth_#t~bitwise75#1 % 4294967296 < 32);havoc bb_wcwidth_#t~bitwise75#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429: assume !!(bb_wcwidth_#t~bitwise75#1 % 4294967296 < 32);havoc bb_wcwidth_#t~bitwise75#1;bb_wcwidth_#res#1 := -1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-3: assume 4294967167 == bb_wcwidth_~ucs#1 % 4294967296;bb_wcwidth_#t~bitwise75#1 := 4294967167; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-3: assume !(4294967167 == bb_wcwidth_~ucs#1 % 4294967296); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3354: unicode_conv_to_printable2_#t~ret260#1.base, unicode_conv_to_printable2_#t~ret260#1.offset := mbstowc_internal_#res#1.base, mbstowc_internal_#res#1.offset;havoc mbstowc_internal_#t~mem229#1, mbstowc_internal_#t~bitwise230#1, mbstowc_internal_#t~short231#1, mbstowc_internal_#t~bitwise232#1, mbstowc_internal_#t~mem233#1, mbstowc_internal_#t~bitwise234#1, mbstowc_internal_~ch~1#1, mbstowc_internal_~res#1.base, mbstowc_internal_~res#1.offset, mbstowc_internal_~src#1.base, mbstowc_internal_~src#1.offset, mbstowc_internal_~bytes~0#1, mbstowc_internal_~c~2#1, mbstowc_internal_~tmp_post$1~0#1.base, mbstowc_internal_~tmp_post$1~0#1.offset;havoc mbstowc_internal_#in~res#1.base, mbstowc_internal_#in~res#1.offset, mbstowc_internal_#in~src#1.base, mbstowc_internal_#in~src#1.offset;assume { :end_inline_mbstowc_internal } true;unicode_conv_to_printable2_~src#1.base, unicode_conv_to_printable2_~src#1.offset := unicode_conv_to_printable2_#t~ret260#1.base, unicode_conv_to_printable2_#t~ret260#1.offset;havoc unicode_conv_to_printable2_#t~ret260#1.base, unicode_conv_to_printable2_#t~ret260#1.offset;call unicode_conv_to_printable2_#t~mem261#1 := read~int#5(unicode_conv_to_printable2_~#wc~0#1.base, unicode_conv_to_printable2_~#wc~0#1.offset, 4); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-2: havoc bb_wcwidth_#t~bitwise75#1;assume bb_wcwidth_#t~bitwise75#1 % 4294967296 <= 4294967167 && bb_wcwidth_#t~bitwise75#1 % 4294967296 <= bb_wcwidth_~ucs#1 % 4294967296; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321-1: assume !!(0 == unicode_conv_to_printable2_#t~mem258#1);havoc unicode_conv_to_printable2_#t~mem258#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321-1: assume !(0 == unicode_conv_to_printable2_#t~mem258#1);havoc unicode_conv_to_printable2_#t~mem258#1;call unicode_conv_to_printable2_#t~mem259#1 := read~int#10(unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset, 1);unicode_conv_to_printable2_~c~5#1 := unicode_conv_to_printable2_#t~mem259#1;havoc unicode_conv_to_printable2_#t~mem259#1; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-4: assume 0 == bb_wcwidth_~ucs#1 % 4294967296;bb_wcwidth_#t~bitwise75#1 := 0; [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2429-4: assume !(0 == bb_wcwidth_~ucs#1 % 4294967296); [2025-02-08 13:24:57,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: assume true;call unicode_conv_to_printable2_#t~mem258#1 := read~int#10(unicode_conv_to_printable2_~d~0#1.base, unicode_conv_to_printable2_~d~0#1.offset, 1); [2025-02-08 13:24:57,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3321: assume !true; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3488: call ULTIMATE.dealloc(~#i~2#1.base, ~#i~2#1.offset);havoc ~#i~2#1.base, ~#i~2#1.offset; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2272: bb_get_chunk_from_file_~tmp_post$2~0#1 := bb_get_chunk_from_file_~idx~0#1;bb_get_chunk_from_file_~idx~0#1 := 1 + bb_get_chunk_from_file_~idx~0#1;call write~int#10((if bb_get_chunk_from_file_~ch~0#1 % 256 <= 127 then bb_get_chunk_from_file_~ch~0#1 % 256 else bb_get_chunk_from_file_~ch~0#1 % 256 - 256), bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset + (if bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 else bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269-1: SUMMARY for call bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset := xrealloc(bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, (256 + bb_get_chunk_from_file_~idx~0#1) % 4294967296); srcloc: null [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269: bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset := bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;havoc bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset := bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2267: assume 0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2267: assume !(0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296); [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume -1 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume !(-1 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2262-1: assume true; [2025-02-08 13:24:57,345 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2262-1: assume !true; [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3599: havoc _IO_getc_#t~nondet304#1;bb_get_chunk_from_file_#t~ret37#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet304#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;havoc _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume { :end_inline__IO_getc } true;assume -2147483648 <= bb_get_chunk_from_file_#t~ret37#1 && bb_get_chunk_from_file_#t~ret37#1 <= 2147483647;bb_get_chunk_from_file_~ch~0#1 := bb_get_chunk_from_file_#t~ret37#1;havoc bb_get_chunk_from_file_#t~ret37#1; [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: assume 10 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2279: assume !(10 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2277: assume !(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2277: assume !!(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2275: assume 0 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:24:57,346 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2275: assume !(0 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:25:02,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2496: call ULTIMATE.dealloc(__main_~#opt_t~0#1.base, __main_~#opt_t~0#1.offset);havoc __main_~#opt_t~0#1.base, __main_~#opt_t~0#1.offset; [2025-02-08 13:25:02,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: call ULTIMATE.dealloc(unexpand_~line~1#1.base, unexpand_~line~1#1.offset);havoc unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, unexpand_~column~0#1; [2025-02-08 13:25:02,205 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3190: unexpand_~line~1#1.base, unexpand_~line~1#1.offset := unexpand_#t~ret244#1.base, unexpand_#t~ret244#1.offset;havoc unexpand_#t~ret244#1.base, unexpand_#t~ret244#1.offset; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3223: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3190-1: SUMMARY for call unexpand_#t~ret244#1.base, unexpand_#t~ret244#1.offset := xmalloc_fgets(unexpand_~file#1.base, unexpand_~file#1.offset); srcloc: null [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: assume __main_#t~mem95#1.base == 0 && __main_#t~mem95#1.offset == 0;havoc __main_#t~mem95#1.base, __main_#t~mem95#1.offset; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: assume !(__main_#t~mem95#1.base == 0 && __main_#t~mem95#1.offset == 0);havoc __main_#t~mem95#1.base, __main_#t~mem95#1.offset; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2480: expand_~len~0#1 := expand_~tab_size#1 - expand_~len~0#1 % 4294967296 % (expand_~tab_size#1 % 4294967296);havoc expand_#t~ret79#1;havoc expand_#t~ret79#1;expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset := expand_~ptr~0#1.base, 1 + expand_~ptr~0#1.offset;havoc expand_~len~0#1, expand_~return_value_unicode_strwidth$2~0#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: unexpand_~column~0#1 := unexpand_~column~0#1 + (unexpand_~tab_size#1 - unexpand_~column~0#1 % 4294967296 % (unexpand_~tab_size#1 % 4294967296));unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset := unexpand_~ptr~1#1.base, 1 + unexpand_~ptr~1#1.offset; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2530: havoc __main_~return_value_fclose_if_not_stdin$1~0#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset);assume -2147483648 <= fclose_if_not_stdin_#t~nondet100#1 && fclose_if_not_stdin_#t~nondet100#1 <= 2147483647;fclose_if_not_stdin_~return_value_fclose$1~0#1 := fclose_if_not_stdin_#t~nondet100#1;havoc fclose_if_not_stdin_#t~nondet100#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: assume !!(fclose_if_not_stdin_~f#1.base == ~stdin~0.base && fclose_if_not_stdin_~f#1.offset == ~stdin~0.offset); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: unexpand_~n~1#1 := unexpand_~column~0#1 % 4294967296 / (unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: assume !(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: assume !!(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: assume unexpand_~line~1#1.base == 0 && unexpand_~line~1#1.offset == 0; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: assume !(unexpand_~line~1#1.base == 0 && unexpand_~line~1#1.offset == 0);unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset := unexpand_~line~1#1.base, unexpand_~line~1#1.offset;unexpand_~column~0#1 := 0; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448: assume true; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448: assume !true; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448-1: assume true; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448-1: assume !true; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539-1: SUMMARY for call bb_simple_perror_msg(__main_#t~mem94#1.base, __main_#t~mem94#1.offset); srcloc: null [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2539: havoc __main_#t~mem94#1.base, __main_#t~mem94#1.offset;__main_~exit_status~0#1 := 1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3208: unexpand_~column~0#1 := unexpand_~column~0#1 + unexpand_~len~1#1;call unexpand_#t~mem247#1 := read~int#10(unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, 1); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241: assume !(unexpand_~ptr~1#1.base == unexpand_~line~1#1.base && unexpand_~ptr~1#1.offset == unexpand_~line~1#1.offset);havoc unexpand_#t~ret249#1;havoc unexpand_#t~ret249#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3241: assume !!(unexpand_~ptr~1#1.base == unexpand_~line~1#1.base && unexpand_~ptr~1#1.offset == unexpand_~line~1#1.offset); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume 101 == __main_#t~mem92#1;havoc __main_#t~mem92#1;assume { :begin_inline_expand } true;expand_#in~file#1.base, expand_#in~file#1.offset, expand_#in~tab_size#1, expand_#in~opt#1 := __main_~file~0#1.base, __main_~file~0#1.offset, __main_~tab_size~0#1, __main_~opt~0#1;havoc expand_#t~ret76#1.base, expand_#t~ret76#1.offset, expand_#t~mem77#1, expand_~bb__isblank~0#1, expand_#t~ret78#1, expand_#t~ret79#1, expand_~len~0#1, expand_~return_value_unicode_strwidth$2~0#1, expand_#t~nondet80#1, expand_~c~0#1, expand_~ptr~0#1.base, expand_~ptr~0#1.offset, expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset, expand_~file#1.base, expand_~file#1.offset, expand_~tab_size#1, expand_~opt#1, expand_~line~0#1.base, expand_~line~0#1.offset, expand_~tmp_statement_expression$1~0#1;expand_~file#1.base, expand_~file#1.offset := expand_#in~file#1.base, expand_#in~file#1.offset;expand_~tab_size#1 := expand_#in~tab_size#1;expand_~opt#1 := expand_#in~opt#1;havoc expand_~line~0#1.base, expand_~line~0#1.offset;havoc expand_~tmp_statement_expression$1~0#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: assume !(101 == __main_#t~mem92#1);havoc __main_#t~mem92#1;assume { :begin_inline_unexpand } true;unexpand_#in~file#1.base, unexpand_#in~file#1.offset, unexpand_#in~tab_size#1, unexpand_#in~opt#1 := __main_~file~0#1.base, __main_~file~0#1.offset, __main_~tab_size~0#1, __main_~opt~0#1;havoc unexpand_#t~ret244#1.base, unexpand_#t~ret244#1.offset, unexpand_#t~mem245#1, unexpand_#t~mem246#1, unexpand_#t~mem247#1, unexpand_#t~nondet248#1, unexpand_#t~ret249#1, unexpand_#t~nondet250#1, unexpand_#t~ret251#1, unexpand_#t~mem252#1, unexpand_#t~ret253#1, unexpand_~c~4#1, unexpand_~return_value_unicode_strwidth$14~0#1, unexpand_~n~1#1, unexpand_~len~1#1, unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, unexpand_~column~0#1, unexpand_~file#1.base, unexpand_~file#1.offset, unexpand_~tab_size#1, unexpand_~opt#1, unexpand_~line~1#1.base, unexpand_~line~1#1.offset, unexpand_~tmp_post$1~1#1, unexpand_~tmp_statement_expression$2~0#1, unexpand_~tmp_if_expr$13~0#1, unexpand_~tmp_if_expr$11~0#1, unexpand_~return_value_strlen$3~0#1, unexpand_~tmp_if_expr$10~1#1, unexpand_~return_value___strcspn_c1$4~0#1, unexpand_~tmp_if_expr$9~1#1, unexpand_~return_value___strcspn_c2$5~0#1, unexpand_~tmp_if_expr$8~1#1, unexpand_~return_value___strcspn_c3$6~0#1, unexpand_~return_value___builtin_strcspn$7~0#1, unexpand_~return_value___builtin_strcspn$12~0#1;unexpand_~file#1.base, unexpand_~file#1.offset := unexpand_#in~file#1.base, unexpand_#in~file#1.offset;unexpand_~tab_size#1 := unexpand_#in~tab_size#1;unexpand_~opt#1 := unexpand_#in~opt#1;havoc unexpand_~line~1#1.base, unexpand_~line~1#1.offset;havoc unexpand_~tmp_post$1~1#1;havoc unexpand_~tmp_statement_expression$2~0#1;havoc unexpand_~tmp_if_expr$13~0#1;havoc unexpand_~tmp_if_expr$11~0#1;havoc unexpand_~return_value_strlen$3~0#1;havoc unexpand_~tmp_if_expr$10~1#1;havoc unexpand_~return_value___strcspn_c1$4~0#1;havoc unexpand_~tmp_if_expr$9~1#1;havoc unexpand_~return_value___strcspn_c2$5~0#1;havoc unexpand_~tmp_if_expr$8~1#1;havoc unexpand_~return_value___strcspn_c3$6~0#1;havoc unexpand_~return_value___builtin_strcspn$7~0#1;havoc unexpand_~return_value___builtin_strcspn$12~0#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3233: assume 0 == unexpand_~tmp_post$1~1#1 % 4294967296; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3233: assume !(0 == unexpand_~tmp_post$1~1#1 % 4294967296);assume -2147483648 <= unexpand_#t~nondet248#1 && unexpand_#t~nondet248#1 <= 2147483647;havoc unexpand_#t~nondet248#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2457: assume true;call expand_#t~mem77#1 := read~int#10(expand_~ptr~0#1.base, expand_~ptr~0#1.offset, 1);expand_~c~0#1 := expand_#t~mem77#1;havoc expand_#t~mem77#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2457: assume !true; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: assume !(0 == unexpand_~n~1#1 % 4294967296);unexpand_~column~0#1 := unexpand_~column~0#1 % 4294967296 % (unexpand_~tab_size#1 % 4294967296);unexpand_~len~1#1 := unexpand_~column~0#1; [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: assume !!(0 == unexpand_~n~1#1 % 4294967296); [2025-02-08 13:25:02,206 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: expand_~return_value_unicode_strwidth$2~0#1 := expand_#t~ret78#1;havoc expand_#t~ret78#1;expand_~len~0#1 := expand_~return_value_unicode_strwidth$2~0#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474-1: SUMMARY for call expand_#t~ret78#1 := unicode_strwidth(expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset); srcloc: null [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: assume 9 == unexpand_#t~mem247#1;havoc unexpand_#t~mem247#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: assume !(9 == unexpand_#t~mem247#1);havoc unexpand_#t~mem247#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: havoc expand_#t~ret76#1.base, expand_#t~ret76#1.offset, expand_#t~mem77#1, expand_~bb__isblank~0#1, expand_#t~ret78#1, expand_#t~ret79#1, expand_~len~0#1, expand_~return_value_unicode_strwidth$2~0#1, expand_#t~nondet80#1, expand_~c~0#1, expand_~ptr~0#1.base, expand_~ptr~0#1.offset, expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset, expand_~file#1.base, expand_~file#1.offset, expand_~tab_size#1, expand_~opt#1, expand_~line~0#1.base, expand_~line~0#1.offset, expand_~tmp_statement_expression$1~0#1;havoc expand_#in~file#1.base, expand_#in~file#1.offset, expand_#in~tab_size#1, expand_#in~opt#1;assume { :end_inline_expand } true; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume 0 == expand_~tmp_statement_expression$1~0#1 % 256; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2466: assume !(0 == expand_~tmp_statement_expression$1~0#1 % 256);havoc expand_~bb__isblank~0#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume true;call unexpand_#t~mem246#1 := read~int#10(unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, 1); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume !true; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450: expand_~line~0#1.base, expand_~line~0#1.offset := expand_#t~ret76#1.base, expand_#t~ret76#1.offset;havoc expand_#t~ret76#1.base, expand_#t~ret76#1.offset; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450-1: SUMMARY for call expand_#t~ret76#1.base, expand_#t~ret76#1.offset := xmalloc_fgets(expand_~file#1.base, expand_~file#1.offset); srcloc: null [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566: havoc fclose_if_not_stdin_#t~bitwise101#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-2: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_#t~bitwise101#1;havoc fclose_if_not_stdin_#t~bitwise101#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-4: havoc fclose_if_not_stdin_#t~bitwise101#1;assume (((((fclose_if_not_stdin_~r~0#1 < 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise101#1 >= fclose_if_not_stdin_~return_value_fclose$1~0#1) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise101#1 >= fclose_if_not_stdin_~r~0#1)) && ((fclose_if_not_stdin_~r~0#1 < 0 || fclose_if_not_stdin_~return_value_fclose$1~0#1 < 0) || fclose_if_not_stdin_#t~bitwise101#1 <= fclose_if_not_stdin_~r~0#1 + fclose_if_not_stdin_~return_value_fclose$1~0#1)) && ((fclose_if_not_stdin_~r~0#1 >= 0 && fclose_if_not_stdin_~return_value_fclose$1~0#1 >= 0) || fclose_if_not_stdin_#t~bitwise101#1 < 0)) && fclose_if_not_stdin_#t~bitwise101#1 <= 2147483647; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-3: [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-6: assume 0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise101#1 := fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-6: assume !(0 == fclose_if_not_stdin_~r~0#1 || fclose_if_not_stdin_~r~0#1 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-5: assume 0 == fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_#t~bitwise101#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-5: assume !(0 == fclose_if_not_stdin_~return_value_fclose$1~0#1); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3260: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2484: expand_~ptr~0#1.base, expand_~ptr~0#1.offset := expand_~ptr~0#1.base, 1 + expand_~ptr~0#1.offset; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: assume expand_~line~0#1.base == 0 && expand_~line~0#1.offset == 0; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: assume !(expand_~line~0#1.base == 0 && expand_~line~0#1.offset == 0);havoc expand_~c~0#1;havoc expand_~ptr~0#1.base, expand_~ptr~0#1.offset;expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset := expand_~line~0#1.base, expand_~line~0#1.offset;expand_~ptr~0#1.base, expand_~ptr~0#1.offset := expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: fopen_or_warn_stdin_#t~ret108#1.base, fopen_or_warn_stdin_#t~ret108#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet105#1.base, fopen_or_warn_#t~nondet105#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;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := fopen_or_warn_stdin_#t~ret108#1.base, fopen_or_warn_stdin_#t~ret108#1.offset; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: assume __main_~file~0#1.base == ~stdin~0.base && __main_~file~0#1.offset == ~stdin~0.offset; [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: assume !(__main_~file~0#1.base == ~stdin~0.base && __main_~file~0#1.offset == ~stdin~0.offset); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !(0 == expand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: assume !!(0 == expand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: assume !(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: assume !!(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,207 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2534: havoc unexpand_#t~ret244#1.base, unexpand_#t~ret244#1.offset, unexpand_#t~mem245#1, unexpand_#t~mem246#1, unexpand_#t~mem247#1, unexpand_#t~nondet248#1, unexpand_#t~ret249#1, unexpand_#t~nondet250#1, unexpand_#t~ret251#1, unexpand_#t~mem252#1, unexpand_#t~ret253#1, unexpand_~c~4#1, unexpand_~return_value_unicode_strwidth$14~0#1, unexpand_~n~1#1, unexpand_~len~1#1, unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, unexpand_~column~0#1, unexpand_~file#1.base, unexpand_~file#1.offset, unexpand_~tab_size#1, unexpand_~opt#1, unexpand_~line~1#1.base, unexpand_~line~1#1.offset, unexpand_~tmp_post$1~1#1, unexpand_~tmp_statement_expression$2~0#1, unexpand_~tmp_if_expr$13~0#1, unexpand_~tmp_if_expr$11~0#1, unexpand_~return_value_strlen$3~0#1, unexpand_~tmp_if_expr$10~1#1, unexpand_~return_value___strcspn_c1$4~0#1, unexpand_~tmp_if_expr$9~1#1, unexpand_~return_value___strcspn_c2$5~0#1, unexpand_~tmp_if_expr$8~1#1, unexpand_~return_value___strcspn_c3$6~0#1, unexpand_~return_value___builtin_strcspn$7~0#1, unexpand_~return_value___builtin_strcspn$12~0#1;havoc unexpand_#in~file#1.base, unexpand_#in~file#1.offset, unexpand_#in~tab_size#1, unexpand_#in~opt#1;assume { :end_inline_unexpand } true; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: assume !(32 == unexpand_#t~mem246#1);havoc unexpand_#t~mem246#1; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: assume !!(32 == unexpand_#t~mem246#1);havoc unexpand_#t~mem246#1;unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset := unexpand_~ptr~1#1.base, 1 + unexpand_~ptr~1#1.offset;unexpand_~len~1#1 := 1 + unexpand_~len~1#1; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2526: __main_#t~ret91#1.base, __main_#t~ret91#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem106#1, fopen_or_warn_stdin_#t~mem107#1, fopen_or_warn_stdin_#t~ret108#1.base, fopen_or_warn_stdin_#t~ret108#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~file~0#1.base, __main_~file~0#1.offset := __main_#t~ret91#1.base, __main_#t~ret91#1.offset;havoc __main_#t~mem90#1.base, __main_#t~mem90#1.offset;havoc __main_#t~ret91#1.base, __main_#t~ret91#1.offset; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume 0 == (if expand_~c~0#1 % 256 % 4294967296 <= 2147483647 then expand_~c~0#1 % 256 % 4294967296 else expand_~c~0#1 % 256 % 4294967296 - 4294967296); [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: assume !(0 == (if expand_~c~0#1 % 256 % 4294967296 <= 2147483647 then expand_~c~0#1 % 256 % 4294967296 else expand_~c~0#1 % 256 % 4294967296 - 4294967296)); [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3261: unexpand_~column~0#1 := (unexpand_~column~0#1 + unexpand_~len~1#1) % 4294967296 % (unexpand_~tab_size#1 % 4294967296);havoc unexpand_~c~4#1, unexpand_~return_value_unicode_strwidth$14~0#1; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume true;call unexpand_#t~mem245#1 := read~int#10(unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset, 1); [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !true; [2025-02-08 13:25:02,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3253-1: SUMMARY for call unexpand_#t~ret253#1 := unicode_strwidth(unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset); srcloc: null [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !!(0 == unexpand_~tab_size#1 % 4294967296); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3253: unexpand_~return_value_unicode_strwidth$14~0#1 := unexpand_#t~ret253#1;havoc unexpand_#t~ret253#1;unexpand_~len~1#1 := unexpand_~return_value_unicode_strwidth$14~0#1;call write~int#10(unexpand_~c~4#1, unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset + (if unexpand_~n~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then unexpand_~n~1#1 % 4294967296 % 18446744073709551616 else unexpand_~n~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset := unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset + (if unexpand_~n~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then unexpand_~n~1#1 % 4294967296 % 18446744073709551616 else unexpand_~n~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: fclose_if_not_stdin_#res#1 := fclose_if_not_stdin_~r~0#1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc __main_~return_value_fclose_if_not_stdin$1~0#1;assume { :begin_inline_fclose_if_not_stdin } true;fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset := __main_~file~0#1.base, __main_~file~0#1.offset;havoc fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet99#1, fclose_if_not_stdin_#t~nondet100#1, fclose_if_not_stdin_#t~bitwise101#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset := fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;havoc fclose_if_not_stdin_~r~0#1;assume -2147483648 <= fclose_if_not_stdin_#t~nondet99#1 && fclose_if_not_stdin_#t~nondet99#1 <= 2147483647;fclose_if_not_stdin_~r~0#1 := fclose_if_not_stdin_#t~nondet99#1;havoc fclose_if_not_stdin_#t~nondet99#1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469: assume 9 == (if expand_~c~0#1 % 256 % 4294967296 <= 2147483647 then expand_~c~0#1 % 256 % 4294967296 else expand_~c~0#1 % 256 % 4294967296 - 4294967296);havoc expand_~len~0#1;call write~int#10(0, expand_~ptr~0#1.base, expand_~ptr~0#1.offset, 1);havoc expand_~return_value_unicode_strwidth$2~0#1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2469: assume !(9 == (if expand_~c~0#1 % 256 % 4294967296 <= 2147483647 then expand_~c~0#1 % 256 % 4294967296 else expand_~c~0#1 % 256 % 4294967296 - 4294967296)); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560: assume !(0 == fclose_if_not_stdin_~r~0#1);call write~int#18(5, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560: assume !!(0 == fclose_if_not_stdin_~r~0#1); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume __main_~file~0#1.base == 0 && __main_~file~0#1.offset == 0;__main_~exit_status~0#1 := 1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2527: assume !(__main_~file~0#1.base == 0 && __main_~file~0#1.offset == 0);call __main_#t~mem92#1 := read~int#25(~applet_name~0.base, ~applet_name~0.offset, 1); [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3196: havoc unexpand_~n~1#1, unexpand_~len~1#1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229-1: assume true; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229-1: assume !true; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: assume true;unexpand_~tmp_post$1~1#1 := unexpand_~n~1#1;unexpand_~n~1#1 := unexpand_~n~1#1 - 1; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3229: assume !true; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume true; [2025-02-08 13:25:02,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486: assume !true;havoc expand_#t~nondet80#1;call ULTIMATE.dealloc(expand_~line~0#1.base, expand_~line~0#1.offset);havoc expand_~c~0#1, expand_~ptr~0#1.base, expand_~ptr~0#1.offset, expand_~ptr_strbeg~0#1.base, expand_~ptr_strbeg~0#1.offset; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: assume true; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: assume !true; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486-1: assume false; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2486-1: assume !false; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188-1: assume true; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188-1: assume !true; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: __main_#t~ret93#1 := fclose_if_not_stdin_#res#1;havoc fclose_if_not_stdin_#t~nondet99#1, fclose_if_not_stdin_#t~nondet100#1, fclose_if_not_stdin_#t~bitwise101#1, fclose_if_not_stdin_~f#1.base, fclose_if_not_stdin_~f#1.offset, fclose_if_not_stdin_~r~0#1, fclose_if_not_stdin_~return_value_fclose$1~0#1;havoc fclose_if_not_stdin_#in~f#1.base, fclose_if_not_stdin_#in~f#1.offset;assume { :end_inline_fclose_if_not_stdin } true;assume -2147483648 <= __main_#t~ret93#1 && __main_#t~ret93#1 <= 2147483647;__main_~return_value_fclose_if_not_stdin$1~0#1 := __main_#t~ret93#1;havoc __main_#t~ret93#1; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !(0 == expand_~opt#1 % 2 % 4294967296);expand_~bb__isblank~0#1 := expand_~c~0#1;expand_~tmp_statement_expression$1~0#1 := (if 0 == (if 32 == (if expand_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then expand_~bb__isblank~0#1 % 256 % 4294967296 else expand_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) || 9 == (if expand_~bb__isblank~0#1 % 256 % 4294967296 <= 2147483647 then expand_~bb__isblank~0#1 % 256 % 4294967296 else expand_~bb__isblank~0#1 % 256 % 4294967296 - 4294967296) then 1 else 0) then 0 else 1); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2462: assume !!(0 == expand_~opt#1 % 2 % 4294967296); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: assume 0 == unexpand_#t~mem245#1;havoc unexpand_#t~mem245#1; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: assume !(0 == unexpand_#t~mem245#1);havoc unexpand_#t~mem245#1;havoc unexpand_~n~1#1;unexpand_~len~1#1 := 0; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;call __main_#t~mem95#1.base, __main_#t~mem95#1.offset := read~$Pointer$#12(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2479: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247: unexpand_~n~1#1 := unexpand_#t~nondet250#1;havoc unexpand_#t~nondet250#1;havoc unexpand_#t~ret251#1;havoc unexpand_#t~ret251#1;havoc unexpand_~c~4#1;call unexpand_#t~mem252#1 := read~int#10(unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset + (if unexpand_~n~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then unexpand_~n~1#1 % 4294967296 % 18446744073709551616 else unexpand_~n~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);unexpand_~c~4#1 := unexpand_#t~mem252#1;havoc unexpand_#t~mem252#1;call write~int#10(0, unexpand_~ptr~1#1.base, unexpand_~ptr~1#1.offset + (if unexpand_~n~1#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then unexpand_~n~1#1 % 4294967296 % 18446744073709551616 else unexpand_~n~1#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);havoc unexpand_~return_value_unicode_strwidth$14~0#1; [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: assume !(0 == __main_~return_value_fclose_if_not_stdin$1~0#1);call __main_#t~mem94#1.base, __main_#t~mem94#1.offset := read~$Pointer$#12(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: assume !!(0 == __main_~return_value_fclose_if_not_stdin$1~0#1); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3239: assume !(0 == unexpand_~opt#1 % 2 % 4294967296); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3239: assume !!(0 == unexpand_~opt#1 % 2 % 4294967296); [2025-02-08 13:25:02,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2562: havoc fclose_if_not_stdin_~return_value_fclose$1~0#1; [2025-02-08 13:25:02,365 INFO L? ?]: Removed 949 outVars from TransFormulas that were not future-live. [2025-02-08 13:25:02,365 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:25:02,391 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:25:02,391 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:25:02,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:25:02 BoogieIcfgContainer [2025-02-08 13:25:02,395 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:25:02,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:25:02,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:25:02,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:25:02,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:24:53" (1/3) ... [2025-02-08 13:25:02,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337fd0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:25:02, skipping insertion in model container [2025-02-08 13:25:02,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:24:54" (2/3) ... [2025-02-08 13:25:02,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@337fd0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:25:02, skipping insertion in model container [2025-02-08 13:25:02,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:25:02" (3/3) ... [2025-02-08 13:25:02,401 INFO L128 eAbstractionObserver]: Analyzing ICFG expand-1.i [2025-02-08 13:25:02,410 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:25:02,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG expand-1.i that has 94 procedures, 884 locations, 1 initial locations, 104 loop locations, and 86 error locations. [2025-02-08 13:25:02,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:25:02,467 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;@65726750, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:25:02,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2025-02-08 13:25:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 503 states, 378 states have (on average 1.6613756613756614) internal successors, (628), 466 states have internal predecessors, (628), 21 states have call successors, (21), 13 states have call predecessors, (21), 13 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-08 13:25:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:25:02,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:02,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:25:02,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:02,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1738711, now seen corresponding path program 1 times [2025-02-08 13:25:02,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:02,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721579808] [2025-02-08 13:25:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:03,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:25:03,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:25:03,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:03,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:04,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721579808] [2025-02-08 13:25:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721579808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:04,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:04,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:25:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132516917] [2025-02-08 13:25:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:04,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:04,203 INFO L87 Difference]: Start difference. First operand has 503 states, 378 states have (on average 1.6613756613756614) internal successors, (628), 466 states have internal predecessors, (628), 21 states have call successors, (21), 13 states have call predecessors, (21), 13 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:04,380 INFO L93 Difference]: Finished difference Result 710 states and 963 transitions. [2025-02-08 13:25:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:25:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:04,386 INFO L225 Difference]: With dead ends: 710 [2025-02-08 13:25:04,386 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 13:25:04,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:04,392 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 588 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:25:04,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 588 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:25:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 13:25:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-02-08 13:25:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 173 states have (on average 1.5260115606936415) internal successors, (264), 207 states have internal predecessors, (264), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2025-02-08 13:25:04,425 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 3 [2025-02-08 13:25:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:04,425 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2025-02-08 13:25:04,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2025-02-08 13:25:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:25:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:04,425 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:25:04,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:25:04,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 260006173, now seen corresponding path program 1 times [2025-02-08 13:25:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909835940] [2025-02-08 13:25:04,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:05,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:25:05,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:25:05,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:05,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909835940] [2025-02-08 13:25:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909835940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544751140] [2025-02-08 13:25:05,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:05,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:05,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:05,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:05,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:25:06,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:25:07,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:25:07,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:07,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:07,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:07,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:07,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544751140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:07,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:25:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244847072] [2025-02-08 13:25:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:07,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:25:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:07,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:25:07,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:07,233 INFO L87 Difference]: Start difference. First operand 222 states and 281 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:11,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:11,478 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2025-02-08 13:25:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:25:11,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:25:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:11,480 INFO L225 Difference]: With dead ends: 222 [2025-02-08 13:25:11,480 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 13:25:11,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:11,480 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:11,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 535 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:25:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 13:25:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-02-08 13:25:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 206 states have internal predecessors, (263), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2025-02-08 13:25:11,491 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 6 [2025-02-08 13:25:11,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:11,491 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2025-02-08 13:25:11,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2025-02-08 13:25:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:25:11,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:11,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:25:11,501 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:25:11,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:11,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:11,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash -529741543, now seen corresponding path program 1 times [2025-02-08 13:25:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:11,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561053706] [2025-02-08 13:25:11,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:25:12,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:25:12,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:12,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:25:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561053706] [2025-02-08 13:25:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561053706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:12,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:12,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38050030] [2025-02-08 13:25:12,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:12,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:12,654 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:12,771 INFO L93 Difference]: Finished difference Result 221 states and 280 transitions. [2025-02-08 13:25:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:25:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:12,773 INFO L225 Difference]: With dead ends: 221 [2025-02-08 13:25:12,773 INFO L226 Difference]: Without dead ends: 220 [2025-02-08 13:25:12,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:12,774 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:12,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:25:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-08 13:25:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-02-08 13:25:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 171 states have (on average 1.5204678362573099) internal successors, (260), 203 states have internal predecessors, (260), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 277 transitions. [2025-02-08 13:25:12,781 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 277 transitions. Word has length 7 [2025-02-08 13:25:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:12,781 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 277 transitions. [2025-02-08 13:25:12,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:25:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 277 transitions. [2025-02-08 13:25:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:25:12,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:12,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:12,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:25:12,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -185558496, now seen corresponding path program 1 times [2025-02-08 13:25:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464315999] [2025-02-08 13:25:12,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:13,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:13,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464315999] [2025-02-08 13:25:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464315999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285814656] [2025-02-08 13:25:13,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:13,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:13,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:13,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:25:15,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:25:15,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:25:15,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:15,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:15,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 2010 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:25:15,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:25:15,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285814656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:15,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:25:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214206648] [2025-02-08 13:25:15,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:15,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:15,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:15,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:15,371 INFO L87 Difference]: Start difference. First operand 218 states and 277 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:19,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:19,570 INFO L93 Difference]: Finished difference Result 218 states and 277 transitions. [2025-02-08 13:25:19,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:19,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:25:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:19,572 INFO L225 Difference]: With dead ends: 218 [2025-02-08 13:25:19,572 INFO L226 Difference]: Without dead ends: 216 [2025-02-08 13:25:19,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:19,573 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 47 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:19,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 480 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:25:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-08 13:25:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-08 13:25:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 171 states have (on average 1.5087719298245614) internal successors, (258), 201 states have internal predecessors, (258), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 275 transitions. [2025-02-08 13:25:19,582 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 275 transitions. Word has length 11 [2025-02-08 13:25:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:19,583 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 275 transitions. [2025-02-08 13:25:19,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 275 transitions. [2025-02-08 13:25:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:25:19,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:19,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:19,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:25:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:19,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1457344400, now seen corresponding path program 1 times [2025-02-08 13:25:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113466819] [2025-02-08 13:25:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:20,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:20,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:20,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:20,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:20,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:20,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113466819] [2025-02-08 13:25:20,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113466819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:20,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416923407] [2025-02-08 13:25:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:20,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:20,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:20,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:20,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:25:22,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:25:22,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:25:22,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:22,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:22,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:25:22,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:22,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:25:22,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416923407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:22,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:25:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397156992] [2025-02-08 13:25:22,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:25:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:22,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:25:22,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:22,679 INFO L87 Difference]: Start difference. First operand 216 states and 275 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:22,958 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2025-02-08 13:25:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:25:22,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:25:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:22,959 INFO L225 Difference]: With dead ends: 436 [2025-02-08 13:25:22,959 INFO L226 Difference]: Without dead ends: 225 [2025-02-08 13:25:22,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:25:22,960 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 4 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:22,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1062 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:25:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-08 13:25:22,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-08 13:25:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 210 states have internal predecessors, (267), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 284 transitions. [2025-02-08 13:25:22,975 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 284 transitions. Word has length 12 [2025-02-08 13:25:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:22,976 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 284 transitions. [2025-02-08 13:25:22,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:25:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2025-02-08 13:25:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:25:22,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:22,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:22,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:25:23,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:23,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:23,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 671266858, now seen corresponding path program 2 times [2025-02-08 13:25:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406912697] [2025-02-08 13:25:23,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:25:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:24,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:25:24,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:25:24,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:25:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406912697] [2025-02-08 13:25:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406912697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:24,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:25:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242675192] [2025-02-08 13:25:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:25:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:24,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:25:24,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:24,523 INFO L87 Difference]: Start difference. First operand 225 states and 284 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:28,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:28,965 INFO L93 Difference]: Finished difference Result 225 states and 284 transitions. [2025-02-08 13:25:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:25:28,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:25:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:28,966 INFO L225 Difference]: With dead ends: 225 [2025-02-08 13:25:28,966 INFO L226 Difference]: Without dead ends: 223 [2025-02-08 13:25:28,966 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:25:28,967 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 46 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:28,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 986 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 13:25:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-08 13:25:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-08 13:25:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 180 states have (on average 1.4722222222222223) internal successors, (265), 208 states have internal predecessors, (265), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2025-02-08 13:25:28,972 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 21 [2025-02-08 13:25:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:28,973 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 282 transitions. [2025-02-08 13:25:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 282 transitions. [2025-02-08 13:25:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:25:28,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:28,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:25:28,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:28,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash 739057665, now seen corresponding path program 1 times [2025-02-08 13:25:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990549413] [2025-02-08 13:25:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:29,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:25:29,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:25:29,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:29,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:29,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:29,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990549413] [2025-02-08 13:25:29,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990549413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:25:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678994466] [2025-02-08 13:25:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:29,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:29,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:29,989 INFO L87 Difference]: Start difference. First operand 223 states and 282 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:34,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:34,233 INFO L93 Difference]: Finished difference Result 430 states and 549 transitions. [2025-02-08 13:25:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:25:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:34,235 INFO L225 Difference]: With dead ends: 430 [2025-02-08 13:25:34,235 INFO L226 Difference]: Without dead ends: 226 [2025-02-08 13:25:34,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:34,236 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 2 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:34,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 525 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:25:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-02-08 13:25:34,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-02-08 13:25:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 183 states have (on average 1.46448087431694) internal successors, (268), 211 states have internal predecessors, (268), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2025-02-08 13:25:34,242 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 26 [2025-02-08 13:25:34,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:34,244 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2025-02-08 13:25:34,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2025-02-08 13:25:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:25:34,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:34,245 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:34,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:25:34,245 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1270963555, now seen corresponding path program 1 times [2025-02-08 13:25:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577332189] [2025-02-08 13:25:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:34,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:35,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:35,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:35,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:35,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577332189] [2025-02-08 13:25:35,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577332189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:35,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122296303] [2025-02-08 13:25:35,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:35,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:35,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:35,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:35,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:25:36,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:36,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:36,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:25:36,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:25:36,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:25:36,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122296303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:36,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:25:36,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:25:36,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367271868] [2025-02-08 13:25:36,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:36,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:36,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:36,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:36,845 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:40,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:41,117 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2025-02-08 13:25:41,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:25:41,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:41,119 INFO L225 Difference]: With dead ends: 226 [2025-02-08 13:25:41,119 INFO L226 Difference]: Without dead ends: 225 [2025-02-08 13:25:41,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:25:41,120 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 3 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:41,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 515 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:25:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-08 13:25:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2025-02-08 13:25:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 183 states have (on average 1.459016393442623) internal successors, (267), 210 states have internal predecessors, (267), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 284 transitions. [2025-02-08 13:25:41,128 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 284 transitions. Word has length 29 [2025-02-08 13:25:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:41,128 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 284 transitions. [2025-02-08 13:25:41,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 284 transitions. [2025-02-08 13:25:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:25:41,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:41,129 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:41,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:25:41,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:25:41,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1270963715, now seen corresponding path program 1 times [2025-02-08 13:25:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:41,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233799173] [2025-02-08 13:25:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:42,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:42,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:25:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233799173] [2025-02-08 13:25:42,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233799173] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:25:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912011066] [2025-02-08 13:25:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:25:42,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:25:42,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:25:43,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:25:43,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:25:43,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:43,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:25:43,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:25:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:25:44,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:25:45,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:25:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912011066] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:25:45,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:25:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:25:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957993181] [2025-02-08 13:25:45,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:25:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:25:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:45,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:25:45,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:45,352 INFO L87 Difference]: Start difference. First operand 225 states and 284 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:49,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:53,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:54,320 INFO L93 Difference]: Finished difference Result 453 states and 577 transitions. [2025-02-08 13:25:54,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:25:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:25:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:54,321 INFO L225 Difference]: With dead ends: 453 [2025-02-08 13:25:54,321 INFO L226 Difference]: Without dead ends: 242 [2025-02-08 13:25:54,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:25:54,322 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:54,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1538 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2025-02-08 13:25:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-02-08 13:25:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2025-02-08 13:25:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 201 states have (on average 1.4129353233830846) internal successors, (284), 227 states have internal predecessors, (284), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:54,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 301 transitions. [2025-02-08 13:25:54,327 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 301 transitions. Word has length 29 [2025-02-08 13:25:54,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:54,328 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 301 transitions. [2025-02-08 13:25:54,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:25:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 301 transitions. [2025-02-08 13:25:54,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:25:54,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:54,328 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:54,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:25:54,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:25:54,530 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:54,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1376479554, now seen corresponding path program 1 times [2025-02-08 13:25:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:54,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989407606] [2025-02-08 13:25:54,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:54,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:25:55,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:25:55,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:25:55,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:25:55,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:25:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:25:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:25:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989407606] [2025-02-08 13:25:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989407606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:25:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:25:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:25:55,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178385728] [2025-02-08 13:25:55,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:25:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:25:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:25:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:25:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:55,486 INFO L87 Difference]: Start difference. First operand 242 states and 301 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:59,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:25:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:25:59,757 INFO L93 Difference]: Finished difference Result 253 states and 314 transitions. [2025-02-08 13:25:59,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:25:59,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:25:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:25:59,761 INFO L225 Difference]: With dead ends: 253 [2025-02-08 13:25:59,761 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 13:25:59,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:25:59,762 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:25:59,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 519 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-08 13:25:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 13:25:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2025-02-08 13:25:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 210 states have (on average 1.4095238095238096) internal successors, (296), 236 states have internal predecessors, (296), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:25:59,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 313 transitions. [2025-02-08 13:25:59,777 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 313 transitions. Word has length 48 [2025-02-08 13:25:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:25:59,777 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 313 transitions. [2025-02-08 13:25:59,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:25:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 313 transitions. [2025-02-08 13:25:59,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:25:59,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:25:59,781 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:25:59,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:25:59,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:25:59,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:25:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1376474589, now seen corresponding path program 1 times [2025-02-08 13:25:59,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:25:59,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550558122] [2025-02-08 13:25:59,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:25:59,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:00,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:26:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:26:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:26:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:00,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550558122] [2025-02-08 13:26:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550558122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840002569] [2025-02-08 13:26:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:00,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:00,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:00,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:00,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:00,795 INFO L87 Difference]: Start difference. First operand 251 states and 313 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:04,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:04,975 INFO L93 Difference]: Finished difference Result 251 states and 313 transitions. [2025-02-08 13:26:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:26:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:04,977 INFO L225 Difference]: With dead ends: 251 [2025-02-08 13:26:04,977 INFO L226 Difference]: Without dead ends: 250 [2025-02-08 13:26:04,977 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:26:04,977 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:04,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:26:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-08 13:26:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 246. [2025-02-08 13:26:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 206 states have (on average 1.4077669902912622) internal successors, (290), 231 states have internal predecessors, (290), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 307 transitions. [2025-02-08 13:26:04,983 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 307 transitions. Word has length 48 [2025-02-08 13:26:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 307 transitions. [2025-02-08 13:26:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 307 transitions. [2025-02-08 13:26:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:26:04,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:04,984 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:26:04,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting getopt32Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:26:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1600981422, now seen corresponding path program 1 times [2025-02-08 13:26:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330386477] [2025-02-08 13:26:04,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:04,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:05,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:26:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:26:05,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:05,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330386477] [2025-02-08 13:26:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330386477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:06,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742724816] [2025-02-08 13:26:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:06,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:06,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:06,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:06,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:06,132 INFO L87 Difference]: Start difference. First operand 246 states and 307 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:06,292 INFO L93 Difference]: Finished difference Result 363 states and 462 transitions. [2025-02-08 13:26:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-08 13:26:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:06,294 INFO L225 Difference]: With dead ends: 363 [2025-02-08 13:26:06,294 INFO L226 Difference]: Without dead ends: 361 [2025-02-08 13:26:06,295 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:26:06,295 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 140 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:06,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 519 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-08 13:26:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 250. [2025-02-08 13:26:06,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 210 states have (on average 1.4047619047619047) internal successors, (295), 235 states have internal predecessors, (295), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 312 transitions. [2025-02-08 13:26:06,305 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 312 transitions. Word has length 50 [2025-02-08 13:26:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:06,305 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 312 transitions. [2025-02-08 13:26:06,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 312 transitions. [2025-02-08 13:26:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:26:06,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:06,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:26:06,308 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting getopt32Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:26:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1781528178, now seen corresponding path program 1 times [2025-02-08 13:26:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744731183] [2025-02-08 13:26:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:07,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:26:07,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:26:07,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:07,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744731183] [2025-02-08 13:26:07,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744731183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:07,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350896990] [2025-02-08 13:26:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:07,364 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:26:08,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:26:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:26:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:09,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:09,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 2433 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:09,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:09,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:09,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350896990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:09,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:09,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:26:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949908245] [2025-02-08 13:26:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:09,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:09,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:09,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:09,237 INFO L87 Difference]: Start difference. First operand 250 states and 312 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:09,504 INFO L93 Difference]: Finished difference Result 361 states and 460 transitions. [2025-02-08 13:26:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:26:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:09,506 INFO L225 Difference]: With dead ends: 361 [2025-02-08 13:26:09,506 INFO L226 Difference]: Without dead ends: 360 [2025-02-08 13:26:09,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:09,506 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 279 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:09,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 663 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:26:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-08 13:26:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 249. [2025-02-08 13:26:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 210 states have (on average 1.4) internal successors, (294), 234 states have internal predecessors, (294), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 311 transitions. [2025-02-08 13:26:09,513 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 311 transitions. Word has length 54 [2025-02-08 13:26:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:09,513 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 311 transitions. [2025-02-08 13:26:09,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 311 transitions. [2025-02-08 13:26:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:26:09,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:09,514 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:09,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:26:09,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:26:09,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting getopt32Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:26:09,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -607200863, now seen corresponding path program 1 times [2025-02-08 13:26:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:09,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718215367] [2025-02-08 13:26:09,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:10,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:10,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:10,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:10,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:10,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718215367] [2025-02-08 13:26:10,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718215367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:10,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435311259] [2025-02-08 13:26:10,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:10,744 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:10,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:26:12,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:12,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:12,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:12,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:12,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 2434 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:12,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:12,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:26:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435311259] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:12,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:12,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:26:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850215392] [2025-02-08 13:26:12,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:12,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:12,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:12,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:12,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:12,936 INFO L87 Difference]: Start difference. First operand 249 states and 311 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:13,532 INFO L93 Difference]: Finished difference Result 706 states and 921 transitions. [2025-02-08 13:26:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:26:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:13,536 INFO L225 Difference]: With dead ends: 706 [2025-02-08 13:26:13,536 INFO L226 Difference]: Without dead ends: 705 [2025-02-08 13:26:13,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:13,538 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 732 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:13,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1394 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:26:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-02-08 13:26:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 261. [2025-02-08 13:26:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 222 states have (on average 1.3918918918918919) internal successors, (309), 246 states have internal predecessors, (309), 11 states have call successors, (11), 8 states have call predecessors, (11), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:26:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 326 transitions. [2025-02-08 13:26:13,550 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 326 transitions. Word has length 55 [2025-02-08 13:26:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:13,550 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 326 transitions. [2025-02-08 13:26:13,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 326 transitions. [2025-02-08 13:26:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:26:13,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:13,551 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:13,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:13,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:13,756 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [getopt32Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, getopt32Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 83 more)] === [2025-02-08 13:26:13,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 654711144, now seen corresponding path program 1 times [2025-02-08 13:26:13,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:13,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484659386] [2025-02-08 13:26:13,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:14,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484659386] [2025-02-08 13:26:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484659386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620671746] [2025-02-08 13:26:14,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:14,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:26:14,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:26:16,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:16,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:16,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:16,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:16,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 2374 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:16,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:16,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:26:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620671746] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:17,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:26:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917322667] [2025-02-08 13:26:17,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:17,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:17,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:17,013 INFO L87 Difference]: Start difference. First operand 261 states and 326 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:26:21,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:26:25,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []