./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/tac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/tac-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 46628777f37166701e524c73726938b34ff0d4ac1e6886ace9aa906687735189 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:28:57,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:28:58,024 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:28:58,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:28:58,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:28:58,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:28:58,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:28:58,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:28:58,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:28:58,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:28:58,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:28:58,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:28:58,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:28:58,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:28:58,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:28:58,050 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:28:58,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:28:58,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:28:58,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:28:58,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:28:58,052 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 -> 46628777f37166701e524c73726938b34ff0d4ac1e6886ace9aa906687735189 [2025-02-08 13:28:58,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:28:58,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:28:58,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:28:58,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:28:58,297 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:28:58,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/tac-1.i [2025-02-08 13:28:59,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0e2350f8/24bb5e7b54d74017a1746c68a1ed5d32/FLAG2c1dc82ca [2025-02-08 13:28:59,891 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:28:59,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/tac-1.i [2025-02-08 13:28:59,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0e2350f8/24bb5e7b54d74017a1746c68a1ed5d32/FLAG2c1dc82ca [2025-02-08 13:29:00,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0e2350f8/24bb5e7b54d74017a1746c68a1ed5d32 [2025-02-08 13:29:00,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:00,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:00,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:00,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:00,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:00,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:00" (1/1) ... [2025-02-08 13:29:00,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6e2342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:00, skipping insertion in model container [2025-02-08 13:29:00,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:00" (1/1) ... [2025-02-08 13:29:00,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:00,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:00,969 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:01,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:01,206 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:01,211 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:01,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:01 WrapperNode [2025-02-08 13:29:01,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:01,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:01,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:01,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:01,217 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:01" (1/1) ... [2025-02-08 13:29:01,241 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:01" (1/1) ... [2025-02-08 13:29:01,322 INFO L138 Inliner]: procedures = 575, calls = 742, calls flagged for inlining = 26, calls inlined = 25, statements flattened = 1951 [2025-02-08 13:29:01,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:01,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:01,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:01,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:01,330 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:01" (1/1) ... [2025-02-08 13:29:01,330 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:01" (1/1) ... [2025-02-08 13:29:01,351 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:01" (1/1) ... [2025-02-08 13:29:01,438 INFO L175 MemorySlicer]: Split 629 memory accesses to 19 slices as follows [2, 3, 3, 2, 7, 3, 34, 20, 79, 19, 12, 2, 3, 17, 355, 44, 15, 3, 6]. 56 percent of accesses are in the largest equivalence class. The 381 initializations are split as follows [2, 3, 0, 2, 1, 0, 5, 4, 4, 0, 1, 0, 0, 4, 355, 0, 0, 0, 0]. The 101 writes are split as follows [0, 0, 0, 0, 2, 0, 0, 15, 51, 4, 5, 1, 0, 4, 0, 12, 1, 0, 6]. [2025-02-08 13:29:01,438 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:01" (1/1) ... [2025-02-08 13:29:01,439 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:01" (1/1) ... [2025-02-08 13:29:01,506 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:01" (1/1) ... [2025-02-08 13:29:01,511 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:01" (1/1) ... [2025-02-08 13:29:01,532 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:01" (1/1) ... [2025-02-08 13:29:01,542 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:01" (1/1) ... [2025-02-08 13:29:01,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:01,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:01,576 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:01,576 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:01,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:01" (1/1) ... [2025-02-08 13:29:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:01,618 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:01,626 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:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:01,646 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:01,647 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:01,648 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:01,648 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:29:01,649 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:29:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:01,650 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:29:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:29:01,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:29:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:29:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-02-08 13:29:01,657 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:01,659 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:29:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2025-02-08 13:29:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:01,661 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:29:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:29:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:29:02,192 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:02,196 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:02,601 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2344: assume -9223372036854775808 <= #t~ret65#1 && #t~ret65#1 <= 9223372036854775807;havoc #t~mem64#1.base, #t~mem64#1.offset;havoc #t~ret65#1; [2025-02-08 13:29:02,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2344-1: SUMMARY for call #t~ret65#1 := full_write(2, #t~mem64#1.base, #t~mem64#1.offset, ~used~0#1); srcloc: null [2025-02-08 13:29:02,602 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2343: #t~ret63#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet69#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret63#1 && #t~ret63#1 <= 2147483647;havoc #t~ret63#1;call #t~mem64#1.base, #t~mem64#1.offset := read~$Pointer$#16(~#msg~0#1.base, ~#msg~0#1.offset, 8); [2025-02-08 13:29:02,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume ~total~0#1 + ~cc~0#1 <= 9223372036854775807;~total~0#1 := ~total~0#1 + ~cc~0#1;~buf#1.base, ~buf#1.offset := ~buf#1.base, ~buf#1.offset + ~cc~0#1;~len#1 := ~len#1 - ~cc~0#1; [2025-02-08 13:29:02,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392: assume !(~total~0#1 + ~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:02,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392-1: assume ~total~0#1 + ~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:02,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392-1: assume !(~total~0#1 + ~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:02,845 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: assume !(0 == ~total~0#1);#res#1 := ~total~0#1; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: assume !!(0 == ~total~0#1);#res#1 := ~cc~0#1; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: assume ~cc~0#1 < 0; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: assume !(~cc~0#1 < 0); [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2385: #t~ret74#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~2#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= #t~ret74#1 && #t~ret74#1 <= 9223372036854775807;~cc~0#1 := #t~ret74#1;havoc #t~ret74#1; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2824: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem191#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~2#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem191#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2824: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~2#1 := 0; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823: safe_write_#t~ret190#1 := write_#res#1;havoc write_#t~nondet270#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~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:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821-1: assume 0 != safe_write_~tmp_if_expr$1~2#1 % 256; [2025-02-08 13:29:02,846 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2821-1: assume !(0 != safe_write_~tmp_if_expr$1~2#1 % 256); [2025-02-08 13:29:07,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3008: assume !(4294967295 / (xstrtou_range_sfx_#t~mem227#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem227#1; [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3008: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem227#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem227#1;call xstrtou_range_sfx_#t~mem228#1 := read~int#2(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~mem228#1;havoc xstrtou_range_sfx_#t~mem228#1; [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: assume true;call llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset := read~$Pointer$#8(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: assume !true; [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810-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:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810-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$#8(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:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744: assume 2 == getopt32_#t~mem172#1;havoc getopt32_#t~mem172#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~ret210#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~ret211#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~mem217#1, xstrtou_range_sfx_#t~mem218#1, xstrtou_range_sfx_#t~mem219#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem220#1, xstrtou_range_sfx_#t~ret221#1, xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset, xstrtou_range_sfx_#t~mem223#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~mem225#1.base, xstrtou_range_sfx_#t~mem225#1.offset, xstrtou_range_sfx_#t~nondet226#1, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~mem228#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~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset, xstrtou_range_sfx_#t~mem230#1, xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset, xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#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~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~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~mem217#1 := read~int#8(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744: assume !(2 == getopt32_#t~mem172#1);havoc getopt32_#t~mem172#1;call getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910: havoc __main_#t~mem203#1.base, __main_#t~mem203#1.offset;__main_~retval~0#1 := 1; [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-1: SUMMARY for call __main_#t~ret199#1.base, __main_#t~ret199#1.offset := xrealloc(__main_~line~0#1.base, __main_~line~0#1.offset, 132 + __main_~i~1#1); srcloc: null [2025-02-08 13:29:07,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2910-1: SUMMARY for call bb_simple_perror_msg(__main_#t~mem203#1.base, __main_#t~mem203#1.offset); srcloc: null [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877: __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset := __main_#t~ret199#1.base, __main_#t~ret199#1.offset;havoc __main_#t~ret199#1.base, __main_#t~ret199#1.offset;__main_~line~0#1.base, __main_~line~0#1.offset := __main_~return_value_xrealloc$1~0#1.base, __main_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume 127 + __main_~i~1#1 >= -2147483648; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume !(127 + __main_~i~1#1 >= -2147483648); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-2: assume 127 + __main_~i~1#1 <= 2147483647; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-2: assume !(127 + __main_~i~1#1 <= 2147483647); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977: havoc xstrtou_range_sfx_~tmp_if_expr$3~1#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: 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~ret235#1.base, xzalloc_#t~ret235#1.offset, xzalloc_#t~memset~res236#1.base, xzalloc_#t~memset~res236#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:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2813: 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~ret235#1.base, xzalloc_#t~ret235#1.offset, xzalloc_#t~memset~res236#1.base, xzalloc_#t~memset~res236#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$#8(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$#8(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#8(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:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: getopt32_#t~ret173#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret210#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~ret173#1 && getopt32_#t~ret173#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret173#1;havoc getopt32_#t~ret173#1;call getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#8(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem174#1.base, getopt32_#t~mem174#1.offset; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem219#1 := read~int#8(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: __main_~tmp_post$2~0#1 := __main_~i~1#1; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-1: assume 1 + __main_~i~1#1 >= -2147483648; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-1: assume !(1 + __main_~i~1#1 >= -2147483648); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: assume 1 + __main_~i~1#1 <= 2147483647;__main_~i~1#1 := 1 + __main_~i~1#1;call write~int#8((if __main_~ch~0#1 % 256 <= 127 then __main_~ch~0#1 % 256 else __main_~ch~0#1 % 256 - 256), __main_~line~0#1.base, 4 + __main_~line~0#1.offset + __main_~tmp_post$2~0#1, 1); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: assume !(1 + __main_~i~1#1 <= 2147483647); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3047-1: SUMMARY for call xzalloc_#t~ret235#1.base, xzalloc_#t~ret235#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume 0 == xstrtou_range_sfx_#t~mem230#1;havoc xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset;havoc xstrtou_range_sfx_#t~mem230#1; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: assume !(0 == xstrtou_range_sfx_#t~mem230#1);havoc xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset;havoc xstrtou_range_sfx_#t~mem230#1; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3047: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret235#1.base, xzalloc_#t~ret235#1.offset;havoc xzalloc_#t~ret235#1.base, xzalloc_#t~ret235#1.offset; [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014-1: call xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset := read~$Pointer$#5(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem230#1 := read~int#8(xstrtou_range_sfx_#t~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset, 1); [2025-02-08 13:29:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3048: havoc xzalloc_#t~memset~res236#1.base, xzalloc_#t~memset~res236#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:07,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3048-1: SUMMARY for call xzalloc_#t~memset~res236#1.base, xzalloc_#t~memset~res236#1.offset := #Ultimate.C_memset#8(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751: assume !(getopt32_#t~mem175#1.base == 0 && getopt32_#t~mem175#1.offset == 0);havoc getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset;call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#8(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset, 8); [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2751: assume !!(getopt32_#t~mem175#1.base == 0 && getopt32_#t~mem175#1.offset == 0);havoc getopt32_#t~mem175#1.base, getopt32_#t~mem175#1.offset; [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2983-1: assume xstrtou_range_sfx_#t~mem219#1 - 9 >= -2147483648; [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2983-1: assume !(xstrtou_range_sfx_#t~mem219#1 - 9 >= -2147483648); [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2983: assume xstrtou_range_sfx_#t~mem219#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem219#1 - 9;havoc xstrtou_range_sfx_#t~mem219#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2983: assume !(xstrtou_range_sfx_#t~mem219#1 - 9 <= 2147483647); [2025-02-08 13:29:07,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume !(10 == __main_~ch~0#1); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume !!(10 == __main_~ch~0#1);havoc __main_~return_value_xrealloc$3~0#1.base, __main_~return_value_xrealloc$3~0#1.offset; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3018: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: assume -1 == __main_~ch~0#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2886: assume !(-1 == __main_~ch~0#1); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-1: assume true; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2721-1: assume !true; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3052: havoc _IO_getc_#t~nondet237#1;__main_#t~ret198#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet237#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 <= __main_#t~ret198#1 && __main_#t~ret198#1 <= 2147483647;__main_~ch~0#1 := __main_#t~ret198#1;havoc __main_#t~ret198#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3020: 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:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3020: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2888: assume !(0 == __main_~i~1#1); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2888: assume !!(0 == __main_~i~1#1); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2988: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256;call xstrtou_range_sfx_#t~mem220#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem220#1;havoc xstrtou_range_sfx_#t~mem220#1;call write~int#10(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~nondet41#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~nondet41#1;havoc bb_strtoui_#t~nondet41#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2988: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~1#1 % 256); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: assume -1 == getopt32_~c~0#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: 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:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858-1: assume !(__main_~name~0#1.base == __main_~argv#1.base && __main_~name~0#1.offset == __main_~argv#1.offset); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858-1: assume !!(__main_~name~0#1.base == __main_~argv#1.base && __main_~name~0#1.offset == __main_~argv#1.offset); [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc __main_~ch~0#1, __main_~i~1#1; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int#10(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:29:07,791 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025-1: SUMMARY for call bb_error_msg_and_die(11, 0, xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset); srcloc: null [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: xstrtou_range_sfx_#t~ret221#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet41#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~ret221#1;havoc xstrtou_range_sfx_#t~ret221#1;call xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset := read~$Pointer$#5(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025: havoc xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset; [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3025-2: call xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#18(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset, 8);call write~int#18(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs231#1.base, 8 + xstrtou_range_sfx_#t~varargs231#1.offset, 8);call write~int#18(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs231#1.base, 16 + xstrtou_range_sfx_#t~varargs231#1.offset, 8); [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: assume true;call getopt32_#t~mem152#1 := read~int#15(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: assume !true; [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728-2: assume !!((if getopt32_#t~mem152#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem152#1 % 256 % 4294967296 else getopt32_#t~mem152#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem152#1; [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728-2: assume !((if getopt32_#t~mem152#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem152#1 % 256 % 4294967296 else getopt32_#t~mem152#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem152#1;call getopt32_#t~mem153#1 := read~int#15(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem222#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem222#1.offset);havoc xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset;call xstrtou_range_sfx_#t~mem223#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem222#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem222#1.offset);havoc xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset; [2025-02-08 13:29:07,792 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: xatoi_positive_#t~ret210#1 := xatou_range_#res#1;havoc xatou_range_#t~ret211#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~ret210#1;havoc xatoi_positive_#t~ret210#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:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: assume 0 == (if getopt32_#t~mem153#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem153#1 % 256 % 4294967296 else getopt32_#t~mem153#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem153#1; [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2729: assume !(0 == (if getopt32_#t~mem153#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem153#1 % 256 % 4294967296 else getopt32_#t~mem153#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem153#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:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: assume 0 == xstrtou_range_sfx_#t~mem223#1;havoc xstrtou_range_sfx_#t~mem223#1;call write~int#10(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: assume !(0 == xstrtou_range_sfx_#t~mem223#1);havoc xstrtou_range_sfx_#t~mem223#1; [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2863: __main_#t~ret197#1.base, __main_#t~ret197#1.offset := fopen_or_warn_stdin_#res#1.base, fopen_or_warn_stdin_#res#1.offset;havoc fopen_or_warn_stdin_#t~mem71#1, fopen_or_warn_stdin_#t~mem72#1, fopen_or_warn_stdin_#t~ret73#1.base, fopen_or_warn_stdin_#t~ret73#1.offset, fopen_or_warn_stdin_~filename#1.base, fopen_or_warn_stdin_~filename#1.offset, fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset, fopen_or_warn_stdin_~tmp_if_expr$1~0#1;havoc fopen_or_warn_stdin_#in~filename#1.base, fopen_or_warn_stdin_#in~filename#1.offset;assume { :end_inline_fopen_or_warn_stdin } true;__main_~f~0#1.base, __main_~f~0#1.offset := __main_#t~ret197#1.base, __main_#t~ret197#1.offset;havoc __main_#t~mem196#1.base, __main_#t~mem196#1.offset;havoc __main_#t~ret197#1.base, __main_#t~ret197#1.offset; [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-1: [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: assume 0 != getopt32_#t~bitwise155#1 % 4294967296;havoc getopt32_#t~mem154#1;havoc getopt32_#t~bitwise155#1; [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: assume !(0 != getopt32_#t~bitwise155#1 % 4294967296);havoc getopt32_#t~mem154#1;havoc getopt32_#t~bitwise155#1;call getopt32_#t~mem156#1 := read~int#15(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem157#1 := read~int#15(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-3: assume getopt32_#t~mem154#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise155#1 := getopt32_#t~mem154#1; [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-3: assume !(getopt32_#t~mem154#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:07,793 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-2: havoc getopt32_#t~bitwise155#1;assume getopt32_#t~bitwise155#1 % 4294967296 <= getopt32_#t~mem154#1 % 4294967296 && getopt32_#t~bitwise155#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-5: call getopt32_#t~mem154#1 := read~int#15(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-4: assume 0 == getopt32_#t~mem154#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise155#1 := 0; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731-4: assume !(0 == getopt32_#t~mem154#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897-1: SUMMARY for call __main_#t~ret200#1.base, __main_#t~ret200#1.offset := xrealloc(__main_~line~0#1.base, __main_~line~0#1.offset, 4 + __main_~i~1#1); srcloc: null [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2864: assume __main_~f~0#1.base == 0 && __main_~f~0#1.offset == 0;__main_~retval~0#1 := 1; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2864: assume !(__main_~f~0#1.base == 0 && __main_~f~0#1.offset == 0);__main_~i~1#1 := 0;call write~int#10(__main_~i~1#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: __main_~return_value_xrealloc$3~0#1.base, __main_~return_value_xrealloc$3~0#1.offset := __main_#t~ret200#1.base, __main_#t~ret200#1.offset;havoc __main_#t~ret200#1.base, __main_#t~ret200#1.offset;__main_~line~0#1.base, __main_~line~0#1.offset := __main_~return_value_xrealloc$3~0#1.base, __main_~return_value_xrealloc$3~0#1.offset;call write~int#8(__main_~i~1#1, __main_~line~0#1.base, __main_~line~0#1.offset, 4);assume { :begin_inline_llist_add_to } true;llist_add_to_#in~old_head#1.base, llist_add_to_#in~old_head#1.offset, llist_add_to_#in~data#1.base, llist_add_to_#in~data#1.offset := __main_~#list~0#1.base, __main_~#list~0#1.offset, __main_~line~0#1.base, __main_~line~0#1.offset;havoc llist_add_to_#t~ret184#1.base, llist_add_to_#t~ret184#1.offset, llist_add_to_#t~mem185#1.base, llist_add_to_#t~mem185#1.offset, llist_add_to_~old_head#1.base, llist_add_to_~old_head#1.offset, llist_add_to_~data#1.base, llist_add_to_~data#1.offset, llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset, llist_add_to_~return_value_xmalloc$1~0#1.base, llist_add_to_~return_value_xmalloc$1~0#1.offset;llist_add_to_~old_head#1.base, llist_add_to_~old_head#1.offset := llist_add_to_#in~old_head#1.base, llist_add_to_#in~old_head#1.offset;llist_add_to_~data#1.base, llist_add_to_~data#1.offset := llist_add_to_#in~data#1.base, llist_add_to_#in~data#1.offset;havoc llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset;havoc llist_add_to_~return_value_xmalloc$1~0#1.base, llist_add_to_~return_value_xmalloc$1~0#1.offset; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2402: 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:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-1: [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733: getopt32_~trigger~0#1 := getopt32_#t~bitwise158#1;havoc getopt32_#t~mem156#1;havoc getopt32_#t~mem157#1;havoc getopt32_#t~bitwise158#1;call getopt32_#t~mem159#1 := read~int#15(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-3: assume getopt32_#t~mem156#1 % 4294967296 == getopt32_#t~mem157#1 % 4294967296;getopt32_#t~bitwise158#1 := getopt32_#t~mem156#1; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-3: assume !(getopt32_#t~mem156#1 % 4294967296 == getopt32_#t~mem157#1 % 4294967296); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-2: havoc getopt32_#t~bitwise158#1;assume getopt32_#t~bitwise158#1 % 4294967296 <= getopt32_#t~mem156#1 % 4294967296 && getopt32_#t~bitwise158#1 % 4294967296 <= getopt32_#t~mem157#1 % 4294967296; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-4: assume 0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_#t~mem157#1 % 4294967296;getopt32_#t~bitwise158#1 := 0; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2733-4: assume !(0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_#t~mem157#1 % 4294967296); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2998: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734: getopt32_~flags~0#1 := getopt32_#t~bitwise161#1;havoc getopt32_#t~mem159#1;havoc getopt32_#t~bitwise160#1;havoc getopt32_#t~bitwise161#1;call getopt32_#t~mem162#1 := read~int#15(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-2: havoc getopt32_#t~bitwise161#1;assume getopt32_#t~bitwise161#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise161#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise160#1) % 4294967296; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-1: [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise160#1) % 4294967296;getopt32_#t~bitwise161#1 := 0; [2025-02-08 13:29:07,794 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise160#1) % 4294967296); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise160#1) % 4294967296;getopt32_#t~bitwise161#1 := getopt32_~flags~0#1; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise160#1) % 4294967296); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-6: havoc getopt32_#t~bitwise160#1;assume getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem159#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-5: [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_#t~mem159#1; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-7: assume getopt32_#t~mem159#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise160#1 := 0; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-7: assume !(getopt32_#t~mem159#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-9: assume 0 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734-9: assume !(0 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032: havoc xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#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~ret211#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem217#1, xstrtou_range_sfx_#t~mem218#1, xstrtou_range_sfx_#t~mem219#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem220#1, xstrtou_range_sfx_#t~ret221#1, xstrtou_range_sfx_#t~mem222#1.base, xstrtou_range_sfx_#t~mem222#1.offset, xstrtou_range_sfx_#t~mem223#1, xstrtou_range_sfx_#t~mem224#1, xstrtou_range_sfx_#t~mem225#1.base, xstrtou_range_sfx_#t~mem225#1.offset, xstrtou_range_sfx_#t~nondet226#1, xstrtou_range_sfx_#t~mem227#1, xstrtou_range_sfx_#t~mem228#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~mem229#1.base, xstrtou_range_sfx_#t~mem229#1.offset, xstrtou_range_sfx_#t~mem230#1, xstrtou_range_sfx_#t~varargs231#1.base, xstrtou_range_sfx_#t~varargs231#1.offset, xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#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~1#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret211#1;havoc xatou_range_#t~ret211#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032-2: call xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#18(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#1.offset, 8); [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2999-1: assume !(0 == xstrtou_range_sfx_#t~mem224#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem224#1; [2025-02-08 13:29:07,795 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2999-1: assume !!(0 == xstrtou_range_sfx_#t~mem224#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem224#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3032-1: SUMMARY for call bb_error_msg_and_die(12, 0, xstrtou_range_sfx_#t~varargs232#1.base, xstrtou_range_sfx_#t~varargs232#1.offset); srcloc: null [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2999: assume true;call xstrtou_range_sfx_#t~mem224#1 := read~int#2(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2999: assume !true; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-1: [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735: getopt32_~flags~0#1 := getopt32_#t~bitwise164#1;havoc getopt32_#t~mem162#1;havoc getopt32_#t~bitwise163#1;havoc getopt32_#t~bitwise164#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-3: assume 0 == getopt32_#t~bitwise163#1 % 4294967296;getopt32_#t~bitwise164#1 := getopt32_~flags~0#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-3: assume !(0 == getopt32_#t~bitwise163#1 % 4294967296); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-2: havoc getopt32_#t~bitwise164#1;assume (getopt32_#t~bitwise164#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise164#1 % 4294967296 >= getopt32_#t~bitwise163#1 % 4294967296) && getopt32_#t~bitwise164#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise163#1 % 4294967296; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-5: [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise163#1 % 4294967296;getopt32_#t~bitwise164#1 := getopt32_#t~bitwise163#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise163#1 % 4294967296); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-7: assume getopt32_#t~mem162#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-7: assume !(getopt32_#t~mem162#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-6: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_#t~mem162#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-9: assume 0 == getopt32_#t~mem162#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-9: assume !(0 == getopt32_#t~mem162#1 % 4294967296); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise163#1 := getopt32_#t~mem162#1; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2735-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802: llist_add_to_~return_value_xmalloc$1~0#1.base, llist_add_to_~return_value_xmalloc$1~0#1.offset := llist_add_to_#t~ret184#1.base, llist_add_to_#t~ret184#1.offset;havoc llist_add_to_#t~ret184#1.base, llist_add_to_#t~ret184#1.offset;llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset := llist_add_to_~return_value_xmalloc$1~0#1.base, llist_add_to_~return_value_xmalloc$1~0#1.offset;call write~$Pointer$#8(llist_add_to_~data#1.base, llist_add_to_~data#1.offset, llist_add_to_~new_head~0#1.base, 8 + llist_add_to_~new_head~0#1.offset, 8);call llist_add_to_#t~mem185#1.base, llist_add_to_#t~mem185#1.offset := read~$Pointer$#4(llist_add_to_~old_head#1.base, llist_add_to_~old_head#1.offset, 8);call write~$Pointer$#8(llist_add_to_#t~mem185#1.base, llist_add_to_#t~mem185#1.offset, llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset, 8);havoc llist_add_to_#t~mem185#1.base, llist_add_to_#t~mem185#1.offset;call write~$Pointer$#4(llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset, llist_add_to_~old_head#1.base, llist_add_to_~old_head#1.offset, 8);havoc llist_add_to_#t~ret184#1.base, llist_add_to_#t~ret184#1.offset, llist_add_to_#t~mem185#1.base, llist_add_to_#t~mem185#1.offset, llist_add_to_~old_head#1.base, llist_add_to_~old_head#1.offset, llist_add_to_~data#1.base, llist_add_to_~data#1.offset, llist_add_to_~new_head~0#1.base, llist_add_to_~new_head~0#1.offset, llist_add_to_~return_value_xmalloc$1~0#1.base, llist_add_to_~return_value_xmalloc$1~0#1.offset;havoc llist_add_to_#in~old_head#1.base, llist_add_to_#in~old_head#1.offset, llist_add_to_#in~data#1.base, llist_add_to_#in~data#1.offset;assume { :end_inline_llist_add_to } true;__main_~line~0#1.base, __main_~line~0#1.offset := 0, 0;__main_~i~1#1 := 0;havoc __main_~return_value_xrealloc$3~0#1.base, __main_~return_value_xrealloc$3~0#1.offset; [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736: getopt32_~flags~0#1 := getopt32_#t~bitwise165#1;havoc getopt32_#t~bitwise165#1;call getopt32_#t~mem166#1.base, getopt32_#t~mem166#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:07,796 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802-1: SUMMARY for call llist_add_to_#t~ret184#1.base, llist_add_to_#t~ret184#1.offset := xmalloc(16); srcloc: null [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-2: havoc getopt32_#t~bitwise165#1;assume getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-1: [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_~flags~0#1; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := 0; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3001: 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~mem225#1.base, xstrtou_range_sfx_#t~mem225#1.offset := read~$Pointer$#5(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~nondet226#1;havoc xstrtou_range_sfx_#t~mem225#1.base, xstrtou_range_sfx_#t~mem225#1.offset;havoc xstrtou_range_sfx_#t~nondet226#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:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: assume !(getopt32_#t~mem166#1.base == 0 && getopt32_#t~mem166#1.offset == 0);havoc getopt32_#t~mem166#1.base, getopt32_#t~mem166#1.offset;call getopt32_#t~mem167#1.base, getopt32_#t~mem167#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset := read~$Pointer$#15(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem169#1 := read~int#8(getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset, 4); [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: assume !!(getopt32_#t~mem166#1.base == 0 && getopt32_#t~mem166#1.offset == 0);havoc getopt32_#t~mem166#1.base, getopt32_#t~mem166#1.offset; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume true;assume { :begin_inline__IO_getc } true;_IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset := __main_~f~0#1.base, __main_~f~0#1.offset;havoc _IO_getc_#res#1;havoc _IO_getc_#t~nondet237#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;_IO_getc_~stream#1.base, _IO_getc_~stream#1.offset := _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume -2147483648 <= _IO_getc_#t~nondet237#1 && _IO_getc_#t~nondet237#1 <= 2147483647;_IO_getc_#res#1 := _IO_getc_#t~nondet237#1;havoc _IO_getc_#t~nondet237#1; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume !true; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870-1: assume -1 != __main_~ch~0#1; [2025-02-08 13:29:07,797 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870-1: assume !(-1 != __main_~ch~0#1); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: assume 1 + getopt32_#t~mem169#1 <= 2147483647;call write~int#8(1 + getopt32_#t~mem169#1, getopt32_#t~mem167#1.base, getopt32_#t~mem167#1.offset, 4); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738: assume !(1 + getopt32_#t~mem169#1 <= 2147483647); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: assume 1 + getopt32_#t~mem169#1 >= -2147483648; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2738-1: assume !(1 + getopt32_#t~mem169#1 >= -2147483648); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: fopen_or_warn_stdin_#t~ret73#1.base, fopen_or_warn_stdin_#t~ret73#1.offset := fopen_or_warn_#res#1.base, fopen_or_warn_#res#1.offset;havoc fopen_or_warn_#t~nondet70#1.base, fopen_or_warn_#t~nondet70#1.offset, fopen_or_warn_~path#1.base, fopen_or_warn_~path#1.offset, fopen_or_warn_~mode#1.base, fopen_or_warn_~mode#1.offset, fopen_or_warn_~fp~0#1.base, fopen_or_warn_~fp~0#1.offset;havoc fopen_or_warn_#in~path#1.base, fopen_or_warn_#in~path#1.offset, fopen_or_warn_#in~mode#1.base, fopen_or_warn_#in~mode#1.offset;assume { :end_inline_fopen_or_warn } true;fopen_or_warn_stdin_~fp~1#1.base, fopen_or_warn_stdin_~fp~1#1.offset := fopen_or_warn_stdin_#t~ret73#1.base, fopen_or_warn_stdin_#t~ret73#1.offset; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem170#1 := read~int#15(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3103: havoc getopt_long_#t~ret266#1;getopt32_#t~ret151#1 := getopt_long_#res#1;havoc getopt_long_#t~mem262#1.base, getopt_long_#t~mem262#1.offset, getopt_long_#t~mem263#1, getopt_long_#t~mem264#1.base, getopt_long_#t~mem264#1.offset, getopt_long_#t~mem265#1, getopt_long_#t~ret266#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~ret151#1 && getopt32_#t~ret151#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret151#1;havoc getopt32_#t~ret151#1; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3103-2: getopt_long_#t~ret266#1 := getopt_#res#1;havoc getopt_#t~mem246#1.base, getopt_#t~mem246#1.offset, getopt_#t~mem247#1, getopt_#t~short248#1, getopt_#t~nondet249#1, getopt_#t~nondet250#1, getopt_#t~mem251#1, getopt_#t~short252#1, getopt_#t~nondet253#1, getopt_#t~mem254#1, getopt_#t~nondet255#1, getopt_#t~pre256#1, getopt_#t~mem257#1, getopt_#t~short258#1, getopt_#t~nondet259#1, getopt_#t~mem260#1.base, getopt_#t~mem260#1.offset, getopt_#t~pre261#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~ret266#1 && getopt_long_#t~ret266#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret266#1;havoc getopt_long_#t~ret266#1; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906: assume !(0 == __main_#t~mem201#1);havoc __main_#t~mem201#1;call __main_#t~mem202#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906: assume !!(0 == __main_#t~mem201#1);havoc __main_#t~mem201#1; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: call ULTIMATE.dealloc(__main_~#list~0#1.base, __main_~#list~0#1.offset);havoc __main_~#list~0#1.base, __main_~#list~0#1.offset; [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2906-1: call __main_#t~mem201#1 := read~int#10(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2873: assume !(-1 == __main_~ch~0#1); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2873: assume !!(-1 == __main_~ch~0#1); [2025-02-08 13:29:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume 1 == getopt32_#t~mem170#1;havoc getopt32_#t~mem170#1;call getopt32_#t~mem171#1.base, getopt32_#t~mem171#1.offset := read~$Pointer$#15(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~mem171#1.base, getopt32_#t~mem171#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:07,798 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: assume !(1 == getopt32_#t~mem170#1);havoc getopt32_#t~mem170#1;call getopt32_#t~mem172#1 := read~int#15(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem227#1 := read~int#2(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3006: 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:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2973: assume 45 == xstrtou_range_sfx_#t~mem217#1;havoc xstrtou_range_sfx_#t~mem217#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2973: assume !(45 == xstrtou_range_sfx_#t~mem217#1);havoc xstrtou_range_sfx_#t~mem217#1;call xstrtou_range_sfx_#t~mem218#1 := read~int#8(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~mem218#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908: assume !(2 == __main_#t~mem202#1);havoc __main_#t~mem202#1;call __main_#t~mem203#1.base, __main_#t~mem203#1.offset := read~$Pointer$#9(__main_~name~0#1.base, __main_~name~0#1.offset, 8); [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2908: assume !!(2 == __main_#t~mem202#1);havoc __main_#t~mem202#1; [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume 0 == __main_~i~1#1 % 128; [2025-02-08 13:29:07,799 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume !(0 == __main_~i~1#1 % 128); [2025-02-08 13:29:07,941 INFO L? ?]: Removed 614 outVars from TransFormulas that were not future-live. [2025-02-08 13:29:07,942 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:29:07,965 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:29:07,965 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:29:07,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:07 BoogieIcfgContainer [2025-02-08 13:29:07,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:29:07,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:29:07,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:29:07,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:29:07,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:00" (1/3) ... [2025-02-08 13:29:07,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d30ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:07, skipping insertion in model container [2025-02-08 13:29:07,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:01" (2/3) ... [2025-02-08 13:29:07,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4d30ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:07, skipping insertion in model container [2025-02-08 13:29:07,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:07" (3/3) ... [2025-02-08 13:29:07,972 INFO L128 eAbstractionObserver]: Analyzing ICFG tac-1.i [2025-02-08 13:29:07,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:29:07,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tac-1.i that has 65 procedures, 630 locations, 1 initial locations, 69 loop locations, and 64 error locations. [2025-02-08 13:29:08,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:29:08,030 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;@2b6270fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:29:08,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2025-02-08 13:29:08,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 416 states, 311 states have (on average 1.6784565916398715) internal successors, (522), 389 states have internal predecessors, (522), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-08 13:29:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:29:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:08,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:29:08,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:08,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1176673, now seen corresponding path program 1 times [2025-02-08 13:29:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344691058] [2025-02-08 13:29:08,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:29:08,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:29:08,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:08,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:08,745 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:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344691058] [2025-02-08 13:29:08,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344691058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:08,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:08,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:29:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609257504] [2025-02-08 13:29:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:08,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:08,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:08,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:08,763 INFO L87 Difference]: Start difference. First operand has 416 states, 311 states have (on average 1.6784565916398715) internal successors, (522), 389 states have internal predecessors, (522), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:08,830 INFO L93 Difference]: Finished difference Result 624 states and 847 transitions. [2025-02-08 13:29:08,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:08,832 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:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:08,837 INFO L225 Difference]: With dead ends: 624 [2025-02-08 13:29:08,837 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:29:08,840 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:08,842 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:08,842 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:08,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:29:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:29:08,871 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:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:29:08,879 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 3 [2025-02-08 13:29:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:08,879 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:29:08,880 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:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:29:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:29:08,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:08,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:29:08,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:29:08,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:08,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:08,880 INFO L85 PathProgramCache]: Analyzing trace with hash 695639261, now seen corresponding path program 1 times [2025-02-08 13:29:08,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:08,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721046818] [2025-02-08 13:29:08,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:08,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:09,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:09,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:09,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:09,237 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:09,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721046818] [2025-02-08 13:29:09,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721046818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:09,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508388491] [2025-02-08 13:29:09,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:09,240 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:09,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 13:29:09,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:09,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:09,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:09,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:09,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:09,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:29:09,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:29:09,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508388491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:09,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:29:09,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:29:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983886827] [2025-02-08 13:29:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:09,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:29:09,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:09,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:29:09,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:09,864 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:29:12,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:12,827 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-08 13:29:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:29:12,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:29:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:12,829 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:29:12,829 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:29:12,830 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:29:12,830 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:12,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 13:29:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:29:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:29:12,837 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:29:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:29:12,838 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 6 [2025-02-08 13:29:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:12,838 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:29:12,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:29:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:29:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:29:12,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:12,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:29:12,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:29:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:13,040 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:13,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 89981731, now seen corresponding path program 1 times [2025-02-08 13:29:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:13,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702286653] [2025-02-08 13:29:13,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:13,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:29:13,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:29:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:13,337 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:29:13,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:13,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702286653] [2025-02-08 13:29:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702286653] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:29:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028913498] [2025-02-08 13:29:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:13,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:13,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:13,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:13,339 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:29:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:13,374 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:29:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:13,374 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:29:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:13,375 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:29:13,375 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:29:13,375 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:29:13,376 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:29:13,376 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:29:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:29:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:29:13,381 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:29:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:29:13,382 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 7 [2025-02-08 13:29:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:13,382 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:29:13,382 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:29:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:29:13,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:29:13,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:13,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:29:13,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1034622136, now seen corresponding path program 1 times [2025-02-08 13:29:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870617486] [2025-02-08 13:29:13,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:13,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:29:13,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:29:13,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:13,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:13,790 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:29:13,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:13,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870617486] [2025-02-08 13:29:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870617486] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:13,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967354682] [2025-02-08 13:29:13,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:13,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:13,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:13,793 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:29:13,794 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:29:14,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:29:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:29:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:14,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1315 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:29:14,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:14,361 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:29:14,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:29:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967354682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:14,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:29:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:29:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65205079] [2025-02-08 13:29:14,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:14,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:14,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:14,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:14,363 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:29:18,379 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:29:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:18,445 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:29:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:18,445 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:29:18,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:18,446 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:29:18,446 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:29:18,447 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:29:18,447 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:29:18,447 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:29:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:29:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:29:18,461 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:29:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:29:18,462 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 11 [2025-02-08 13:29:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:29:18,464 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:29:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:29:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:29:18,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:18,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:18,482 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:29:18,665 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:29:18,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:18,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2008516258, now seen corresponding path program 1 times [2025-02-08 13:29:18,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:18,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011672300] [2025-02-08 13:29:18,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:18,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:29:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:29:18,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:18,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:19,025 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:29:19,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011672300] [2025-02-08 13:29:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011672300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51937690] [2025-02-08 13:29:19,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:19,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:19,028 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:29:19,030 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:29:19,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:29:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:29:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:19,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1316 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:19,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:19,604 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:29:19,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:19,645 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:29:19,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51937690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:19,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:19,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:29:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702810667] [2025-02-08 13:29:19,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:19,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:29:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:19,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:29:19,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:29:19,647 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:29:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:19,714 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2025-02-08 13:29:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:19,714 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:29:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:19,715 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:29:19,715 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:29:19,716 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:29:19,717 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:19,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 695 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:29:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:29:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:29:19,726 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:29:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2025-02-08 13:29:19,729 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 12 [2025-02-08 13:29:19,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:19,729 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2025-02-08 13:29:19,729 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:29:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2025-02-08 13:29:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:29:19,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:19,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:19,742 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:29:19,930 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:29:19,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:19,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash 975194150, now seen corresponding path program 2 times [2025-02-08 13:29:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:19,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995718032] [2025-02-08 13:29:19,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:29:19,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:20,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:29:20,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:29:20,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:29:20,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:20,354 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:29:20,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995718032] [2025-02-08 13:29:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995718032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:20,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:20,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:29:20,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377186494] [2025-02-08 13:29:20,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:20,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:29:20,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:20,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:29:20,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:20,356 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:29:24,374 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:29:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:24,522 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-02-08 13:29:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:29:24,522 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:29:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:24,523 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:29:24,523 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:29:24,523 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:29:24,524 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:29:24,524 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:29:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:29:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:29:24,530 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:29:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 13:29:24,531 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 21 [2025-02-08 13:29:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:24,531 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 13:29:24,531 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:29:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2025-02-08 13:29:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:29:24,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:24,532 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:29:24,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:29:24,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:24,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1994676591, now seen corresponding path program 1 times [2025-02-08 13:29:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058836224] [2025-02-08 13:29:24,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:24,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:29:24,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:29:24,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:24,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:24,892 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:29:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:24,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058836224] [2025-02-08 13:29:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058836224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:24,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:29:24,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746821918] [2025-02-08 13:29:24,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:24,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:24,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:24,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:24,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:24,893 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:28,911 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:29:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:28,974 INFO L93 Difference]: Finished difference Result 384 states and 481 transitions. [2025-02-08 13:29:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:28,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:29:28,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:28,975 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:29:28,976 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:29:28,976 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:29:28,976 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 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:29:28,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 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:29:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:29:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:29:28,985 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:29:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-02-08 13:29:28,987 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 26 [2025-02-08 13:29:28,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:28,987 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-02-08 13:29:28,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:29:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-02-08 13:29:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:29:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:28,989 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:29:28,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:29:28,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1705093664, now seen corresponding path program 1 times [2025-02-08 13:29:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758474044] [2025-02-08 13:29:28,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:29,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:29:29,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:29:29,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:29,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:29,287 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:29:29,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:29,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758474044] [2025-02-08 13:29:29,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758474044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:29,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:29,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:29:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098610680] [2025-02-08 13:29:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:29,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:29,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:29,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:29,289 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:29:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:29,330 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2025-02-08 13:29:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:29,331 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:29:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:29,333 INFO L225 Difference]: With dead ends: 320 [2025-02-08 13:29:29,333 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 13:29:29,334 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:29:29,334 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:29:29,335 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:29:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 13:29:29,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2025-02-08 13:29:29,342 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:29:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-08 13:29:29,343 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 27 [2025-02-08 13:29:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:29,344 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-08 13:29:29,344 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:29:29,344 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-08 13:29:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:29:29,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:29,344 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:29:29,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:29:29,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:29,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:29,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1756088577, now seen corresponding path program 1 times [2025-02-08 13:29:29,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:29,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697086321] [2025-02-08 13:29:29,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:29,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:29,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:29:29,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:29:29,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:29,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:29,658 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:29:29,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697086321] [2025-02-08 13:29:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697086321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:29,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313638792] [2025-02-08 13:29:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:29,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:29,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:29,661 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:29:29,663 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:29:30,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:29:30,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:29:30,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:30,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:30,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:29:30,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:30,399 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:29:30,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:30,509 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:29:30,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313638792] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:30,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:30,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:29:30,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047419014] [2025-02-08 13:29:30,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:30,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:29:30,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:30,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:29:30,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:29:30,510 INFO L87 Difference]: Start difference. First operand 207 states and 256 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:29:33,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:36,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:36,663 INFO L93 Difference]: Finished difference Result 417 states and 521 transitions. [2025-02-08 13:29:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:29:36,663 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:29:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:36,664 INFO L225 Difference]: With dead ends: 417 [2025-02-08 13:29:36,664 INFO L226 Difference]: Without dead ends: 224 [2025-02-08 13:29:36,664 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:29:36,665 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 5 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:36,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1340 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-08 13:29:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-08 13:29:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-08 13:29:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 210 states have internal predecessors, (258), 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:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 273 transitions. [2025-02-08 13:29:36,671 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 273 transitions. Word has length 29 [2025-02-08 13:29:36,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:36,671 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 273 transitions. [2025-02-08 13:29:36,671 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:29:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 273 transitions. [2025-02-08 13:29:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:29:36,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:36,672 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:36,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:29:36,872 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:29:36,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:36,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 74731999, now seen corresponding path program 1 times [2025-02-08 13:29:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:36,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252676875] [2025-02-08 13:29:36,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:37,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:29:37,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:29:37,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:37,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:37,162 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:29:37,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252676875] [2025-02-08 13:29:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252676875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:37,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:29:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229107329] [2025-02-08 13:29:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:37,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:37,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:37,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:37,164 INFO L87 Difference]: Start difference. First operand 224 states and 273 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:29:41,181 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:29:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:41,262 INFO L93 Difference]: Finished difference Result 236 states and 287 transitions. [2025-02-08 13:29:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:41,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:29:41,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:41,263 INFO L225 Difference]: With dead ends: 236 [2025-02-08 13:29:41,263 INFO L226 Difference]: Without dead ends: 234 [2025-02-08 13:29:41,264 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:29:41,264 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 2 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:41,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 452 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:29:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-08 13:29:41,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-02-08 13:29:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.3989637305699483) internal successors, (270), 219 states have internal predecessors, (270), 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:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2025-02-08 13:29:41,270 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 47 [2025-02-08 13:29:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2025-02-08 13:29:41,271 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:29:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2025-02-08 13:29:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:29:41,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:41,272 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:29:41,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:29:41,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:41,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1978269263, now seen corresponding path program 1 times [2025-02-08 13:29:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616201521] [2025-02-08 13:29:41,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:41,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:29:41,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:29:41,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:41,558 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:29:41,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616201521] [2025-02-08 13:29:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616201521] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:41,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:41,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:29:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205667809] [2025-02-08 13:29:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:41,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:41,559 INFO L87 Difference]: Start difference. First operand 233 states and 285 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:29:44,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:29:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:44,403 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2025-02-08 13:29:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:44,403 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:29:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:44,405 INFO L225 Difference]: With dead ends: 233 [2025-02-08 13:29:44,405 INFO L226 Difference]: Without dead ends: 232 [2025-02-08 13:29:44,405 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:29:44,406 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:44,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 13:29:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-08 13:29:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 228. [2025-02-08 13:29:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 214 states have internal predecessors, (264), 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:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 279 transitions. [2025-02-08 13:29:44,419 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 279 transitions. Word has length 48 [2025-02-08 13:29:44,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:44,420 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 279 transitions. [2025-02-08 13:29:44,422 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:29:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2025-02-08 13:29:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:29:44,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:44,422 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:29:44,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:29:44,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:44,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1308168924, now seen corresponding path program 1 times [2025-02-08 13:29:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:44,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318225738] [2025-02-08 13:29:44,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:44,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:29:44,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:29:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:44,779 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:29:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318225738] [2025-02-08 13:29:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318225738] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790561947] [2025-02-08 13:29:44,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:44,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:44,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:44,785 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:29:44,786 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:29:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:29:45,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:29:45,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:45,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:45,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:45,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:45,541 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:29:45,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:29:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790561947] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:45,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:29:45,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:29:45,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127580613] [2025-02-08 13:29:45,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:45,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:29:45,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:45,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:29:45,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:45,545 INFO L87 Difference]: Start difference. First operand 228 states and 279 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:29:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:45,605 INFO L93 Difference]: Finished difference Result 339 states and 427 transitions. [2025-02-08 13:29:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:29:45,605 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:29:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:45,608 INFO L225 Difference]: With dead ends: 339 [2025-02-08 13:29:45,608 INFO L226 Difference]: Without dead ends: 338 [2025-02-08 13:29:45,608 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:29:45,609 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 279 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:45,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 597 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:29:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-08 13:29:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 227. [2025-02-08 13:29:45,618 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:29:45,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2025-02-08 13:29:45,620 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 49 [2025-02-08 13:29:45,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:45,620 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2025-02-08 13:29:45,620 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:29:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2025-02-08 13:29:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:29:45,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:45,622 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:29:45,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:29:45,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 13:29:45,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:45,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1898529890, now seen corresponding path program 1 times [2025-02-08 13:29:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595890709] [2025-02-08 13:29:45,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:45,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:29:45,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:29:45,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:45,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:46,118 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:29:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595890709] [2025-02-08 13:29:46,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595890709] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:46,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980495239] [2025-02-08 13:29:46,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:46,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:46,122 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:29:46,124 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:29:46,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:29:46,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:29:46,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:46,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 1634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:46,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:47,000 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:29:47,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:47,041 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:29:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980495239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:47,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:29:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858988736] [2025-02-08 13:29:47,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:47,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:29:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:47,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:29:47,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:29:47,042 INFO L87 Difference]: Start difference. First operand 227 states and 278 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:29:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:47,200 INFO L93 Difference]: Finished difference Result 684 states and 888 transitions. [2025-02-08 13:29:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:29:47,200 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:29:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:47,203 INFO L225 Difference]: With dead ends: 684 [2025-02-08 13:29:47,203 INFO L226 Difference]: Without dead ends: 683 [2025-02-08 13:29:47,203 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:29:47,204 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 837 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:29:47,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1116 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:29:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-08 13:29:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 239. [2025-02-08 13:29:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 225 states have internal predecessors, (278), 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:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 293 transitions. [2025-02-08 13:29:47,216 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 293 transitions. Word has length 50 [2025-02-08 13:29:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:47,217 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 293 transitions. [2025-02-08 13:29:47,217 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:29:47,217 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 293 transitions. [2025-02-08 13:29:47,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:29:47,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:47,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:29:47,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 13:29:47,418 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:29:47,418 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:29:47,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1228449031, now seen corresponding path program 1 times [2025-02-08 13:29:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975524350] [2025-02-08 13:29:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:47,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:29:47,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:29:47,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:47,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:29:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975524350] [2025-02-08 13:29:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975524350] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942459157] [2025-02-08 13:29:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:47,729 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:29:47,730 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:29:48,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:29:48,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:29:48,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:48,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:48,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:48,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:29:48,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:29:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:29:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942459157] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:29:48,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:29:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:29:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901701128] [2025-02-08 13:29:48,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:29:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:29:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:48,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:29:48,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:29:48,566 INFO L87 Difference]: Start difference. First operand 239 states and 293 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:29:52,589 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:29:56,609 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:00,628 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,641 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:07,599 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:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:07,707 INFO L93 Difference]: Finished difference Result 454 states and 564 transitions. [2025-02-08 13:30:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:07,707 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 54 [2025-02-08 13:30:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:07,708 INFO L225 Difference]: With dead ends: 454 [2025-02-08 13:30:07,708 INFO L226 Difference]: Without dead ends: 257 [2025-02-08 13:30:07,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 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:07,710 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 4 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:07,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 903 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 4 Unknown, 0 Unchecked, 19.1s Time] [2025-02-08 13:30:07,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-08 13:30:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-08 13:30:07,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 219 states have (on average 1.3515981735159817) internal successors, (296), 243 states have internal predecessors, (296), 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:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2025-02-08 13:30:07,721 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 54 [2025-02-08 13:30:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:07,721 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2025-02-08 13:30:07,721 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:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2025-02-08 13:30:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:30:07,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:07,721 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:07,736 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:07,922 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:07,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:30:07,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -921537629, now seen corresponding path program 1 times [2025-02-08 13:30:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922552072] [2025-02-08 13:30:07,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:08,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:30:08,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:30:08,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:08,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:08,588 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:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:08,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922552072] [2025-02-08 13:30:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922552072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 13:30:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929644235] [2025-02-08 13:30:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:08,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:08,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:08,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:08,589 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:12,607 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:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:12,727 INFO L93 Difference]: Finished difference Result 414 states and 509 transitions. [2025-02-08 13:30:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:12,730 INFO L225 Difference]: With dead ends: 414 [2025-02-08 13:30:12,731 INFO L226 Difference]: Without dead ends: 257 [2025-02-08 13:30:12,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:12,733 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 346 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:12,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 366 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-08 13:30:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-02-08 13:30:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 243 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:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 310 transitions. [2025-02-08 13:30:12,744 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 310 transitions. Word has length 59 [2025-02-08 13:30:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:12,745 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 310 transitions. [2025-02-08 13:30:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 310 transitions. [2025-02-08 13:30:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:30:12,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:12,745 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:12,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 13:30:12,746 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:30:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash 821272706, now seen corresponding path program 1 times [2025-02-08 13:30:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571811854] [2025-02-08 13:30:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:12,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:30:12,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:30:12,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:12,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:13,035 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:13,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571811854] [2025-02-08 13:30:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571811854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:13,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:13,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443480550] [2025-02-08 13:30:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:13,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:13,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:13,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:13,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:13,038 INFO L87 Difference]: Start difference. First operand 257 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:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:13,195 INFO L93 Difference]: Finished difference Result 504 states and 637 transitions. [2025-02-08 13:30:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:13,196 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:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:13,197 INFO L225 Difference]: With dead ends: 504 [2025-02-08 13:30:13,198 INFO L226 Difference]: Without dead ends: 350 [2025-02-08 13:30:13,198 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:13,199 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 112 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 421 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:13,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 421 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:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-08 13:30:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 299. [2025-02-08 13:30:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 284 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:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 367 transitions. [2025-02-08 13:30:13,210 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 367 transitions. Word has length 59 [2025-02-08 13:30:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:13,210 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 367 transitions. [2025-02-08 13:30:13,210 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:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 367 transitions. [2025-02-08 13:30:13,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:30:13,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:13,211 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:13,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:30:13,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:30:13,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:13,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1030877888, now seen corresponding path program 1 times [2025-02-08 13:30:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:13,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108843385] [2025-02-08 13:30:13,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:13,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:30:13,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:30:13,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:13,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:13,475 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:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108843385] [2025-02-08 13:30:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108843385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185441716] [2025-02-08 13:30:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:13,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:13,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:13,476 INFO L87 Difference]: Start difference. First operand 299 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:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:13,515 INFO L93 Difference]: Finished difference Result 301 states and 367 transitions. [2025-02-08 13:30:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:13,515 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:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:13,517 INFO L225 Difference]: With dead ends: 301 [2025-02-08 13:30:13,517 INFO L226 Difference]: Without dead ends: 299 [2025-02-08 13:30:13,517 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:13,517 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:13,517 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:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-08 13:30:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-08 13:30:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 260 states have (on average 1.3384615384615384) internal successors, (348), 284 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:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 365 transitions. [2025-02-08 13:30:13,526 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 365 transitions. Word has length 61 [2025-02-08 13:30:13,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:13,527 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 365 transitions. [2025-02-08 13:30:13,527 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:13,527 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2025-02-08 13:30:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:30:13,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:13,527 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:13,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:30:13,528 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:30:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash -934051182, now seen corresponding path program 2 times [2025-02-08 13:30:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016024151] [2025-02-08 13:30:13,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:13,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 13:30:13,752 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:13,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:13,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:13,962 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:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016024151] [2025-02-08 13:30:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016024151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:30:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116036406] [2025-02-08 13:30:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:13,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:30:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:13,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:30:13,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:13,963 INFO L87 Difference]: Start difference. First operand 299 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:30:17,985 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:21,993 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:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:22,206 INFO L93 Difference]: Finished difference Result 527 states and 653 transitions. [2025-02-08 13:30:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:22,207 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:30:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:22,212 INFO L225 Difference]: With dead ends: 527 [2025-02-08 13:30:22,213 INFO L226 Difference]: Without dead ends: 299 [2025-02-08 13:30:22,213 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:30:22,213 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 192 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 857 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 13:30:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-08 13:30:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-02-08 13:30:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 284 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:30:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 364 transitions. [2025-02-08 13:30:22,231 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 364 transitions. Word has length 62 [2025-02-08 13:30:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 364 transitions. [2025-02-08 13:30:22,232 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:30:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 364 transitions. [2025-02-08 13:30:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 13:30:22,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:22,233 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:22,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:30:22,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 61 more)] === [2025-02-08 13:30:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash -136824169, now seen corresponding path program 2 times [2025-02-08 13:30:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781695664] [2025-02-08 13:30:22,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:22,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-02-08 13:30:22,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 13:30:22,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:30:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-08 13:30:22,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:22,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781695664] [2025-02-08 13:30:22,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781695664] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:22,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428834659] [2025-02-08 13:30:22,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:22,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:22,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:22,812 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:22,813 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:23,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes.