./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uniq-2.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/uniq-2.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 7199c457ec02eb80a800c3d45e6c59baf3403d683de615d2599dc8d811fbf1b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:29:48,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:29:48,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:29:48,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:29:48,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:29:48,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:29:48,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:29:48,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:29:48,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:29:48,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:29:48,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:29:48,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:29:48,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:29:48,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:29:48,763 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:29:48,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:29:48,764 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:29:48,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:48,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:29:48,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:29:48,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:29:48,766 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 -> 7199c457ec02eb80a800c3d45e6c59baf3403d683de615d2599dc8d811fbf1b6 [2025-02-08 13:29:48,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:29:48,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:29:48,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:29:48,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:29:48,995 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:29:49,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uniq-2.i [2025-02-08 13:29:50,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c135f39ae/49c6f318677f4e4a9a8b03aad8eb67de/FLAG04fe3c13d [2025-02-08 13:29:50,600 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:29:50,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uniq-2.i [2025-02-08 13:29:50,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c135f39ae/49c6f318677f4e4a9a8b03aad8eb67de/FLAG04fe3c13d [2025-02-08 13:29:50,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c135f39ae/49c6f318677f4e4a9a8b03aad8eb67de [2025-02-08 13:29:50,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:50,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:50,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:50,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:50,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:50,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:50" (1/1) ... [2025-02-08 13:29:50,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3097829d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:50, skipping insertion in model container [2025-02-08 13:29:50,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:50" (1/1) ... [2025-02-08 13:29:50,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:51,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:51,534 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:51,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:51,751 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:51,756 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:51,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51 WrapperNode [2025-02-08 13:29:51,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:51,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:51,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:51,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:51,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,835 INFO L138 Inliner]: procedures = 600, calls = 768, calls flagged for inlining = 31, calls inlined = 30, statements flattened = 2119 [2025-02-08 13:29:51,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:51,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:51,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:51,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:51,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,946 INFO L175 MemorySlicer]: Split 633 memory accesses to 21 slices as follows [2, 6, 17, 3, 7, 44, 11, 29, 6, 13, 17, 17, 3, 355, 3, 15, 30, 33, 3, 17, 2]. 56 percent of accesses are in the largest equivalence class. The 368 initializations are split as follows [2, 0, 1, 3, 0, 0, 0, 0, 0, 1, 0, 4, 0, 355, 0, 0, 2, 0, 0, 0, 0]. The 108 writes are split as follows [0, 3, 15, 0, 7, 12, 4, 0, 2, 6, 17, 4, 0, 0, 0, 1, 20, 13, 0, 3, 1]. [2025-02-08 13:29:51,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:51,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:52,105 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:52,105 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:52,105 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:52,106 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (1/1) ... [2025-02-08 13:29:52,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:52,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:52,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 13:29:52,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 13:29:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure xopen [2025-02-08 13:29:52,163 INFO L138 BoogieDeclarations]: Found implementation of procedure xopen [2025-02-08 13:29:52,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:52,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:52,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:52,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:29:52,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:29:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:52,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:52,167 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:52,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:29:52,169 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:29:52,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:52,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:29:52,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:29:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:29:52,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:29:52,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:52,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:52,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:29:52,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:52,175 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:52,179 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:29:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:29:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:29:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:29:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:29:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:29:52,186 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:29:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:52,189 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:29:52,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:29:52,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:29:52,685 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:52,687 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:53,174 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: 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~ret190#1, safe_write_#t~mem191#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~1#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~1#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: safe_write_#t~ret190#1 := write_#res#1;havoc write_#t~nondet301#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~3#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~ret190#1 && safe_write_#t~ret190#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret190#1;havoc safe_write_#t~ret190#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem191#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem191#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: full_write_#t~ret76#1 := safe_write_#res#1;havoc safe_write_#t~ret190#1, safe_write_#t~mem191#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~1#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~ret76#1 && full_write_#t~ret76#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret76#1;havoc full_write_#t~ret76#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: assume full_write_~cc~0#1 < 0; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: #t~ret65#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet73#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret65#1 && #t~ret65#1 <= 2147483647;havoc #t~ret65#1;call #t~mem66#1.base, #t~mem66#1.offset := read~$Pointer$#15(~#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~mem66#1.base, #t~mem66#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret76#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2534: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2534: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: #t~ret67#1 := full_write_#res#1;havoc full_write_#t~ret76#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~ret67#1 && #t~ret67#1 <= 9223372036854775807;havoc #t~mem66#1.base, #t~mem66#1.offset;havoc #t~ret67#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3352: write_#res#1 := write_~ret~3#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3352-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~3#1 || (write_~ret~3#1 >= 0 && write_~ret~3#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: 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~nondet301#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~3#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~nondet301#1;assume -9223372036854775808 <= write_#t~nondet301#1 && write_#t~nondet301#1 <= 9223372036854775807;write_~ret~3#1 := write_#t~nondet301#1;havoc write_#t~nondet301#1; [2025-02-08 13:29:53,175 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume !true; [2025-02-08 13:29:53,176 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int#9(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: xatoi_positive_#t~ret224#1 := xatou_range_#res#1;havoc xatou_range_#t~ret225#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret224#1;havoc xatoi_positive_#t~ret224#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-1: [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877: assume 0 != getopt32_#t~bitwise157#1 % 4294967296;havoc getopt32_#t~mem156#1;havoc getopt32_#t~bitwise157#1; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877: assume !(0 != getopt32_#t~bitwise157#1 % 4294967296);havoc getopt32_#t~mem156#1;havoc getopt32_#t~bitwise157#1;call getopt32_#t~mem158#1 := read~int#5(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem159#1 := read~int#5(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume getopt32_#t~mem156#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_#t~mem156#1; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume !(getopt32_#t~mem156#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-2: havoc getopt32_#t~bitwise157#1;assume getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_#t~mem156#1 % 4294967296 && getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-5: call getopt32_#t~mem156#1 := read~int#5(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-4: assume 0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise157#1 := 0; [2025-02-08 13:29:58,255 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-4: assume !(0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: assume __main_~old_line~0#1.base == 0 && __main_~old_line~0#1.offset == 0;__main_~tmp_if_expr$5~0#1 := 1; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: assume !(__main_~old_line~0#1.base == 0 && __main_~old_line~0#1.offset == 0);call __main_#t~mem217#1 := read~int#17(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset, 4);__main_~return_value_strncmp$4~0#1 := __main_#t~nondet218#1;havoc __main_#t~mem217#1;havoc __main_#t~nondet218#1;__main_~tmp_if_expr$5~0#1 := (if 0 == (if 0 != (if 0 != __main_~return_value_strncmp$4~0#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977-1: skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset := skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3242: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3242: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-1: [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879: getopt32_~trigger~0#1 := getopt32_#t~bitwise160#1;havoc getopt32_#t~mem158#1;havoc getopt32_#t~mem159#1;havoc getopt32_#t~bitwise160#1;call getopt32_#t~mem161#1 := read~int#5(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-3: assume getopt32_#t~mem158#1 % 4294967296 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_#t~mem158#1; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-3: assume !(getopt32_#t~mem158#1 % 4294967296 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-2: havoc getopt32_#t~bitwise160#1;assume getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem158#1 % 4294967296 && getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem159#1 % 4294967296; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-4: assume 0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := 0; [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-4: assume !(0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:29:58,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem246#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem246#1;havoc xstrtou_range_sfx_#t~mem246#1;call write~int#9(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet43#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet43#1;havoc bb_strtoui_#t~nondet43#1; [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume true;call llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset := read~$Pointer$#17(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume !true; [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-2: assume !!(llist_add_to_end_#t~mem186#1.base == 0 && llist_add_to_end_#t~mem186#1.offset == 0);havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset; [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-2: assume !(llist_add_to_end_#t~mem186#1.base == 0 && llist_add_to_end_#t~mem186#1.offset == 0);havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset;call llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset := read~$Pointer$#17(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~mem187#1.base, llist_add_to_end_#t~mem187#1.offset;havoc llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset; [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: getopt32_~flags~0#1 := getopt32_#t~bitwise163#1;havoc getopt32_#t~mem161#1;havoc getopt32_#t~bitwise162#1;havoc getopt32_#t~bitwise163#1;call getopt32_#t~mem164#1 := read~int#5(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-2: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise163#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise162#1) % 4294967296; [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-1: [2025-02-08 13:29:58,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296); [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296;getopt32_#t~bitwise163#1 := getopt32_~flags~0#1; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296); [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-6: havoc getopt32_#t~bitwise162#1;assume getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_#t~mem161#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-5: [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_#t~mem161#1; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-7: assume getopt32_#t~mem161#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := 0; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-7: assume !(getopt32_#t~mem161#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-9: assume 0 == getopt32_#t~mem161#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-9: assume !(0 == getopt32_#t~mem161#1 % 4294967296); [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-1: [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: getopt32_~flags~0#1 := getopt32_#t~bitwise166#1;havoc getopt32_#t~mem164#1;havoc getopt32_#t~bitwise165#1;havoc getopt32_#t~bitwise166#1; [2025-02-08 13:29:58,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-3: assume 0 == getopt32_#t~bitwise165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_~flags~0#1; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-3: assume !(0 == getopt32_#t~bitwise165#1 % 4294967296); [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-2: havoc getopt32_#t~bitwise166#1;assume (getopt32_#t~bitwise166#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise166#1 % 4294967296 >= getopt32_#t~bitwise165#1 % 4294967296) && getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise165#1 % 4294967296; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-5: [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_#t~bitwise165#1; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise165#1 % 4294967296); [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-7: assume getopt32_#t~mem164#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := 0; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-7: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-6: havoc getopt32_#t~bitwise165#1;assume getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_#t~mem164#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-9: assume 0 == getopt32_#t~mem164#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-9: assume !(0 == getopt32_#t~mem164#1 % 4294967296); [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_#t~mem164#1; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981-1: skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset := skip_whitespace_~s#1.base, 1 + skip_whitespace_~s#1.offset; [2025-02-08 13:29:58,259 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2948: 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~ret259#1.base, xzalloc_#t~ret259#1.offset, xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981: assume true;call skip_whitespace_#t~mem195#1 := read~int#6(skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset, 1); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981: assume !true; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: getopt32_~flags~0#1 := getopt32_#t~bitwise167#1;havoc getopt32_#t~bitwise167#1;call getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-2: havoc getopt32_#t~bitwise167#1;assume getopt32_#t~bitwise167#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-1: [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_~flags~0#1; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := 0; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147: call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset;__main_#t~ret210#1.base, __main_#t~ret210#1.offset := xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset;havoc xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset, xmalloc_fgetline_#t~mem232#1, xmalloc_fgetline_#t~mem233#1, xmalloc_fgetline_#t~mem234#1, xmalloc_fgetline_#t~mem235#1, xmalloc_fgetline_#t~mem236#1, xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset, xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;havoc xmalloc_fgetline_#in~file#1.base, xmalloc_fgetline_#in~file#1.offset;assume { :end_inline_xmalloc_fgetline } true;__main_~cur_line~0#1.base, __main_~cur_line~0#1.offset := __main_#t~ret210#1.base, __main_#t~ret210#1.offset;havoc __main_#t~ret210#1.base, __main_#t~ret210#1.offset; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: assume !(32 == skip_whitespace_#t~mem195#1);havoc skip_whitespace_#t~mem195#1;call skip_whitespace_#t~mem196#1 := read~int#6(skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset, 1); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: assume !!(32 == skip_whitespace_#t~mem195#1);havoc skip_whitespace_#t~mem195#1; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset, xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset;havoc llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset;call write~$Pointer$#17(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~mem189#1.base, llist_add_to_end_#t~mem189#1.offset := read~$Pointer$#17(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#17(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem189#1.base, 8 + llist_add_to_end_#t~mem189#1.offset, 8);havoc llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset;havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset, llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset, llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset, llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: assume !(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset;call getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem171#1 := read~int#17(getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset, 4); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: assume !!(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset; [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-1: SUMMARY for call bb_error_msg_and_die(12, 0, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset); srcloc: null [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: xstrtou_range_sfx_#t~ret247#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet43#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret247#1;havoc xstrtou_range_sfx_#t~ret247#1;call xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset := read~$Pointer$#12(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:29:58,260 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247: havoc xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset; [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-2: call xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#4(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, 8);call write~int#4(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs257#1.base, 8 + xstrtou_range_sfx_#t~varargs257#1.offset, 8);call write~int#4(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs257#1.base, 16 + xstrtou_range_sfx_#t~varargs257#1.offset, 8); [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume 1 + getopt32_#t~mem171#1 <= 2147483647;call write~int#17(1 + getopt32_#t~mem171#1, getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset, 4); [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume !(1 + getopt32_#t~mem171#1 <= 2147483647); [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: assume 1 + getopt32_#t~mem171#1 >= -2147483648; [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: assume !(1 + getopt32_#t~mem171#1 >= -2147483648); [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: assume true; [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: assume !true; [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem248#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem248#1.offset);havoc xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset;call xstrtou_range_sfx_#t~mem249#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:58,261 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem248#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem248#1.offset);havoc xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset; [2025-02-08 13:29:58,262 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset := bb_get_chunk_from_file_#res#1.base, bb_get_chunk_from_file_#res#1.offset;havoc bb_get_chunk_from_file_#t~ret37#1, bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset, bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset, bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset, bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset, bb_get_chunk_from_file_~ch~0#1, bb_get_chunk_from_file_~idx~0#1, 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, bb_get_chunk_from_file_~tmp_post$2~0#1;havoc bb_get_chunk_from_file_#in~file#1.base, bb_get_chunk_from_file_#in~file#1.offset, bb_get_chunk_from_file_#in~end#1.base, bb_get_chunk_from_file_#in~end#1.offset;assume { :end_inline_bb_get_chunk_from_file } true;xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset := xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset;havoc xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset;call xmalloc_fgetline_#t~mem232#1 := read~int#8(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4); [2025-02-08 13:29:58,262 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume 0 != __main_~tmp_if_expr$5~0#1 % 256; [2025-02-08 13:29:58,262 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume !(0 != __main_~tmp_if_expr$5~0#1 % 256);call ULTIMATE.dealloc(__main_~cur_line~0#1.base, __main_~cur_line~0#1.offset);__main_~dups~0#1 := 1 + __main_~dups~0#1; [2025-02-08 13:29:58,262 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 4);havoc skip_whitespace_#t~mem196#1; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !!(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 4);havoc skip_whitespace_#t~mem196#1; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-2: assume 247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-2: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-1: assume 247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 2147483647; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-1: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem172#1 := read~int#5(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume !(0 == xmalloc_fgetline_#t~mem232#1);havoc xmalloc_fgetline_#t~mem232#1;call xmalloc_fgetline_#t~mem233#1 := read~int#8(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume !!(0 == xmalloc_fgetline_#t~mem232#1);havoc xmalloc_fgetline_#t~mem232#1; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume 0 == xstrtou_range_sfx_#t~mem249#1;havoc xstrtou_range_sfx_#t~mem249#1;call write~int#9(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume !(0 == xstrtou_range_sfx_#t~mem249#1);havoc xstrtou_range_sfx_#t~mem249#1; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume 1 == getopt32_#t~mem172#1;havoc getopt32_#t~mem172#1;call getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset, llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset, llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset, llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume !(1 == getopt32_#t~mem172#1);havoc getopt32_#t~mem172#1;call getopt32_#t~mem174#1 := read~int#5(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: assume -1 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: assume !(-1 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: assume xmalloc_fgetline_#t~mem233#1 - 1 <= 2147483647;call write~int#8(xmalloc_fgetline_#t~mem233#1 - 1, xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);havoc xmalloc_fgetline_#t~mem233#1;call xmalloc_fgetline_#t~mem234#1 := read~int#8(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);call xmalloc_fgetline_#t~mem235#1 := read~int#6(xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem234#1, 1); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: assume !(xmalloc_fgetline_#t~mem233#1 - 1 <= 2147483647); [2025-02-08 13:29:58,263 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152-1: assume xmalloc_fgetline_#t~mem233#1 - 1 >= -2147483648; [2025-02-08 13:29:58,267 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152-1: assume !(xmalloc_fgetline_#t~mem233#1 - 1 >= -2147483648); [2025-02-08 13:29:58,267 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987-1: skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset := skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset; [2025-02-08 13:29:58,267 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3120: xdup2_#t~ret226#1 := dup2_#res#1;havoc dup2_#t~nondet262#1, dup2_#t~nondet263#1, dup2_#t~mem264#1, dup2_~oldfd#1, dup2_~newfd#1;havoc dup2_#in~oldfd#1, dup2_#in~newfd#1;assume { :end_inline_dup2 } true;assume -2147483648 <= xdup2_#t~ret226#1 && xdup2_#t~ret226#1 <= 2147483647;xdup2_~return_value_dup2$1~0#1 := xdup2_#t~ret226#1;havoc xdup2_#t~ret226#1; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume 10 == xmalloc_fgetline_#t~mem235#1;havoc xmalloc_fgetline_#t~mem234#1;havoc xmalloc_fgetline_#t~mem235#1;call xmalloc_fgetline_#t~mem236#1 := read~int#8(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);call write~int#6(0, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem236#1, 1); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume !(10 == xmalloc_fgetline_#t~mem235#1);havoc xmalloc_fgetline_#t~mem234#1;havoc xmalloc_fgetline_#t~mem235#1; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume 0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume !(0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !(xdup2_~return_value_dup2$1~0#1 == xdup2_~to#1);call xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !!(xdup2_~return_value_dup2$1~0#1 == xdup2_~to#1); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890: assume 2 == getopt32_#t~mem174#1;havoc getopt32_#t~mem174#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret224#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret225#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem243#1, xstrtou_range_sfx_#t~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_#t~ret247#1, xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset, xstrtou_range_sfx_#t~mem249#1, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset, xstrtou_range_sfx_#t~nondet252#1, xstrtou_range_sfx_#t~mem253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, xstrtou_range_sfx_#t~mem256#1, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~0#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~3#1;call xstrtou_range_sfx_#t~mem243#1 := read~int#17(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890: assume !(2 == getopt32_#t~mem174#1);havoc getopt32_#t~mem174#1;call getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254: havoc xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret225#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem243#1, xstrtou_range_sfx_#t~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_#t~ret247#1, xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset, xstrtou_range_sfx_#t~mem249#1, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset, xstrtou_range_sfx_#t~nondet252#1, xstrtou_range_sfx_#t~mem253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, xstrtou_range_sfx_#t~mem256#1, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret225#1;havoc xatou_range_#t~ret225#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254-2: call xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#4(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, 8); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221-1: assume !(0 == xstrtou_range_sfx_#t~mem250#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem250#1; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221-1: assume !!(0 == xstrtou_range_sfx_#t~mem250#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem250#1; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset); srcloc: null [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221: assume true;call xstrtou_range_sfx_#t~mem250#1 := read~int#14(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221: assume !true; [2025-02-08 13:29:58,268 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3122: SUMMARY for call bb_perror_msg_and_die(10, 0, xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset); srcloc: null [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3056-1: assume true; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3056-1: assume !true; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363-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:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363: 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:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3156-1: xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset := xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3223: 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~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset := read~$Pointer$#12(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~nondet252#1;havoc xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset;havoc xstrtou_range_sfx_#t~nondet252#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2893: getopt32_#t~ret175#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret224#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret175#1 && getopt32_#t~ret175#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret175#1;havoc getopt32_#t~ret175#1;call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#17(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3059: assume __main_~cur_line~0#1.base == 0 && __main_~cur_line~0#1.offset == 0; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3059: assume !(__main_~cur_line~0#1.base == 0 && __main_~cur_line~0#1.offset == 0);__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_~cur_line~0#1.base, __main_~cur_line~0#1.offset;call __main_#t~mem211#1 := read~int#17(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset, 4);__main_~i~1#1 := __main_#t~mem211#1;havoc __main_#t~mem211#1; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: 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#6((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:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3259-1: SUMMARY for call xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3259: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset;havoc xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: call ULTIMATE.dealloc(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset);havoc __main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset;call ULTIMATE.dealloc(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset);havoc __main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset;call ULTIMATE.dealloc(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset);havoc __main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3260: havoc xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3260-1: SUMMARY for call xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset := #Ultimate.C_memset#17(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:29:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: assume !(getopt32_#t~mem177#1.base == 0 && getopt32_#t~mem177#1.offset == 0);havoc getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset;call getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#17(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset, 8); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: assume !!(getopt32_#t~mem177#1.base == 0 && getopt32_#t~mem177#1.offset == 0);havoc getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume 0 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume !(0 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem253#1 := read~int#14(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3162: havoc xdup2_#t~ret226#1, xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset, xdup2_~from#1, xdup2_~to#1, xdup2_~return_value_dup2$1~0#1;havoc xdup2_#in~from#1, xdup2_#in~to#1;assume { :end_inline_xdup2 } true;assume -2147483648 <= xmove_fd_#t~nondet237#1 && xmove_fd_#t~nondet237#1 <= 2147483647;havoc xmove_fd_#t~nondet237#1;havoc xmove_fd_#t~nondet237#1, xmove_fd_~from#1, xmove_fd_~to#1;havoc xmove_fd_#in~from#1, xmove_fd_#in~to#1;assume { :end_inline_xmove_fd } true;havoc __main_~return_value_xopen$2~0#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume 45 == xstrtou_range_sfx_#t~mem243#1;havoc xstrtou_range_sfx_#t~mem243#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !(45 == xstrtou_range_sfx_#t~mem243#1);havoc xstrtou_range_sfx_#t~mem243#1;call xstrtou_range_sfx_#t~mem244#1 := read~int#17(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem244#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume !(0 == __main_~i~1#1 % 4294967296);assume { :begin_inline_skip_whitespace } true;skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset := __main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset;havoc skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset;havoc skip_whitespace_#t~mem195#1, skip_whitespace_#t~mem196#1, skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset;skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset := skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume !!(0 == __main_~i~1#1 % 4294967296);call __main_#t~mem214#1 := read~int#17(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset, 4);__main_~i~1#1 := __main_#t~mem214#1;havoc __main_#t~mem214#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !!(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !(4294967295 / (xstrtou_range_sfx_#t~mem253#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem253#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem253#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem253#1;call xstrtou_range_sfx_#t~mem254#1 := read~int#14(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem254#1;havoc xstrtou_range_sfx_#t~mem254#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3065: __main_#t~ret212#1.base, __main_#t~ret212#1.offset := skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset;havoc skip_whitespace_#t~mem195#1, skip_whitespace_#t~mem196#1, skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset;havoc skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset;assume { :end_inline_skip_whitespace } true;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_#t~ret212#1.base, __main_#t~ret212#1.offset;havoc __main_#t~ret212#1.base, __main_#t~ret212#1.offset;assume { :begin_inline_skip_non_whitespace } true;skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset := __main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset;havoc skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset;havoc skip_non_whitespace_#t~mem192#1, skip_non_whitespace_#t~mem193#1, skip_non_whitespace_#t~mem194#1, skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset;skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset := skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2867-1: assume true; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2867-1: assume !true; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: havoc _IO_getc_#t~nondet261#1;bb_get_chunk_from_file_#t~ret37#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet261#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:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066: __main_#t~ret213#1.base, __main_#t~ret213#1.offset := skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset;havoc skip_non_whitespace_#t~mem192#1, skip_non_whitespace_#t~mem193#1, skip_non_whitespace_#t~mem194#1, skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset;havoc skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset;assume { :end_inline_skip_non_whitespace } true;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_#t~ret213#1.base, __main_#t~ret213#1.offset;havoc __main_#t~ret213#1.base, __main_#t~ret213#1.offset;__main_~i~1#1 := __main_~i~1#1 - 1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: assume 10 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: assume !(10 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc xstrtou_range_sfx_~tmp_if_expr$3~2#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:29:58,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume -1 == getopt32_~c~0#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem245#1 := read~int#17(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069: assume true;__main_#t~short216#1 := 0 == __main_~i~1#1 % 4294967296; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069: assume !true; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume true;call skip_non_whitespace_#t~mem192#1 := read~int#6(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume !true; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-2: assume !!(0 == skip_non_whitespace_#t~mem192#1);havoc skip_non_whitespace_#t~mem192#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-2: assume !(0 == skip_non_whitespace_#t~mem192#1);havoc skip_non_whitespace_#t~mem192#1;call skip_non_whitespace_#t~mem193#1 := read~int#6(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236: assume 0 == xstrtou_range_sfx_#t~mem256#1;havoc xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset;havoc xstrtou_range_sfx_#t~mem256#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236: assume !(0 == xstrtou_range_sfx_#t~mem256#1);havoc xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset;havoc xstrtou_range_sfx_#t~mem256#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236-1: call xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset := read~$Pointer$#12(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem256#1 := read~int#17(xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, 1); [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071-1: assume __main_#t~short216#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071-1: assume !__main_#t~short216#1;call __main_#t~mem215#1 := read~int#6(__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset, 1);__main_#t~short216#1 := 0 == __main_#t~mem215#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071: assume __main_#t~short216#1;havoc __main_#t~mem215#1;havoc __main_#t~short216#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071: assume !__main_#t~short216#1;havoc __main_#t~mem215#1;havoc __main_#t~short216#1;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_~cur_compare~0#1.base, 1 + __main_~cur_compare~0#1.offset;__main_~i~1#1 := __main_~i~1#1 - 1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume 32 == skip_non_whitespace_#t~mem193#1;havoc skip_non_whitespace_#t~mem193#1; [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume !(32 == skip_non_whitespace_#t~mem193#1);havoc skip_non_whitespace_#t~mem193#1;call skip_non_whitespace_#t~mem194#1 := read~int#6(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:58,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874: assume true;call getopt32_#t~mem154#1 := read~int#5(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874: assume !true; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-2: assume !!((if getopt32_#t~mem154#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem154#1 % 256 % 4294967296 else getopt32_#t~mem154#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem154#1; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-2: assume !((if getopt32_#t~mem154#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem154#1 % 256 % 4294967296 else getopt32_#t~mem154#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem154#1;call getopt32_#t~mem155#1 := read~int#5(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205-1: assume xstrtou_range_sfx_#t~mem245#1 - 9 >= -2147483648; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205-1: assume !(xstrtou_range_sfx_#t~mem245#1 - 9 >= -2147483648); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: assume xstrtou_range_sfx_#t~mem245#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem245#1 - 9;havoc xstrtou_range_sfx_#t~mem245#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: assume !(xstrtou_range_sfx_#t~mem245#1 - 9 <= 2147483647); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) > 4);havoc skip_non_whitespace_#t~mem194#1; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !!(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) > 4);havoc skip_non_whitespace_#t~mem194#1;skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset := skip_non_whitespace_~s#1.base, 1 + skip_non_whitespace_~s#1.offset; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-2: assume 247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-2: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-1: assume 247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) <= 2147483647; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-1: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume 0 == (if getopt32_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem155#1 % 256 % 4294967296 else getopt32_#t~mem155#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem155#1; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume !(0 == (if getopt32_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem155#1 % 256 % 4294967296 else getopt32_#t~mem155#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem155#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338: havoc getopt_long_#t~ret297#1;getopt32_#t~ret153#1 := getopt_long_#res#1;havoc getopt_long_#t~mem293#1.base, getopt_long_#t~mem293#1.offset, getopt_long_#t~mem294#1, getopt_long_#t~mem295#1.base, getopt_long_#t~mem295#1.offset, getopt_long_#t~mem296#1, getopt_long_#t~ret297#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret153#1 && getopt32_#t~ret153#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret153#1;havoc getopt32_#t~ret153#1; [2025-02-08 13:29:58,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338-2: getopt_long_#t~ret297#1 := getopt_#res#1;havoc getopt_#t~mem277#1.base, getopt_#t~mem277#1.offset, getopt_#t~mem278#1, getopt_#t~short279#1, getopt_#t~nondet280#1, getopt_#t~nondet281#1, getopt_#t~mem282#1, getopt_#t~short283#1, getopt_#t~nondet284#1, getopt_#t~mem285#1, getopt_#t~nondet286#1, getopt_#t~pre287#1, getopt_#t~mem288#1, getopt_#t~short289#1, getopt_#t~nondet290#1, getopt_#t~mem291#1.base, getopt_#t~mem291#1.offset, getopt_#t~pre292#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~ret297#1 && getopt_long_#t~ret297#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret297#1;havoc getopt_long_#t~ret297#1; [2025-02-08 13:29:58,412 INFO L? ?]: Removed 656 outVars from TransFormulas that were not future-live. [2025-02-08 13:29:58,412 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:29:58,439 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:29:58,439 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:29:58,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:58 BoogieIcfgContainer [2025-02-08 13:29:58,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:29:58,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:29:58,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:29:58,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:29:58,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:50" (1/3) ... [2025-02-08 13:29:58,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeed173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:58, skipping insertion in model container [2025-02-08 13:29:58,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:51" (2/3) ... [2025-02-08 13:29:58,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeed173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:58, skipping insertion in model container [2025-02-08 13:29:58,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:58" (3/3) ... [2025-02-08 13:29:58,447 INFO L128 eAbstractionObserver]: Analyzing ICFG uniq-2.i [2025-02-08 13:29:58,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:29:58,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uniq-2.i that has 72 procedures, 689 locations, 1 initial locations, 77 loop locations, and 70 error locations. [2025-02-08 13:29:58,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:29:58,514 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;@100d728, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:29:58,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-08 13:29:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 461 states, 342 states have (on average 1.6695906432748537) internal successors, (571), 427 states have internal predecessors, (571), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 13:29:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:29:58,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:58,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:29:58,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:29:58,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1314700, now seen corresponding path program 1 times [2025-02-08 13:29:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:58,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831805118] [2025-02-08 13:29:58,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:58,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:29:58,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:29:58,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:58,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:59,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:29:59,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:59,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831805118] [2025-02-08 13:29:59,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831805118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:59,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:59,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:29:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877363995] [2025-02-08 13:29:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:59,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:59,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:59,242 INFO L87 Difference]: Start difference. First operand has 461 states, 342 states have (on average 1.6695906432748537) internal successors, (571), 427 states have internal predecessors, (571), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:29:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:59,313 INFO L93 Difference]: Finished difference Result 676 states and 917 transitions. [2025-02-08 13:29:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:59,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 13:29:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:59,322 INFO L225 Difference]: With dead ends: 676 [2025-02-08 13:29:59,322 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:29:59,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:59,326 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:59,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 518 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:29:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:29:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:29:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 152 states have (on average 1.5263157894736843) internal successors, (232), 185 states have internal predecessors, (232), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:29:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:29:59,359 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 3 [2025-02-08 13:29:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:29:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:29:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:29:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:29:59,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:59,360 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:29:59,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:29:59,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:29:59,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 512772349, now seen corresponding path program 1 times [2025-02-08 13:29:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:59,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983099641] [2025-02-08 13:29:59,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:59,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:59,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:59,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:59,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:29:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983099641] [2025-02-08 13:29:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983099641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175959380] [2025-02-08 13:29:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:59,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:59,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:59,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:29:59,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:30:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:30:00,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:30:00,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:00,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:00,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:00,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:00,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175959380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:30:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560805799] [2025-02-08 13:30:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:00,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:00,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:00,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:00,431 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:04,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:04,513 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-08 13:30:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:30:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:04,515 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:30:04,517 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:30:04,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:04,518 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:04,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:30:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:30:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.519736842105263) internal successors, (231), 184 states have internal predecessors, (231), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:30:04,531 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 6 [2025-02-08 13:30:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:04,531 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:30:04,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:30:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:04,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:04,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:04,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:30:04,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:04,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:04,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1283925106, now seen corresponding path program 1 times [2025-02-08 13:30:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741705257] [2025-02-08 13:30:04,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:04,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:04,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:04,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:04,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741705257] [2025-02-08 13:30:05,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741705257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:05,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215527996] [2025-02-08 13:30:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:05,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:05,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:05,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:05,016 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:05,051 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:30:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:30:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:05,052 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:30:05,052 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:30:05,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:05,053 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:05,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:30:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:30:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.52) internal successors, (228), 181 states have internal predecessors, (228), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:30:05,059 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 7 [2025-02-08 13:30:05,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:05,059 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:30:05,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:30:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:05,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:05,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:05,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:05,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:05,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:05,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1512427665, now seen corresponding path program 1 times [2025-02-08 13:30:05,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:05,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713954630] [2025-02-08 13:30:05,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:05,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:05,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:05,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:05,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:05,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:05,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:05,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713954630] [2025-02-08 13:30:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713954630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094977665] [2025-02-08 13:30:05,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:05,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:05,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:05,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:05,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:30:05,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:05,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:05,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:05,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:05,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:05,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:05,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:05,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094977665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:05,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:05,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:05,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380214746] [2025-02-08 13:30:05,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:05,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:05,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:05,988 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:10,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:10,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:10,048 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:30:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:30:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:10,049 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:30:10,049 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:30:10,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:10,050 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 187 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:10,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:30:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:30:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 179 states have internal predecessors, (226), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:30:10,056 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 11 [2025-02-08 13:30:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:10,057 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:30:10,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:30:10,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:10,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:10,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:10,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:30:10,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:10,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:10,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:10,259 INFO L85 PathProgramCache]: Analyzing trace with hash -359381388, now seen corresponding path program 1 times [2025-02-08 13:30:10,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:10,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945872740] [2025-02-08 13:30:10,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:10,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:10,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:10,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:10,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:10,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945872740] [2025-02-08 13:30:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945872740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885356522] [2025-02-08 13:30:10,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:10,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:10,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:30:11,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:11,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:11,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:11,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:11,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:11,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:11,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885356522] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:11,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69751482] [2025-02-08 13:30:11,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:11,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:11,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:11,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:11,309 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:11,368 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2025-02-08 13:30:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:11,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:30:11,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:11,369 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:30:11,369 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:30:11,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:11,371 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:11,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1157 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:30:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:30:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 188 states have internal predecessors, (235), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2025-02-08 13:30:11,384 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 12 [2025-02-08 13:30:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2025-02-08 13:30:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2025-02-08 13:30:11,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:11,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:11,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:11,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:30:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:11,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:11,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -456832381, now seen corresponding path program 2 times [2025-02-08 13:30:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580750821] [2025-02-08 13:30:11,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:11,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:11,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:30:11,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:11,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:11,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:30:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580750821] [2025-02-08 13:30:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580750821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:11,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092771318] [2025-02-08 13:30:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:11,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:11,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:11,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:11,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:11,989 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:16,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:16,125 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-02-08 13:30:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:30:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:16,126 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:30:16,127 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:30:16,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:16,127 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 186 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:16,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 710 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:30:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:30:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.4654088050314464) internal successors, (233), 186 states have internal predecessors, (233), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 13:30:16,141 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 21 [2025-02-08 13:30:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 13:30:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2025-02-08 13:30:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:16,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:16,142 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:16,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:16,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1146399139, now seen corresponding path program 1 times [2025-02-08 13:30:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132922351] [2025-02-08 13:30:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:16,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:30:16,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:30:16,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:16,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132922351] [2025-02-08 13:30:16,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132922351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:16,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:30:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448611393] [2025-02-08 13:30:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:16,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:16,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:16,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:16,591 INFO L87 Difference]: Start difference. First operand 200 states and 248 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:30:20,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,670 INFO L93 Difference]: Finished difference Result 384 states and 481 transitions. [2025-02-08 13:30:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:20,671 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:30:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,672 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:30:20,672 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:30:20,672 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:30:20,673 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:20,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:30:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:30:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:20,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-02-08 13:30:20,681 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 26 [2025-02-08 13:30:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,684 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-02-08 13:30:20,684 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:30:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-02-08 13:30:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:30:20,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:20,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:30:20,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:20,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1178968355, now seen corresponding path program 1 times [2025-02-08 13:30:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239769734] [2025-02-08 13:30:20,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:20,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:30:20,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:30:20,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:20,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239769734] [2025-02-08 13:30:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239769734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:21,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:21,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:21,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272552230] [2025-02-08 13:30:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:21,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:21,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:21,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:21,015 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:21,054 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2025-02-08 13:30:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 13:30:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:21,057 INFO L225 Difference]: With dead ends: 320 [2025-02-08 13:30:21,057 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 13:30:21,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:21,058 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 140 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 457 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:21,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 13:30:21,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2025-02-08 13:30:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 193 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-08 13:30:21,067 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 27 [2025-02-08 13:30:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:21,067 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-08 13:30:21,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-08 13:30:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:21,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:21,068 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:30:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:30:21,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1209188668, now seen corresponding path program 1 times [2025-02-08 13:30:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589762356] [2025-02-08 13:30:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:21,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,456 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:30:21,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589762356] [2025-02-08 13:30:21,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589762356] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:21,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494977627] [2025-02-08 13:30:21,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:21,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:21,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:21,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:21,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:30:22,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:22,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:22,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:22,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:22,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:22,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:22,319 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:30:22,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:22,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494977627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:22,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:22,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:22,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084113773] [2025-02-08 13:30:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:22,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:22,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:22,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:22,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:22,321 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:26,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:26,415 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2025-02-08 13:30:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:26,416 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:30:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:26,417 INFO L225 Difference]: With dead ends: 207 [2025-02-08 13:30:26,417 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 13:30:26,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:26,418 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:26,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 13:30:26,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-08 13:30:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 192 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:26,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 255 transitions. [2025-02-08 13:30:26,430 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 255 transitions. Word has length 29 [2025-02-08 13:30:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:26,431 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 255 transitions. [2025-02-08 13:30:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2025-02-08 13:30:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:26,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:26,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:26,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:30:26,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 13:30:26,636 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1209188828, now seen corresponding path program 1 times [2025-02-08 13:30:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922948937] [2025-02-08 13:30:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:26,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:26,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:26,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:26,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922948937] [2025-02-08 13:30:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922948937] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019987563] [2025-02-08 13:30:26,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:26,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:26,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:26,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:30:27,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:27,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:27,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:27,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:27,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:27,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:27,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:27,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019987563] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:27,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:27,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:30:27,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890496367] [2025-02-08 13:30:27,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:27,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:30:27,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:27,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:30:27,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:27,764 INFO L87 Difference]: Start difference. First operand 206 states and 255 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:30,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:32,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:33,133 INFO L93 Difference]: Finished difference Result 415 states and 519 transitions. [2025-02-08 13:30:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:30:33,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:30:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:33,135 INFO L225 Difference]: With dead ends: 415 [2025-02-08 13:30:33,135 INFO L226 Difference]: Without dead ends: 223 [2025-02-08 13:30:33,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:33,135 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 5 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:33,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1334 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-08 13:30:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-08 13:30:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-08 13:30:33,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 209 states have internal predecessors, (257), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2025-02-08 13:30:33,144 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 29 [2025-02-08 13:30:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:33,145 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2025-02-08 13:30:33,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2025-02-08 13:30:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:33,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:33,147 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:30:33,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:30:33,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:30:33,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 809833466, now seen corresponding path program 1 times [2025-02-08 13:30:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151710849] [2025-02-08 13:30:33,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:33,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:33,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:33,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:33,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151710849] [2025-02-08 13:30:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151710849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933980719] [2025-02-08 13:30:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:33,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:33,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:33,631 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:36,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:36,942 INFO L93 Difference]: Finished difference Result 234 states and 285 transitions. [2025-02-08 13:30:36,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:36,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:30:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:36,945 INFO L225 Difference]: With dead ends: 234 [2025-02-08 13:30:36,945 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 13:30:36,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:36,946 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:36,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-08 13:30:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 13:30:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2025-02-08 13:30:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 218 states have internal predecessors, (269), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-02-08 13:30:36,958 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 48 [2025-02-08 13:30:36,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:36,958 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-02-08 13:30:36,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-02-08 13:30:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:36,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:36,959 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:36,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:30:36,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 809838431, now seen corresponding path program 1 times [2025-02-08 13:30:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727727720] [2025-02-08 13:30:36,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:37,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:37,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:37,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:37,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:37,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727727720] [2025-02-08 13:30:37,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727727720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:37,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:37,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:37,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049342644] [2025-02-08 13:30:37,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:37,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:37,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:37,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:37,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:37,311 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:41,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:41,384 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2025-02-08 13:30:41,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:41,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:30:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:41,385 INFO L225 Difference]: With dead ends: 232 [2025-02-08 13:30:41,385 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 13:30:41,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:41,386 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:41,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 13:30:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2025-02-08 13:30:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 213 states have internal predecessors, (263), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2025-02-08 13:30:41,402 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 48 [2025-02-08 13:30:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:41,403 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2025-02-08 13:30:41,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2025-02-08 13:30:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:30:41,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:41,406 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:41,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:30:41,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash -776176191, now seen corresponding path program 1 times [2025-02-08 13:30:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73975596] [2025-02-08 13:30:41,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:41,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:41,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:41,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:41,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:41,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73975596] [2025-02-08 13:30:41,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73975596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264335991] [2025-02-08 13:30:41,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:41,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:41,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:30:42,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:42,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:42,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:42,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:42,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:42,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:42,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264335991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:30:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632738961] [2025-02-08 13:30:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:42,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:42,726 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:42,797 INFO L93 Difference]: Finished difference Result 338 states and 426 transitions. [2025-02-08 13:30:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:42,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:30:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:42,799 INFO L225 Difference]: With dead ends: 338 [2025-02-08 13:30:42,799 INFO L226 Difference]: Without dead ends: 337 [2025-02-08 13:30:42,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:42,799 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 279 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:42,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 684 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:42,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-08 13:30:42,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 226. [2025-02-08 13:30:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 212 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2025-02-08 13:30:42,806 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 49 [2025-02-08 13:30:42,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:42,806 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2025-02-08 13:30:42,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2025-02-08 13:30:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:30:42,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:42,807 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:42,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:30:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:30:43,011 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:43,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1708343084, now seen corresponding path program 1 times [2025-02-08 13:30:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987576838] [2025-02-08 13:30:43,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:43,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:43,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987576838] [2025-02-08 13:30:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987576838] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135041188] [2025-02-08 13:30:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:43,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:43,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:30:43,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:44,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:44,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:44,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:44,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:44,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:44,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:44,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135041188] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:44,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:44,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:30:44,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733496122] [2025-02-08 13:30:44,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:44,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:44,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:44,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:44,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:44,135 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:44,254 INFO L93 Difference]: Finished difference Result 683 states and 887 transitions. [2025-02-08 13:30:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-08 13:30:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:44,257 INFO L225 Difference]: With dead ends: 683 [2025-02-08 13:30:44,257 INFO L226 Difference]: Without dead ends: 682 [2025-02-08 13:30:44,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:44,258 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 699 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:44,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1246 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-08 13:30:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 238. [2025-02-08 13:30:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 224 states have internal predecessors, (277), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2025-02-08 13:30:44,278 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 50 [2025-02-08 13:30:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:44,278 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2025-02-08 13:30:44,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2025-02-08 13:30:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:30:44,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:44,279 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:30:44,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:30:44,479 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:30:44,481 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:44,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1989045471, now seen corresponding path program 1 times [2025-02-08 13:30:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328889513] [2025-02-08 13:30:44,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:44,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:30:44,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:30:44,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:44,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:44,793 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:30:44,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:44,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328889513] [2025-02-08 13:30:44,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328889513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:44,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691992281] [2025-02-08 13:30:44,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:44,799 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:30:44,800 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:30:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:30:45,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:30:45,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:45,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:45,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:45,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:45,649 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:30:45,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:45,701 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:30:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691992281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:45,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:30:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515538316] [2025-02-08 13:30:45,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:45,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:45,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:45,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:45,702 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:49,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:51,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:55,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:55,085 INFO L93 Difference]: Finished difference Result 452 states and 562 transitions. [2025-02-08 13:30:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:55,086 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 55 [2025-02-08 13:30:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:55,087 INFO L225 Difference]: With dead ends: 452 [2025-02-08 13:30:55,088 INFO L226 Difference]: Without dead ends: 256 [2025-02-08 13:30:55,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:55,089 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:55,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 675 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2025-02-08 13:30:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-08 13:30:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-08 13:30:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 242 states have internal predecessors, (295), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2025-02-08 13:30:55,098 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 55 [2025-02-08 13:30:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2025-02-08 13:30:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2025-02-08 13:30:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:30:55,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:55,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:55,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:30:55,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:30:55,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2051848095, now seen corresponding path program 1 times [2025-02-08 13:30:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:55,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469306468] [2025-02-08 13:30:55,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:55,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:30:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:30:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:55,617 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:30:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469306468] [2025-02-08 13:30:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469306468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616471683] [2025-02-08 13:30:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:55,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:55,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:55,618 INFO L87 Difference]: Start difference. First operand 256 states and 310 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:30:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:55,706 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2025-02-08 13:30:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:55,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-02-08 13:30:55,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:55,708 INFO L225 Difference]: With dead ends: 503 [2025-02-08 13:30:55,708 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 13:30:55,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:55,708 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:55,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 402 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 13:30:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 298. [2025-02-08 13:30:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 283 states have internal predecessors, (350), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:30:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 367 transitions. [2025-02-08 13:30:55,746 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 367 transitions. Word has length 59 [2025-02-08 13:30:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:55,746 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 367 transitions. [2025-02-08 13:30:55,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:30:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2025-02-08 13:30:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:30:55,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:55,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:30:55,747 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:55,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash 436068989, now seen corresponding path program 1 times [2025-02-08 13:30:55,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365544354] [2025-02-08 13:30:55,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:55,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:30:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:30:55,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:55,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:56,015 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:30:56,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:56,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365544354] [2025-02-08 13:30:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365544354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:56,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:56,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:56,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654123267] [2025-02-08 13:30:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:56,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:56,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:56,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,017 INFO L87 Difference]: Start difference. First operand 298 states and 367 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:56,051 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2025-02-08 13:30:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-02-08 13:30:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:56,052 INFO L225 Difference]: With dead ends: 300 [2025-02-08 13:30:56,052 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 13:30:56,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,053 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:56,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 13:30:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 13:30:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3384615384615384) internal successors, (348), 283 states have internal predecessors, (348), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:30:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 365 transitions. [2025-02-08 13:30:56,062 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 365 transitions. Word has length 61 [2025-02-08 13:30:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:56,062 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 365 transitions. [2025-02-08 13:30:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 365 transitions. [2025-02-08 13:30:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:30:56,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:56,063 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:56,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:30:56,063 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:30:56,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:56,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1638211232, now seen corresponding path program 2 times [2025-02-08 13:30:56,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:56,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847820938] [2025-02-08 13:30:56,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:56,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 13:30:56,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-02-08 13:30:56,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:56,482 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:30:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:56,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847820938] [2025-02-08 13:30:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847820938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:30:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950577483] [2025-02-08 13:30:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:56,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:30:56,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:56,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:30:56,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:56,484 INFO L87 Difference]: Start difference. First operand 298 states and 365 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:00,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:00,569 INFO L93 Difference]: Finished difference Result 526 states and 654 transitions. [2025-02-08 13:31:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:00,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 62 [2025-02-08 13:31:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:00,571 INFO L225 Difference]: With dead ends: 526 [2025-02-08 13:31:00,571 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 13:31:00,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:00,572 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 192 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:00,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 858 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:31:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 13:31:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 13:31:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 283 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 364 transitions. [2025-02-08 13:31:00,580 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 364 transitions. Word has length 62 [2025-02-08 13:31:00,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:00,580 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 364 transitions. [2025-02-08 13:31:00,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 364 transitions. [2025-02-08 13:31:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:31:00,581 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:00,581 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:31:00,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1896416945, now seen corresponding path program 2 times [2025-02-08 13:31:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811643748] [2025-02-08 13:31:00,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:00,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:31:00,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:31:00,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:00,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:00,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811643748] [2025-02-08 13:31:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811643748] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:00,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111712550] [2025-02-08 13:31:00,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:00,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:00,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:00,840 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:00,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:31:01,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:31:01,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:31:01,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:01,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:01,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:01,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:01,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:01,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111712550] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:01,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:01,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:31:01,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640423022] [2025-02-08 13:31:01,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:01,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:01,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:01,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:01,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:01,754 INFO L87 Difference]: Start difference. First operand 298 states and 364 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:31:05,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:09,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:13,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:17,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:17,904 INFO L93 Difference]: Finished difference Result 298 states and 364 transitions. [2025-02-08 13:31:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:17,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 73 [2025-02-08 13:31:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:17,906 INFO L225 Difference]: With dead ends: 298 [2025-02-08 13:31:17,906 INFO L226 Difference]: Without dead ends: 297 [2025-02-08 13:31:17,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:31:17,906 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 172 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:17,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 738 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2025-02-08 13:31:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-08 13:31:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 282. [2025-02-08 13:31:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.346938775510204) internal successors, (330), 267 states have internal predecessors, (330), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:17,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2025-02-08 13:31:17,914 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 73 [2025-02-08 13:31:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:17,914 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2025-02-08 13:31:17,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:31:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2025-02-08 13:31:17,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:31:17,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:17,914 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:17,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:31:18,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:18,115 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 67 more)] === [2025-02-08 13:31:18,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash 153697192, now seen corresponding path program 1 times [2025-02-08 13:31:18,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:18,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029661918] [2025-02-08 13:31:18,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:18,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:18,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:31:18,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:31:18,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:18,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029661918] [2025-02-08 13:31:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029661918] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141418832] [2025-02-08 13:31:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:18,601 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:31:19,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:31:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:31:19,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:19,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:19,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:19,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141418832] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:19,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:19,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:31:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965510958] [2025-02-08 13:31:19,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:31:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:19,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:31:19,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:19,682 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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:31:22,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:26,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:28,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []