./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/uniq-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/uniq-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 08565b92f9e1ab6a47cc07eab48e4ddba14d2beb0d6a637f829640714554b58e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:29:46,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:29:47,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-08 13:29:47,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:29:47,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:29:47,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:29:47,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:29:47,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:29:47,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:29:47,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:29:47,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:29:47,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:29:47,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:29:47,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:29:47,105 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:29:47,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:29:47,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:29:47,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:29:47,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:29:47,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:29:47,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:47,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:29:47,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:29:47,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:29:47,109 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 -> 08565b92f9e1ab6a47cc07eab48e4ddba14d2beb0d6a637f829640714554b58e [2025-02-08 13:29:47,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:29:47,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:29:47,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:29:47,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:29:47,387 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:29:47,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/uniq-1.i [2025-02-08 13:29:48,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01d52d05/4fd7364845314da1be9634408a96f0ad/FLAGcd62ec014 [2025-02-08 13:29:49,081 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:29:49,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/uniq-1.i [2025-02-08 13:29:49,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01d52d05/4fd7364845314da1be9634408a96f0ad/FLAGcd62ec014 [2025-02-08 13:29:49,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b01d52d05/4fd7364845314da1be9634408a96f0ad [2025-02-08 13:29:49,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:29:49,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:29:49,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:49,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:29:49,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:29:49,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:49" (1/1) ... [2025-02-08 13:29:49,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb47154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:49, skipping insertion in model container [2025-02-08 13:29:49,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:29:49" (1/1) ... [2025-02-08 13:29:49,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:29:50,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:50,096 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:29:50,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:29:50,370 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:29:50,378 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:29:50,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:50 WrapperNode [2025-02-08 13:29:50,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:29:50,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:50,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:29:50,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:29:50,385 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:50" (1/1) ... [2025-02-08 13:29:50,423 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:50" (1/1) ... [2025-02-08 13:29:50,492 INFO L138 Inliner]: procedures = 600, calls = 768, calls flagged for inlining = 31, calls inlined = 30, statements flattened = 2127 [2025-02-08 13:29:50,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:29:50,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:29:50,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:29:50,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:29:50,510 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:50" (1/1) ... [2025-02-08 13:29:50,510 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:50" (1/1) ... [2025-02-08 13:29:50,526 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:50" (1/1) ... [2025-02-08 13:29:50,586 INFO L175 MemorySlicer]: Split 633 memory accesses to 21 slices as follows [2, 33, 3, 15, 30, 44, 29, 11, 6, 13, 17, 17, 2, 17, 355, 7, 17, 3, 3, 3, 6]. 56 percent of accesses are in the largest equivalence class. The 368 initializations are split as follows [2, 0, 3, 0, 2, 0, 0, 0, 0, 1, 0, 0, 0, 4, 355, 0, 1, 0, 0, 0, 0]. The 108 writes are split as follows [0, 13, 0, 1, 20, 12, 0, 4, 3, 6, 3, 17, 1, 4, 0, 7, 15, 0, 0, 0, 2]. [2025-02-08 13:29:50,586 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:50" (1/1) ... [2025-02-08 13:29:50,586 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:50" (1/1) ... [2025-02-08 13:29:50,630 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:50" (1/1) ... [2025-02-08 13:29:50,634 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:50" (1/1) ... [2025-02-08 13:29:50,680 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:50" (1/1) ... [2025-02-08 13:29:50,694 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:50" (1/1) ... [2025-02-08 13:29:50,716 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:29:50,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:29:50,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:29:50,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:29:50,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:50" (1/1) ... [2025-02-08 13:29:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:29:50,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:50,746 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:50,751 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:50,767 INFO L130 BoogieDeclarations]: Found specification of procedure xopen [2025-02-08 13:29:50,768 INFO L138 BoogieDeclarations]: Found implementation of procedure xopen [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:50,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:50,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#19 [2025-02-08 13:29:50,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc#20 [2025-02-08 13:29:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#0 [2025-02-08 13:29:50,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#1 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#2 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#3 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#4 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#5 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#6 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#7 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#8 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#9 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#10 [2025-02-08 13:29:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#11 [2025-02-08 13:29:50,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#12 [2025-02-08 13:29:50,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#13 [2025-02-08 13:29:50,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#14 [2025-02-08 13:29:50,772 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#15 [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#16 [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#17 [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#18 [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#19 [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc#20 [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure xrealloc [2025-02-08 13:29:50,773 INFO L138 BoogieDeclarations]: Found implementation of procedure xrealloc [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-08 13:29:50,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#18 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#19 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#20 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:29:50,774 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-08 13:29:50,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-02-08 13:29:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 13:29:50,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-02-08 13:29:50,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:29:50,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:50,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:50,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#0 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#1 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#2 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#3 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#4 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#5 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#6 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#7 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#8 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#9 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#10 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#11 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#12 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#13 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#14 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#15 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#16 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#17 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#18 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#19 [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy#20 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:29:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-08 13:29:50,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#18 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#19 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#20 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-02-08 13:29:50,783 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-02-08 13:29:50,785 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#19 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#20 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#15 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#16 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#17 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#18 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#19 [2025-02-08 13:29:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#20 [2025-02-08 13:29:50,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:29:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-08 13:29:50,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-08 13:29:50,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:29:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-02-08 13:29:50,790 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:29:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:29:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:29:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:29:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:29:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 13:29:50,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-08 13:29:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-02-08 13:29:51,270 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:29:51,272 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: assume !(0 == full_write_~len#1 % 18446744073709551616);assume { :begin_inline_safe_write } true;safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1 := full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1;havoc safe_write_#res#1;havoc safe_write_#t~ret190#1, safe_write_#t~mem191#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~1#1; [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2529: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: safe_write_#t~ret190#1 := write_#res#1;havoc write_#t~nondet301#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~3#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret190#1 && safe_write_#t~ret190#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret190#1;havoc safe_write_#t~ret190#1; [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538: assume full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807;full_write_~total~0#1 := full_write_~total~0#1 + full_write_~cc~0#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_~buf#1.base, full_write_~buf#1.offset + full_write_~cc~0#1;full_write_~len#1 := full_write_~len#1 - full_write_~cc~0#1; [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2538-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:29:51,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem191#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem191#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2960: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: full_write_#t~ret76#1 := safe_write_#res#1;havoc safe_write_#t~ret190#1, safe_write_#t~mem191#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~1#1;havoc safe_write_#in~fd#1, safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset, safe_write_#in~count#1;assume { :end_inline_safe_write } true;assume -9223372036854775808 <= full_write_#t~ret76#1 && full_write_#t~ret76#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret76#1;havoc full_write_#t~ret76#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: assume full_write_~cc~0#1 < 0; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2492: #t~ret65#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet73#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret65#1 && #t~ret65#1 <= 2147483647;havoc #t~ret65#1;call #t~mem66#1.base, #t~mem66#1.offset := read~$Pointer$#3(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem66#1.base, #t~mem66#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret76#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;full_write_~fd#1 := full_write_#in~fd#1;full_write_~buf#1.base, full_write_~buf#1.offset := full_write_#in~buf#1.base, full_write_#in~buf#1.offset;full_write_~len#1 := full_write_#in~len#1;havoc full_write_~cc~0#1;full_write_~total~0#1 := 0; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2534: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2534: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493: #t~ret67#1 := full_write_#res#1;havoc full_write_#t~ret76#1, full_write_~fd#1, full_write_~buf#1.base, full_write_~buf#1.offset, full_write_~len#1, full_write_~cc~0#1, full_write_~total~0#1;havoc full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1;assume { :end_inline_full_write } true;assume -9223372036854775808 <= #t~ret67#1 && #t~ret67#1 <= 9223372036854775807;havoc #t~mem66#1.base, #t~mem66#1.offset;havoc #t~ret67#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3352: write_#res#1 := write_~ret~3#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3352-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~3#1 || (write_~ret~3#1 >= 0 && write_~ret~3#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: assume 0 != safe_write_~tmp_if_expr$1~1#1 % 256; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: assume !(0 != safe_write_~tmp_if_expr$1~1#1 % 256); [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume true;assume { :begin_inline_write } true;write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1 := safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1;havoc write_#res#1;havoc write_#t~nondet301#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~3#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet301#1;assume -9223372036854775808 <= write_#t~nondet301#1 && write_#t~nondet301#1 <= 9223372036854775807;write_~ret~3#1 := write_#t~nondet301#1;havoc write_#t~nondet301#1; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957: assume !true; [2025-02-08 13:29:51,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2966-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int#9(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2414: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: assume xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3240: assume !(xstrtou_range_sfx_~r~0#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: xatoi_positive_#t~ret224#1 := xatou_range_#res#1;havoc xatou_range_#t~ret225#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret224#1;havoc xatoi_positive_#t~ret224#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-1: [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877: assume 0 != getopt32_#t~bitwise157#1 % 4294967296;havoc getopt32_#t~mem156#1;havoc getopt32_#t~bitwise157#1; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877: assume !(0 != getopt32_#t~bitwise157#1 % 4294967296);havoc getopt32_#t~mem156#1;havoc getopt32_#t~bitwise157#1;call getopt32_#t~mem158#1 := read~int#5(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem159#1 := read~int#5(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume getopt32_#t~mem156#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise157#1 := getopt32_#t~mem156#1; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-3: assume !(getopt32_#t~mem156#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-2: havoc getopt32_#t~bitwise157#1;assume getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_#t~mem156#1 % 4294967296 && getopt32_#t~bitwise157#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-5: call getopt32_#t~mem156#1 := read~int#5(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:57,181 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-4: assume 0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise157#1 := 0; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2877-4: assume !(0 == getopt32_#t~mem156#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: assume __main_~old_line~0#1.base == 0 && __main_~old_line~0#1.offset == 0;__main_~tmp_if_expr$5~0#1 := 1; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: assume !(__main_~old_line~0#1.base == 0 && __main_~old_line~0#1.offset == 0);call __main_#t~mem217#1 := read~int#1(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset, 4);__main_~return_value_strncmp$4~0#1 := __main_#t~nondet218#1;havoc __main_#t~mem217#1;havoc __main_#t~nondet218#1;__main_~tmp_if_expr$5~0#1 := (if 0 == (if 0 != (if 0 != __main_~return_value_strncmp$4~0#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977-1: skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset := skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2548: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3242: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~0#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3242: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-1: [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879: getopt32_~trigger~0#1 := getopt32_#t~bitwise160#1;havoc getopt32_#t~mem158#1;havoc getopt32_#t~mem159#1;havoc getopt32_#t~bitwise160#1;call getopt32_#t~mem161#1 := read~int#5(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-3: assume getopt32_#t~mem158#1 % 4294967296 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := getopt32_#t~mem158#1; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-3: assume !(getopt32_#t~mem158#1 % 4294967296 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-2: havoc getopt32_#t~bitwise160#1;assume getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem158#1 % 4294967296 && getopt32_#t~bitwise160#1 % 4294967296 <= getopt32_#t~mem159#1 % 4294967296; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-4: assume 0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_#t~mem159#1 % 4294967296;getopt32_#t~bitwise160#1 := 0; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2879-4: assume !(0 == getopt32_#t~mem158#1 % 4294967296 || 0 == getopt32_#t~mem159#1 % 4294967296); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem246#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem246#1;havoc xstrtou_range_sfx_#t~mem246#1;call write~int#9(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet43#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet43#1;havoc bb_strtoui_#t~nondet43#1; [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3210: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:29:57,182 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume true;call llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset := read~$Pointer$#1(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:29:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946: assume !true; [2025-02-08 13:29:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-2: assume !!(llist_add_to_end_#t~mem186#1.base == 0 && llist_add_to_end_#t~mem186#1.offset == 0);havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset; [2025-02-08 13:29:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2946-2: assume !(llist_add_to_end_#t~mem186#1.base == 0 && llist_add_to_end_#t~mem186#1.offset == 0);havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset;call llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset := read~$Pointer$#1(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:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880: getopt32_~flags~0#1 := getopt32_#t~bitwise163#1;havoc getopt32_#t~mem161#1;havoc getopt32_#t~bitwise162#1;havoc getopt32_#t~bitwise163#1;call getopt32_#t~mem164#1 := read~int#5(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:29:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-2: havoc getopt32_#t~bitwise163#1;assume getopt32_#t~bitwise163#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise163#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise162#1) % 4294967296; [2025-02-08 13:29:57,183 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-1: [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296;getopt32_#t~bitwise163#1 := 0; [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296); [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296;getopt32_#t~bitwise163#1 := getopt32_~flags~0#1; [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise162#1) % 4294967296); [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-6: havoc getopt32_#t~bitwise162#1;assume getopt32_#t~bitwise162#1 % 4294967296 <= getopt32_#t~mem161#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-5: [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_#t~mem161#1; [2025-02-08 13:29:57,187 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-7: assume getopt32_#t~mem161#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise162#1 := 0; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-7: assume !(getopt32_#t~mem161#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-9: assume 0 == getopt32_#t~mem161#1 % 4294967296;getopt32_#t~bitwise162#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2880-9: assume !(0 == getopt32_#t~mem161#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-1: [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881: getopt32_~flags~0#1 := getopt32_#t~bitwise166#1;havoc getopt32_#t~mem164#1;havoc getopt32_#t~bitwise165#1;havoc getopt32_#t~bitwise166#1; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-3: assume 0 == getopt32_#t~bitwise165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_~flags~0#1; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-3: assume !(0 == getopt32_#t~bitwise165#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-2: havoc getopt32_#t~bitwise166#1;assume (getopt32_#t~bitwise166#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise166#1 % 4294967296 >= getopt32_#t~bitwise165#1 % 4294967296) && getopt32_#t~bitwise166#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise165#1 % 4294967296; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-5: [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise165#1 % 4294967296;getopt32_#t~bitwise166#1 := getopt32_#t~bitwise165#1; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise165#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-7: assume getopt32_#t~mem164#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := 0; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-7: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-6: havoc getopt32_#t~bitwise165#1;assume getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_#t~mem164#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-9: assume 0 == getopt32_#t~mem164#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:57,189 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-9: assume !(0 == getopt32_#t~mem164#1 % 4294967296); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_#t~mem164#1; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2881-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981-1: skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset := skip_whitespace_~s#1.base, 1 + skip_whitespace_~s#1.offset; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2948: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset, xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981: assume true;call skip_whitespace_#t~mem195#1 := read~int#7(skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset, 1); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2981: assume !true; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: getopt32_~flags~0#1 := getopt32_#t~bitwise167#1;havoc getopt32_#t~bitwise167#1;call getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-2: havoc getopt32_#t~bitwise167#1;assume getopt32_#t~bitwise167#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-1: [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_~flags~0#1; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise167#1 := 0; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise167#1 := getopt32_~trigger~0#1; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3147: call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset;__main_#t~ret210#1.base, __main_#t~ret210#1.offset := xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset;havoc xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset, xmalloc_fgetline_#t~mem232#1, xmalloc_fgetline_#t~mem233#1, xmalloc_fgetline_#t~mem234#1, xmalloc_fgetline_#t~mem235#1, xmalloc_fgetline_#t~mem236#1, xmalloc_fgetline_~file#1.base, xmalloc_fgetline_~file#1.offset, xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;havoc xmalloc_fgetline_#in~file#1.base, xmalloc_fgetline_#in~file#1.offset;assume { :end_inline_xmalloc_fgetline } true;__main_~cur_line~0#1.base, __main_~cur_line~0#1.offset := __main_#t~ret210#1.base, __main_#t~ret210#1.offset;havoc __main_#t~ret210#1.base, __main_#t~ret210#1.offset; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: assume !(32 == skip_whitespace_#t~mem195#1);havoc skip_whitespace_#t~mem195#1;call skip_whitespace_#t~mem196#1 := read~int#7(skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset, 1); [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2982: assume !!(32 == skip_whitespace_#t~mem195#1);havoc skip_whitespace_#t~mem195#1; [2025-02-08 13:29:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2949: llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset, xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset;havoc llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset;call write~$Pointer$#1(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$#1(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$#1(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:57,190 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: assume !(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset;call getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem171#1 := read~int#1(getopt32_#t~mem170#1.base, getopt32_#t~mem170#1.offset, 4); [2025-02-08 13:29:57,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2883: assume !!(getopt32_#t~mem168#1.base == 0 && getopt32_#t~mem168#1.offset == 0);havoc getopt32_#t~mem168#1.base, getopt32_#t~mem168#1.offset; [2025-02-08 13:29:57,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-1: SUMMARY for call bb_error_msg_and_die(12, 0, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset); srcloc: null [2025-02-08 13:29:57,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: xstrtou_range_sfx_#t~ret247#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet43#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_#t~ret247#1;havoc xstrtou_range_sfx_#t~ret247#1;call xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset := read~$Pointer$#17(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:29:57,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247: havoc xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset; [2025-02-08 13:29:57,191 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3247-2: call xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$#15(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, 8);call write~int#15(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs257#1.base, 8 + xstrtou_range_sfx_#t~varargs257#1.offset, 8);call write~int#15(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs257#1.base, 16 + xstrtou_range_sfx_#t~varargs257#1.offset, 8); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume 1 + getopt32_#t~mem171#1 <= 2147483647;call write~int#1(1 + getopt32_#t~mem171#1, getopt32_#t~mem169#1.base, getopt32_#t~mem169#1.offset, 4); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884: assume !(1 + getopt32_#t~mem171#1 <= 2147483647); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: assume 1 + getopt32_#t~mem171#1 >= -2147483648; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2884-1: assume !(1 + getopt32_#t~mem171#1 >= -2147483648); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: assume true; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: assume !true; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem248#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem248#1.offset);havoc xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset;call xstrtou_range_sfx_#t~mem249#1 := read~int#9(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3215: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem248#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem248#1.offset);havoc xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3149: xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset := bb_get_chunk_from_file_#res#1.base, bb_get_chunk_from_file_#res#1.offset;havoc bb_get_chunk_from_file_#t~ret37#1, bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset, bb_get_chunk_from_file_#t~ret39#1.base, bb_get_chunk_from_file_#t~ret39#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$3~0#1.offset, bb_get_chunk_from_file_~file#1.base, bb_get_chunk_from_file_~file#1.offset, bb_get_chunk_from_file_~end#1.base, bb_get_chunk_from_file_~end#1.offset, bb_get_chunk_from_file_~ch~0#1, bb_get_chunk_from_file_~idx~0#1, bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset, bb_get_chunk_from_file_~tmp_post$2~0#1;havoc bb_get_chunk_from_file_#in~file#1.base, bb_get_chunk_from_file_#in~file#1.offset, bb_get_chunk_from_file_#in~end#1.base, bb_get_chunk_from_file_#in~end#1.offset;assume { :end_inline_bb_get_chunk_from_file } true;xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset := xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset;havoc xmalloc_fgetline_#t~ret231#1.base, xmalloc_fgetline_#t~ret231#1.offset;call xmalloc_fgetline_#t~mem232#1 := read~int#20(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4); [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume 0 != __main_~tmp_if_expr$5~0#1 % 256; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3083: assume !(0 != __main_~tmp_if_expr$5~0#1 % 256);call ULTIMATE.dealloc(__main_~cur_line~0#1.base, __main_~cur_line~0#1.offset);__main_~dups~0#1 := 1 + __main_~dups~0#1; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 4);havoc skip_whitespace_#t~mem196#1; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume !!(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 4);havoc skip_whitespace_#t~mem196#1; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-2: assume 247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 13:29:57,194 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-2: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-1: assume 247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 2147483647; [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984-1: assume !(247 + (if skip_whitespace_#t~mem196#1 % 256 % 4294967296 <= 2147483647 then skip_whitespace_#t~mem196#1 % 256 % 4294967296 else skip_whitespace_#t~mem196#1 % 256 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem172#1 := read~int#5(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume !(0 == xmalloc_fgetline_#t~mem232#1);havoc xmalloc_fgetline_#t~mem232#1;call xmalloc_fgetline_#t~mem233#1 := read~int#20(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: assume !!(0 == xmalloc_fgetline_#t~mem232#1);havoc xmalloc_fgetline_#t~mem232#1; [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume 0 == xstrtou_range_sfx_#t~mem249#1;havoc xstrtou_range_sfx_#t~mem249#1;call write~int#9(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3217: assume !(0 == xstrtou_range_sfx_#t~mem249#1);havoc xstrtou_range_sfx_#t~mem249#1; [2025-02-08 13:29:57,195 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume 1 == getopt32_#t~mem172#1;havoc getopt32_#t~mem172#1;call getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem173#1.base, getopt32_#t~mem173#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem186#1.base, llist_add_to_end_#t~mem186#1.offset, llist_add_to_end_#t~mem187#1.base, llist_add_to_end_#t~mem187#1.offset, llist_add_to_end_#t~ret188#1.base, llist_add_to_end_#t~ret188#1.offset, llist_add_to_end_#t~mem189#1.base, llist_add_to_end_#t~mem189#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:29:57,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2887: assume !(1 == getopt32_#t~mem172#1);havoc getopt32_#t~mem172#1;call getopt32_#t~mem174#1 := read~int#5(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:57,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: assume -1 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:57,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: assume !(-1 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:57,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: assume xmalloc_fgetline_#t~mem233#1 - 1 <= 2147483647;call write~int#20(xmalloc_fgetline_#t~mem233#1 - 1, xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);havoc xmalloc_fgetline_#t~mem233#1;call xmalloc_fgetline_#t~mem234#1 := read~int#20(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);call xmalloc_fgetline_#t~mem235#1 := read~int#7(xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem234#1, 1); [2025-02-08 13:29:57,196 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152: assume !(xmalloc_fgetline_#t~mem233#1 - 1 <= 2147483647); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152-1: assume xmalloc_fgetline_#t~mem233#1 - 1 >= -2147483648; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3152-1: assume !(xmalloc_fgetline_#t~mem233#1 - 1 >= -2147483648); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987-1: skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset := skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3120: xdup2_#t~ret226#1 := dup2_#res#1;havoc dup2_#t~nondet262#1, dup2_#t~nondet263#1, dup2_#t~mem264#1, dup2_~oldfd#1, dup2_~newfd#1;havoc dup2_#in~oldfd#1, dup2_#in~newfd#1;assume { :end_inline_dup2 } true;assume -2147483648 <= xdup2_#t~ret226#1 && xdup2_#t~ret226#1 <= 2147483647;xdup2_~return_value_dup2$1~0#1 := xdup2_#t~ret226#1;havoc xdup2_#t~ret226#1; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume 10 == xmalloc_fgetline_#t~mem235#1;havoc xmalloc_fgetline_#t~mem234#1;havoc xmalloc_fgetline_#t~mem235#1;call xmalloc_fgetline_#t~mem236#1 := read~int#20(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset, 4);call write~int#7(0, xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset + xmalloc_fgetline_#t~mem236#1, 1); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3153: assume !(10 == xmalloc_fgetline_#t~mem235#1);havoc xmalloc_fgetline_#t~mem234#1;havoc xmalloc_fgetline_#t~mem235#1; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume 0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2361: assume !(0 == bb_get_chunk_from_file_~idx~0#1 % 256 % 4294967296); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !(xdup2_~return_value_dup2$1~0#1 == xdup2_~to#1);call xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !!(xdup2_~return_value_dup2$1~0#1 == xdup2_~to#1); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890: assume 2 == getopt32_#t~mem174#1;havoc getopt32_#t~mem174#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret224#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret225#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem243#1, xstrtou_range_sfx_#t~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_#t~ret247#1, xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset, xstrtou_range_sfx_#t~mem249#1, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset, xstrtou_range_sfx_#t~nondet252#1, xstrtou_range_sfx_#t~mem253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, xstrtou_range_sfx_#t~mem256#1, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~0#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~3#1;call xstrtou_range_sfx_#t~mem243#1 := read~int#1(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890: assume !(2 == getopt32_#t~mem174#1);havoc getopt32_#t~mem174#1;call getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254: havoc xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret225#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem243#1, xstrtou_range_sfx_#t~mem244#1, xstrtou_range_sfx_#t~mem245#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem246#1, xstrtou_range_sfx_#t~ret247#1, xstrtou_range_sfx_#t~mem248#1.base, xstrtou_range_sfx_#t~mem248#1.offset, xstrtou_range_sfx_#t~mem249#1, xstrtou_range_sfx_#t~mem250#1, xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset, xstrtou_range_sfx_#t~nondet252#1, xstrtou_range_sfx_#t~mem253#1, xstrtou_range_sfx_#t~mem254#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, xstrtou_range_sfx_#t~mem256#1, xstrtou_range_sfx_#t~varargs257#1.base, xstrtou_range_sfx_#t~varargs257#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~0#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~3#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret225#1;havoc xatou_range_#t~ret225#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254-2: call xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#15(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset, 8); [2025-02-08 13:29:57,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221-1: assume !(0 == xstrtou_range_sfx_#t~mem250#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem250#1; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221-1: assume !!(0 == xstrtou_range_sfx_#t~mem250#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem250#1; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3254-1: SUMMARY for call bb_error_msg_and_die(13, 0, xstrtou_range_sfx_#t~varargs258#1.base, xstrtou_range_sfx_#t~varargs258#1.offset); srcloc: null [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221: assume true;call xstrtou_range_sfx_#t~mem250#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3221: assume !true; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3122: SUMMARY for call bb_perror_msg_and_die(10, 0, xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset); srcloc: null [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3056-1: assume true; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3056-1: assume !true; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363-1: SUMMARY for call bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset := xrealloc(bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset, (256 + bb_get_chunk_from_file_~idx~0#1) % 4294967296); srcloc: null [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2363: bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset := bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;havoc bb_get_chunk_from_file_#t~ret38#1.base, bb_get_chunk_from_file_#t~ret38#1.offset;bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset := bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.base, bb_get_chunk_from_file_~return_value_xrealloc$1~0#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3156-1: xmalloc_fgetline_#res#1.base, xmalloc_fgetline_#res#1.offset := xmalloc_fgetline_~c~1#1.base, xmalloc_fgetline_~c~1#1.offset;call ULTIMATE.dealloc(xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset);havoc xmalloc_fgetline_~#i~2#1.base, xmalloc_fgetline_~#i~2#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3223: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset := read~$Pointer$#17(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet252#1;havoc xstrtou_range_sfx_#t~mem251#1.base, xstrtou_range_sfx_#t~mem251#1.offset;havoc xstrtou_range_sfx_#t~nondet252#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2893: getopt32_#t~ret175#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret224#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret175#1 && getopt32_#t~ret175#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret175#1;havoc getopt32_#t~ret175#1;call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int#1(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3059: assume __main_~cur_line~0#1.base == 0 && __main_~cur_line~0#1.offset == 0; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3059: assume !(__main_~cur_line~0#1.base == 0 && __main_~cur_line~0#1.offset == 0);__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_~cur_line~0#1.base, __main_~cur_line~0#1.offset;call __main_#t~mem211#1 := read~int#1(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset, 4);__main_~i~1#1 := __main_#t~mem211#1;havoc __main_#t~mem211#1; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2366: bb_get_chunk_from_file_~tmp_post$2~0#1 := bb_get_chunk_from_file_~idx~0#1;bb_get_chunk_from_file_~idx~0#1 := 1 + bb_get_chunk_from_file_~idx~0#1;call write~int#7((if bb_get_chunk_from_file_~ch~0#1 % 256 <= 127 then bb_get_chunk_from_file_~ch~0#1 % 256 else bb_get_chunk_from_file_~ch~0#1 % 256 - 256), bb_get_chunk_from_file_~linebuf~0#1.base, bb_get_chunk_from_file_~linebuf~0#1.offset + (if bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 else bb_get_chunk_from_file_~tmp_post$2~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1); [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3259-1: SUMMARY for call xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3259: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset;havoc xzalloc_#t~ret259#1.base, xzalloc_#t~ret259#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: call ULTIMATE.dealloc(__main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset);havoc __main_~#skip_fields~0#1.base, __main_~#skip_fields~0#1.offset;call ULTIMATE.dealloc(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset);havoc __main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset;call ULTIMATE.dealloc(__main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset);havoc __main_~#max_chars~0#1.base, __main_~#max_chars~0#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3260: havoc xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:29:57,198 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3260-1: SUMMARY for call xzalloc_#t~memset~res260#1.base, xzalloc_#t~memset~res260#1.offset := #Ultimate.C_memset#1(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: assume !(getopt32_#t~mem177#1.base == 0 && getopt32_#t~mem177#1.offset == 0);havoc getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset;call getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset := read~$Pointer$#5(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$#1(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset, 8); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897: assume !!(getopt32_#t~mem177#1.base == 0 && getopt32_#t~mem177#1.offset == 0);havoc getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume 0 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2369: assume !(0 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem253#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3162: havoc xdup2_#t~ret226#1, xdup2_#t~varargs227#1.base, xdup2_#t~varargs227#1.offset, xdup2_~from#1, xdup2_~to#1, xdup2_~return_value_dup2$1~0#1;havoc xdup2_#in~from#1, xdup2_#in~to#1;assume { :end_inline_xdup2 } true;assume -2147483648 <= xmove_fd_#t~nondet237#1 && xmove_fd_#t~nondet237#1 <= 2147483647;havoc xmove_fd_#t~nondet237#1;havoc xmove_fd_#t~nondet237#1, xmove_fd_~from#1, xmove_fd_~to#1;havoc xmove_fd_#in~from#1, xmove_fd_#in~to#1;assume { :end_inline_xmove_fd } true;havoc __main_~return_value_xopen$2~0#1; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume 45 == xstrtou_range_sfx_#t~mem243#1;havoc xstrtou_range_sfx_#t~mem243#1;xstrtou_range_sfx_~tmp_if_expr$1~3#1 := 1; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: assume !(45 == xstrtou_range_sfx_#t~mem243#1);havoc xstrtou_range_sfx_#t~mem243#1;call xstrtou_range_sfx_#t~mem244#1 := read~int#1(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem244#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume !(0 == __main_~i~1#1 % 4294967296);assume { :begin_inline_skip_whitespace } true;skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset := __main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset;havoc skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset;havoc skip_whitespace_#t~mem195#1, skip_whitespace_#t~mem196#1, skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset;skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset := skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: assume !!(0 == __main_~i~1#1 % 4294967296);call __main_#t~mem214#1 := read~int#1(__main_~#skip_chars~0#1.base, __main_~#skip_chars~0#1.offset, 4);__main_~i~1#1 := __main_#t~mem214#1;havoc __main_#t~mem214#1; [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2371: assume !!(bb_get_chunk_from_file_~end#1.base == 0 && bb_get_chunk_from_file_~end#1.offset == 0); [2025-02-08 13:29:57,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !(4294967295 / (xstrtou_range_sfx_#t~mem253#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem253#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3230: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem253#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~0#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem253#1;call xstrtou_range_sfx_#t~mem254#1 := read~int#19(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~0#1 := xstrtou_range_sfx_~r~0#1 * xstrtou_range_sfx_#t~mem254#1;havoc xstrtou_range_sfx_#t~mem254#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3065: __main_#t~ret212#1.base, __main_#t~ret212#1.offset := skip_whitespace_#res#1.base, skip_whitespace_#res#1.offset;havoc skip_whitespace_#t~mem195#1, skip_whitespace_#t~mem196#1, skip_whitespace_~s#1.base, skip_whitespace_~s#1.offset;havoc skip_whitespace_#in~s#1.base, skip_whitespace_#in~s#1.offset;assume { :end_inline_skip_whitespace } true;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_#t~ret212#1.base, __main_#t~ret212#1.offset;havoc __main_#t~ret212#1.base, __main_#t~ret212#1.offset;assume { :begin_inline_skip_non_whitespace } true;skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset := __main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset;havoc skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset;havoc skip_non_whitespace_#t~mem192#1, skip_non_whitespace_#t~mem193#1, skip_non_whitespace_#t~mem194#1, skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset;skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset := skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2867-1: assume true; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2867-1: assume !true; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: havoc _IO_getc_#t~nondet261#1;bb_get_chunk_from_file_#t~ret37#1 := _IO_getc_#res#1;havoc _IO_getc_#t~nondet261#1, _IO_getc_~stream#1.base, _IO_getc_~stream#1.offset;havoc _IO_getc_#in~stream#1.base, _IO_getc_#in~stream#1.offset;assume { :end_inline__IO_getc } true;assume -2147483648 <= bb_get_chunk_from_file_#t~ret37#1 && bb_get_chunk_from_file_#t~ret37#1 <= 2147483647;bb_get_chunk_from_file_~ch~0#1 := bb_get_chunk_from_file_#t~ret37#1;havoc bb_get_chunk_from_file_#t~ret37#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066: __main_#t~ret213#1.base, __main_#t~ret213#1.offset := skip_non_whitespace_#res#1.base, skip_non_whitespace_#res#1.offset;havoc skip_non_whitespace_#t~mem192#1, skip_non_whitespace_#t~mem193#1, skip_non_whitespace_#t~mem194#1, skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset;havoc skip_non_whitespace_#in~s#1.base, skip_non_whitespace_#in~s#1.offset;assume { :end_inline_skip_non_whitespace } true;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_#t~ret213#1.base, __main_#t~ret213#1.offset;havoc __main_#t~ret213#1.base, __main_#t~ret213#1.offset;__main_~i~1#1 := __main_~i~1#1 - 1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: assume 10 == bb_get_chunk_from_file_~ch~0#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: assume !(10 == bb_get_chunk_from_file_~ch~0#1); [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc xstrtou_range_sfx_~tmp_if_expr$3~2#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume -1 == getopt32_~c~0#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2870: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~3#1 % 256);call xstrtou_range_sfx_#t~mem245#1 := read~int#1(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069: assume true;__main_#t~short216#1 := 0 == __main_~i~1#1 % 4294967296; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3069: assume !true; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume true;call skip_non_whitespace_#t~mem192#1 := read~int#7(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: assume !true; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-2: assume !!(0 == skip_non_whitespace_#t~mem192#1);havoc skip_non_whitespace_#t~mem192#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970-2: assume !(0 == skip_non_whitespace_#t~mem192#1);havoc skip_non_whitespace_#t~mem192#1;call skip_non_whitespace_#t~mem193#1 := read~int#7(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236: assume 0 == xstrtou_range_sfx_#t~mem256#1;havoc xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset;havoc xstrtou_range_sfx_#t~mem256#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236: assume !(0 == xstrtou_range_sfx_#t~mem256#1);havoc xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset;havoc xstrtou_range_sfx_#t~mem256#1; [2025-02-08 13:29:57,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3236-1: call xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset := read~$Pointer$#17(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem256#1 := read~int#1(xstrtou_range_sfx_#t~mem255#1.base, xstrtou_range_sfx_#t~mem255#1.offset, 1); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071-1: assume __main_#t~short216#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071-1: assume !__main_#t~short216#1;call __main_#t~mem215#1 := read~int#7(__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset, 1);__main_#t~short216#1 := 0 == __main_#t~mem215#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071: assume __main_#t~short216#1;havoc __main_#t~mem215#1;havoc __main_#t~short216#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3071: assume !__main_#t~short216#1;havoc __main_#t~mem215#1;havoc __main_#t~short216#1;__main_~cur_compare~0#1.base, __main_~cur_compare~0#1.offset := __main_~cur_compare~0#1.base, 1 + __main_~cur_compare~0#1.offset;__main_~i~1#1 := __main_~i~1#1 - 1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume 32 == skip_non_whitespace_#t~mem193#1;havoc skip_non_whitespace_#t~mem193#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: assume !(32 == skip_non_whitespace_#t~mem193#1);havoc skip_non_whitespace_#t~mem193#1;call skip_non_whitespace_#t~mem194#1 := read~int#7(skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset, 1); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874: assume true;call getopt32_#t~mem154#1 := read~int#5(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874: assume !true; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-2: assume !!((if getopt32_#t~mem154#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem154#1 % 256 % 4294967296 else getopt32_#t~mem154#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem154#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2874-2: assume !((if getopt32_#t~mem154#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem154#1 % 256 % 4294967296 else getopt32_#t~mem154#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem154#1;call getopt32_#t~mem155#1 := read~int#5(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205-1: assume xstrtou_range_sfx_#t~mem245#1 - 9 >= -2147483648; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205-1: assume !(xstrtou_range_sfx_#t~mem245#1 - 9 >= -2147483648); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: assume xstrtou_range_sfx_#t~mem245#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem245#1 - 9;havoc xstrtou_range_sfx_#t~mem245#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: assume !(xstrtou_range_sfx_#t~mem245#1 - 9 <= 2147483647); [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) > 4);havoc skip_non_whitespace_#t~mem194#1; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: assume !!(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) > 4);havoc skip_non_whitespace_#t~mem194#1;skip_non_whitespace_~s#1.base, skip_non_whitespace_~s#1.offset := skip_non_whitespace_~s#1.base, 1 + skip_non_whitespace_~s#1.offset; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-2: assume 247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) >= -2147483648; [2025-02-08 13:29:57,201 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-2: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) >= -2147483648); [2025-02-08 13:29:57,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-1: assume 247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) <= 2147483647; [2025-02-08 13:29:57,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974-1: assume !(247 + (if skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 <= 2147483647 then skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 else skip_non_whitespace_#t~mem194#1 % 256 % 4294967296 - 4294967296) <= 2147483647); [2025-02-08 13:29:57,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume 0 == (if getopt32_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem155#1 % 256 % 4294967296 else getopt32_#t~mem155#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem155#1; [2025-02-08 13:29:57,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: assume !(0 == (if getopt32_#t~mem155#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem155#1 % 256 % 4294967296 else getopt32_#t~mem155#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem155#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:29:57,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338: havoc getopt_long_#t~ret297#1;getopt32_#t~ret153#1 := getopt_long_#res#1;havoc getopt_long_#t~mem293#1.base, getopt_long_#t~mem293#1.offset, getopt_long_#t~mem294#1, getopt_long_#t~mem295#1.base, getopt_long_#t~mem295#1.offset, getopt_long_#t~mem296#1, getopt_long_#t~ret297#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret153#1 && getopt32_#t~ret153#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret153#1;havoc getopt32_#t~ret153#1; [2025-02-08 13:29:57,212 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3338-2: getopt_long_#t~ret297#1 := getopt_#res#1;havoc getopt_#t~mem277#1.base, getopt_#t~mem277#1.offset, getopt_#t~mem278#1, getopt_#t~short279#1, getopt_#t~nondet280#1, getopt_#t~nondet281#1, getopt_#t~mem282#1, getopt_#t~short283#1, getopt_#t~nondet284#1, getopt_#t~mem285#1, getopt_#t~nondet286#1, getopt_#t~pre287#1, getopt_#t~mem288#1, getopt_#t~short289#1, getopt_#t~nondet290#1, getopt_#t~mem291#1.base, getopt_#t~mem291#1.offset, getopt_#t~pre292#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret297#1 && getopt_long_#t~ret297#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret297#1;havoc getopt_long_#t~ret297#1; [2025-02-08 13:29:57,433 INFO L? ?]: Removed 682 outVars from TransFormulas that were not future-live. [2025-02-08 13:29:57,433 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:29:57,476 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:29:57,476 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:29:57,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:57 BoogieIcfgContainer [2025-02-08 13:29:57,479 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:29:57,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:29:57,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:29:57,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:29:57,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:29:49" (1/3) ... [2025-02-08 13:29:57,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a202484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:57, skipping insertion in model container [2025-02-08 13:29:57,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:29:50" (2/3) ... [2025-02-08 13:29:57,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a202484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:29:57, skipping insertion in model container [2025-02-08 13:29:57,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:29:57" (3/3) ... [2025-02-08 13:29:57,487 INFO L128 eAbstractionObserver]: Analyzing ICFG uniq-1.i [2025-02-08 13:29:57,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:29:57,503 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uniq-1.i that has 72 procedures, 705 locations, 1 initial locations, 77 loop locations, and 78 error locations. [2025-02-08 13:29:57,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:29:57,563 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;@519b03fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:29:57,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 78 error locations. [2025-02-08 13:29:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 350 states have (on average 1.677142857142857) internal successors, (587), 443 states have internal predecessors, (587), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-08 13:29:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:29:57,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:57,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:29:57,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:29:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1330588, now seen corresponding path program 1 times [2025-02-08 13:29:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010038744] [2025-02-08 13:29:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:58,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:29:58,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:29:58,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:58,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:58,503 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:58,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:58,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010038744] [2025-02-08 13:29:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010038744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:29:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:29:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226712753] [2025-02-08 13:29:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:58,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:29:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:58,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:29:58,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:29:58,523 INFO L87 Difference]: Start difference. First operand has 477 states, 350 states have (on average 1.677142857142857) internal successors, (587), 443 states have internal predecessors, (587), 25 states have call successors, (25), 14 states have call predecessors, (25), 14 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:29:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:29:58,611 INFO L93 Difference]: Finished difference Result 692 states and 933 transitions. [2025-02-08 13:29:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:29:58,614 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:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:29:58,620 INFO L225 Difference]: With dead ends: 692 [2025-02-08 13:29:58,621 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:29:58,625 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:58,628 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:58,628 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:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:29:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:29:58,664 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:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:29:58,670 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 3 [2025-02-08 13:29:58,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:29:58,670 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:29:58,670 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:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:29:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:29:58,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:29:58,671 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:29:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:29:58,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:29:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:29:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 986107645, now seen corresponding path program 1 times [2025-02-08 13:29:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:29:58,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868732896] [2025-02-08 13:29:58,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:58,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:29:58,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:58,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:58,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:29:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:29:59,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868732896] [2025-02-08 13:29:59,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868732896] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:29:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679242738] [2025-02-08 13:29:59,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:29:59,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:29:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:29:59,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:29:59,253 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:59,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:29:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:29:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:29:59,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:29:59,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:29:59,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:29:59,910 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:59,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:29:59,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679242738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:29:59,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:29:59,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:29:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741214372] [2025-02-08 13:29:59,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:29:59,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:29:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:29:59,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:29:59,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:29:59,912 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:03,935 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,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:04,026 INFO L93 Difference]: Finished difference Result 199 states and 247 transitions. [2025-02-08 13:30:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 13:30:04,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:04,029 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:30:04,029 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:30:04,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:04,031 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 1 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:04,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:30:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:30:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 152 states have (on average 1.519736842105263) internal successors, (231), 184 states have internal predecessors, (231), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:30:04,039 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 6 [2025-02-08 13:30:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:04,040 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:30:04,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:30:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:30:04,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:04,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:30:04,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:30:04,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:04,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 504567198, now seen corresponding path program 1 times [2025-02-08 13:30:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:04,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229647575] [2025-02-08 13:30:04,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:04,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:30:04,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:30:04,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:04,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229647575] [2025-02-08 13:30:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229647575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:04,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:04,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:04,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748901569] [2025-02-08 13:30:04,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:04,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:04,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:04,535 INFO L87 Difference]: Start difference. First operand 198 states and 246 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:04,571 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:30:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:04,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 13:30:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:04,573 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:30:04,573 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:30:04,573 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:04,573 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:04,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:30:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-02-08 13:30:04,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.52) internal successors, (228), 181 states have internal predecessors, (228), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:04,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:30:04,590 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 7 [2025-02-08 13:30:04,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:04,590 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:30:04,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 13:30:04,590 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:30:04,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:30:04,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:04,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:04,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:30:04,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 420678801, now seen corresponding path program 1 times [2025-02-08 13:30:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987863125] [2025-02-08 13:30:04,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:04,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:04,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:04,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:04,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987863125] [2025-02-08 13:30:04,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987863125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:04,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108293057] [2025-02-08 13:30:04,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:04,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:04,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:04,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:04,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 13:30:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:30:05,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:30:05,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:05,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:05,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:05,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 13:30:05,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108293057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:05,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400188363] [2025-02-08 13:30:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:05,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:05,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:05,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:05,534 INFO L87 Difference]: Start difference. First operand 195 states and 243 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:09,552 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:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:09,607 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:30:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-08 13:30:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:09,609 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:30:09,609 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:30:09,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:09,609 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 187 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:09,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:09,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:30:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-02-08 13:30:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 179 states have internal predecessors, (226), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2025-02-08 13:30:09,617 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 11 [2025-02-08 13:30:09,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:09,618 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2025-02-08 13:30:09,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:09,618 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2025-02-08 13:30:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:30:09,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:09,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:09,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 13:30:09,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:09,823 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:09,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 156142212, now seen corresponding path program 1 times [2025-02-08 13:30:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772872216] [2025-02-08 13:30:09,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:10,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:10,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:10,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772872216] [2025-02-08 13:30:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772872216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:10,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961619155] [2025-02-08 13:30:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:10,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:10,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:10,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 13:30:10,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:30:10,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:30:10,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:10,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:10,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:10,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:10,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 13:30:10,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961619155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:10,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:10,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:30:10,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429142205] [2025-02-08 13:30:10,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:10,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:10,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:10,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:10,751 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:10,806 INFO L93 Difference]: Finished difference Result 390 states and 488 transitions. [2025-02-08 13:30:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-02-08 13:30:10,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:10,807 INFO L225 Difference]: With dead ends: 390 [2025-02-08 13:30:10,807 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:30:10,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:10,808 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:10,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 695 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:30:10,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:30:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 188 states have internal predecessors, (235), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2025-02-08 13:30:10,822 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 12 [2025-02-08 13:30:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2025-02-08 13:30:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2025-02-08 13:30:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:30:10,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:10,823 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:10,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:30:11,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:11,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:11,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 846196387, now seen corresponding path program 2 times [2025-02-08 13:30:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:11,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298205666] [2025-02-08 13:30:11,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:11,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:11,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:30:11,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:30:11,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:11,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298205666] [2025-02-08 13:30:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298205666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:11,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:30:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343099958] [2025-02-08 13:30:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:11,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:30:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:11,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:30:11,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:11,527 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:15,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:15,662 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2025-02-08 13:30:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:30:15,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-02-08 13:30:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:15,663 INFO L225 Difference]: With dead ends: 202 [2025-02-08 13:30:15,664 INFO L226 Difference]: Without dead ends: 200 [2025-02-08 13:30:15,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:15,664 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 186 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:15,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 710 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-08 13:30:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-02-08 13:30:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 159 states have (on average 1.4654088050314464) internal successors, (233), 186 states have internal predecessors, (233), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2025-02-08 13:30:15,681 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 21 [2025-02-08 13:30:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:15,682 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2025-02-08 13:30:15,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2025-02-08 13:30:15,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:30:15,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:15,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:30:15,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:15,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2055946829, now seen corresponding path program 1 times [2025-02-08 13:30:15,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:15,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005360128] [2025-02-08 13:30:15,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:15,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:15,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:30:15,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:30:15,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:15,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:16,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:16,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005360128] [2025-02-08 13:30:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005360128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:16,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:16,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:30:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689621964] [2025-02-08 13:30:16,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:16,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:16,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:16,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:16,018 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:20,036 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:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,082 INFO L93 Difference]: Finished difference Result 384 states and 481 transitions. [2025-02-08 13:30:20,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:20,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:30:20,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,084 INFO L225 Difference]: With dead ends: 384 [2025-02-08 13:30:20,085 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 13:30:20,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:20,086 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:20,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 13:30:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-08 13:30:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2025-02-08 13:30:20,095 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 26 [2025-02-08 13:30:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,095 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2025-02-08 13:30:20,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2025-02-08 13:30:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:30:20,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,096 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:20,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:30:20,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -690491139, now seen corresponding path program 1 times [2025-02-08 13:30:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542029304] [2025-02-08 13:30:20,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:30:20,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:30:20,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:20,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542029304] [2025-02-08 13:30:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542029304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300310649] [2025-02-08 13:30:20,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:20,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:20,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:20,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:20,433 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:20,477 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2025-02-08 13:30:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 13:30:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:20,478 INFO L225 Difference]: With dead ends: 320 [2025-02-08 13:30:20,480 INFO L226 Difference]: Without dead ends: 318 [2025-02-08 13:30:20,480 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:20,480 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 140 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:20,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 457 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-08 13:30:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 207. [2025-02-08 13:30:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 166 states have (on average 1.4518072289156627) internal successors, (241), 193 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 256 transitions. [2025-02-08 13:30:20,490 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 256 transitions. Word has length 27 [2025-02-08 13:30:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:20,491 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 256 transitions. [2025-02-08 13:30:20,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2025-02-08 13:30:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:20,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:20,491 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:20,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:30:20,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:20,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1810608804, now seen corresponding path program 1 times [2025-02-08 13:30:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:20,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398574873] [2025-02-08 13:30:20,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:20,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:20,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:20,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:20,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398574873] [2025-02-08 13:30:20,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398574873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:20,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926024961] [2025-02-08 13:30:20,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:20,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:20,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:20,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 13:30:21,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:21,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:21,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:21,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:30:21,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:30:21,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926024961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:21,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:30:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695407326] [2025-02-08 13:30:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:21,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:21,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:21,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:21,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:21,451 INFO L87 Difference]: Start difference. First operand 207 states and 256 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,467 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:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:25,524 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2025-02-08 13:30:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:30:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:25,525 INFO L225 Difference]: With dead ends: 207 [2025-02-08 13:30:25,525 INFO L226 Difference]: Without dead ends: 206 [2025-02-08 13:30:25,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:25,527 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:25,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-08 13:30:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-02-08 13:30:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 192 states have internal predecessors, (240), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 255 transitions. [2025-02-08 13:30:25,538 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 255 transitions. Word has length 29 [2025-02-08 13:30:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:25,538 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 255 transitions. [2025-02-08 13:30:25,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:25,539 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 255 transitions. [2025-02-08 13:30:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:30:25,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:25,539 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:25,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 13:30:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 13:30:25,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1810608644, now seen corresponding path program 1 times [2025-02-08 13:30:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749969935] [2025-02-08 13:30:25,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:25,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:25,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:25,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:30:26,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749969935] [2025-02-08 13:30:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749969935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:26,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688328253] [2025-02-08 13:30:26,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:26,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:26,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:26,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:26,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 13:30:26,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:30:26,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:30:26,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:26,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:26,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:30:26,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:26,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 13:30:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688328253] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:26,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:30:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663801890] [2025-02-08 13:30:26,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:26,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:30:26,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:26,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:30:26,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:26,866 INFO L87 Difference]: Start difference. First operand 206 states and 255 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:30,883 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:34,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:35,089 INFO L93 Difference]: Finished difference Result 415 states and 519 transitions. [2025-02-08 13:30:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:30:35,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-02-08 13:30:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:35,091 INFO L225 Difference]: With dead ends: 415 [2025-02-08 13:30:35,091 INFO L226 Difference]: Without dead ends: 223 [2025-02-08 13:30:35,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:30:35,091 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 5 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:35,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1334 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 13:30:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-08 13:30:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-02-08 13:30:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 209 states have internal predecessors, (257), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:35,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2025-02-08 13:30:35,099 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 29 [2025-02-08 13:30:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2025-02-08 13:30:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 13:30:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2025-02-08 13:30:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:35,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:35,103 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:35,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 13:30:35,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:30:35,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:35,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:35,304 INFO L85 PathProgramCache]: Analyzing trace with hash -510157334, now seen corresponding path program 1 times [2025-02-08 13:30:35,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:35,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798518958] [2025-02-08 13:30:35,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:35,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:35,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:35,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:35,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:35,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798518958] [2025-02-08 13:30:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798518958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:35,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:35,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015166940] [2025-02-08 13:30:35,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:35,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:35,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:35,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:35,657 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:39,673 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:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:39,768 INFO L93 Difference]: Finished difference Result 234 states and 285 transitions. [2025-02-08 13:30:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:39,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:30:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:39,770 INFO L225 Difference]: With dead ends: 234 [2025-02-08 13:30:39,770 INFO L226 Difference]: Without dead ends: 233 [2025-02-08 13:30:39,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:39,771 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:39,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:30:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-08 13:30:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2025-02-08 13:30:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 193 states have (on average 1.3937823834196892) internal successors, (269), 218 states have internal predecessors, (269), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2025-02-08 13:30:39,777 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 48 [2025-02-08 13:30:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:39,777 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2025-02-08 13:30:39,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2025-02-08 13:30:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:30:39,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:39,778 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:39,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:30:39,778 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -510152369, now seen corresponding path program 1 times [2025-02-08 13:30:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638700294] [2025-02-08 13:30:39,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:39,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:30:39,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:30:39,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:39,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:30:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638700294] [2025-02-08 13:30:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638700294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:40,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:40,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:40,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563237316] [2025-02-08 13:30:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:40,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:40,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:40,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:40,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:40,074 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:44,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:44,129 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2025-02-08 13:30:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-08 13:30:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:44,130 INFO L225 Difference]: With dead ends: 232 [2025-02-08 13:30:44,130 INFO L226 Difference]: Without dead ends: 231 [2025-02-08 13:30:44,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:44,131 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:44,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-08 13:30:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-08 13:30:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 227. [2025-02-08 13:30:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 189 states have (on average 1.3915343915343916) internal successors, (263), 213 states have internal predecessors, (263), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 278 transitions. [2025-02-08 13:30:44,137 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 278 transitions. Word has length 48 [2025-02-08 13:30:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 278 transitions. [2025-02-08 13:30:44,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 278 transitions. [2025-02-08 13:30:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:30:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:44,138 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:44,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:30:44,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1253781985, now seen corresponding path program 1 times [2025-02-08 13:30:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:44,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997576330] [2025-02-08 13:30:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:44,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:44,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:44,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997576330] [2025-02-08 13:30:44,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997576330] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:44,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967603312] [2025-02-08 13:30:44,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:44,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:44,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:44,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:44,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 13:30:45,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:30:45,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:30:45,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:45,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:45,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 1696 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:45,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:45,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:30:45,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967603312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:30:45,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:30:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291151550] [2025-02-08 13:30:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:30:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:45,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:30:45,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:45,182 INFO L87 Difference]: Start difference. First operand 227 states and 278 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:45,252 INFO L93 Difference]: Finished difference Result 338 states and 426 transitions. [2025-02-08 13:30:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:30:45,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:30:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:45,256 INFO L225 Difference]: With dead ends: 338 [2025-02-08 13:30:45,256 INFO L226 Difference]: Without dead ends: 337 [2025-02-08 13:30:45,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:30:45,257 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 279 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:45,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 684 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-02-08 13:30:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 226. [2025-02-08 13:30:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 212 states have internal predecessors, (262), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2025-02-08 13:30:45,266 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 49 [2025-02-08 13:30:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:45,267 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2025-02-08 13:30:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2025-02-08 13:30:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:30:45,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:45,267 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:45,278 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:30:45,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 13:30:45,472 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:45,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 212537116, now seen corresponding path program 1 times [2025-02-08 13:30:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179124519] [2025-02-08 13:30:45,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:45,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:45,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:45,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179124519] [2025-02-08 13:30:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179124519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:45,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211510335] [2025-02-08 13:30:45,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:45,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:45,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:30:45,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 13:30:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:30:46,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:30:46,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:46,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:46,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1697 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:46,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:46,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:46,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211510335] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:46,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:46,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:30:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859581365] [2025-02-08 13:30:46,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:46,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:46,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:46,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:46,747 INFO L87 Difference]: Start difference. First operand 226 states and 277 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:46,876 INFO L93 Difference]: Finished difference Result 683 states and 887 transitions. [2025-02-08 13:30:46,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:46,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-08 13:30:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:46,879 INFO L225 Difference]: With dead ends: 683 [2025-02-08 13:30:46,879 INFO L226 Difference]: Without dead ends: 682 [2025-02-08 13:30:46,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:46,881 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 936 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:46,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 978 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-02-08 13:30:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 238. [2025-02-08 13:30:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 224 states have internal predecessors, (277), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 292 transitions. [2025-02-08 13:30:46,894 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 292 transitions. Word has length 50 [2025-02-08 13:30:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 292 transitions. [2025-02-08 13:30:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 292 transitions. [2025-02-08 13:30:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:30:46,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:46,896 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:46,916 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:47,096 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:47,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:47,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:47,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1721185601, now seen corresponding path program 1 times [2025-02-08 13:30:47,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:47,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697993654] [2025-02-08 13:30:47,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:30:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:30:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:30:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697993654] [2025-02-08 13:30:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697993654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:30:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395375962] [2025-02-08 13:30:47,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:47,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:30:47,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:30:47,408 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:47,413 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:48,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:30:48,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:30:48,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:48,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:48,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:30:48,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:30:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:30:48,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:30:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:30:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395375962] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:30:48,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:30:48,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:30:48,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231962977] [2025-02-08 13:30:48,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:30:48,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:30:48,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:48,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:30:48,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:48,217 INFO L87 Difference]: Start difference. First operand 238 states and 292 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:51,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:55,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:30:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:55,521 INFO L93 Difference]: Finished difference Result 452 states and 562 transitions. [2025-02-08 13:30:55,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:30:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:30:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:55,523 INFO L225 Difference]: With dead ends: 452 [2025-02-08 13:30:55,523 INFO L226 Difference]: Without dead ends: 256 [2025-02-08 13:30:55,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:30:55,525 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:55,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 675 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2025-02-08 13:30:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-08 13:30:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-02-08 13:30:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 242 states have internal predecessors, (295), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:30:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 310 transitions. [2025-02-08 13:30:55,533 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 310 transitions. Word has length 55 [2025-02-08 13:30:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:55,533 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 310 transitions. [2025-02-08 13:30:55,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:30:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 310 transitions. [2025-02-08 13:30:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:30:55,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:55,534 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:55,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 13:30:55,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:30:55,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:55,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 698076607, now seen corresponding path program 1 times [2025-02-08 13:30:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952639104] [2025-02-08 13:30:55,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:55,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:30:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:30:55,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:55,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952639104] [2025-02-08 13:30:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952639104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:56,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138038657] [2025-02-08 13:30:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:56,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,097 INFO L87 Difference]: Start difference. First operand 256 states and 310 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:30:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:56,213 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2025-02-08 13:30:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:56,213 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:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:56,215 INFO L225 Difference]: With dead ends: 503 [2025-02-08 13:30:56,215 INFO L226 Difference]: Without dead ends: 349 [2025-02-08 13:30:56,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,216 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:56,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 402 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:30:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-08 13:30:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 298. [2025-02-08 13:30:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3461538461538463) internal successors, (350), 283 states have internal predecessors, (350), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:30:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 367 transitions. [2025-02-08 13:30:56,228 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 367 transitions. Word has length 59 [2025-02-08 13:30:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:56,229 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 367 transitions. [2025-02-08 13:30:56,229 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:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2025-02-08 13:30:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:30:56,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:56,229 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:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:30:56,230 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 836760221, now seen corresponding path program 1 times [2025-02-08 13:30:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734139072] [2025-02-08 13:30:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:30:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:56,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:30:56,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:30:56,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:30:56,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:30:56,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:56,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734139072] [2025-02-08 13:30:56,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734139072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:30:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886778621] [2025-02-08 13:30:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:56,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:30:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:56,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:30:56,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,508 INFO L87 Difference]: Start difference. First operand 298 states and 367 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:30:56,547 INFO L93 Difference]: Finished difference Result 300 states and 367 transitions. [2025-02-08 13:30:56,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:30:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-02-08 13:30:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:30:56,549 INFO L225 Difference]: With dead ends: 300 [2025-02-08 13:30:56,549 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 13:30:56,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:30:56,550 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:30:56,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:30:56,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 13:30:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 13:30:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3384615384615384) internal successors, (348), 283 states have internal predecessors, (348), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:30:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 365 transitions. [2025-02-08 13:30:56,560 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 365 transitions. Word has length 61 [2025-02-08 13:30:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:30:56,561 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 365 transitions. [2025-02-08 13:30:56,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:30:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 365 transitions. [2025-02-08 13:30:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:30:56,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:30:56,561 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:30:56,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:30:56,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:30:56,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:30:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2101684912, now seen corresponding path program 2 times [2025-02-08 13:30:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:30:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873631083] [2025-02-08 13:30:56,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:30:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:30:56,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 13:30:56,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-02-08 13:30:56,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:30:56,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:30:57,003 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:57,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:30:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873631083] [2025-02-08 13:30:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873631083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:30:57,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:30:57,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:30:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711187595] [2025-02-08 13:30:57,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:30:57,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:30:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:30:57,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:30:57,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:30:57,004 INFO L87 Difference]: Start difference. First operand 298 states and 365 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:01,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:05,035 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:31:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:05,218 INFO L93 Difference]: Finished difference Result 526 states and 654 transitions. [2025-02-08 13:31:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:05,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 13:31:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:05,222 INFO L225 Difference]: With dead ends: 526 [2025-02-08 13:31:05,222 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 13:31:05,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:05,223 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 186 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:05,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 900 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2025-02-08 13:31:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 13:31:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 13:31:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 283 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 364 transitions. [2025-02-08 13:31:05,232 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 364 transitions. Word has length 62 [2025-02-08 13:31:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:05,232 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 364 transitions. [2025-02-08 13:31:05,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:31:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 364 transitions. [2025-02-08 13:31:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:31:05,232 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:05,233 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:05,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:31:05,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:31:05,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 27554513, now seen corresponding path program 2 times [2025-02-08 13:31:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134760150] [2025-02-08 13:31:05,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:05,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:31:05,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:31:05,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:05,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:05,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134760150] [2025-02-08 13:31:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134760150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690530645] [2025-02-08 13:31:05,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:31:05,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:05,542 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:31:05,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:31:06,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:31:06,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:31:06,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:31:06,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:06,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:31:06,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:06,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:31:06,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690530645] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:06,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:31:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370297227] [2025-02-08 13:31:06,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:31:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:06,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:31:06,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:31:06,517 INFO L87 Difference]: Start difference. First operand 298 states and 364 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:10,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:14,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:18,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:20,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:31:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:31:20,940 INFO L93 Difference]: Finished difference Result 298 states and 364 transitions. [2025-02-08 13:31:20,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:31:20,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-02-08 13:31:20,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:31:20,941 INFO L225 Difference]: With dead ends: 298 [2025-02-08 13:31:20,941 INFO L226 Difference]: Without dead ends: 297 [2025-02-08 13:31:20,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:31:20,942 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 172 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:31:20,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 14.4s Time] [2025-02-08 13:31:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-08 13:31:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 282. [2025-02-08 13:31:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 245 states have (on average 1.346938775510204) internal successors, (330), 267 states have internal predecessors, (330), 10 states have call successors, (10), 7 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:31:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2025-02-08 13:31:20,950 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 73 [2025-02-08 13:31:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:31:20,950 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2025-02-08 13:31:20,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:31:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2025-02-08 13:31:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:31:20,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:31:20,950 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:31:20,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 13:31:21,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:21,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 75 more)] === [2025-02-08 13:31:21,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:31:21,156 INFO L85 PathProgramCache]: Analyzing trace with hash 609574808, now seen corresponding path program 1 times [2025-02-08 13:31:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:31:21,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839346186] [2025-02-08 13:31:21,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:21,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:31:21,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:31:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:31:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:31:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839346186] [2025-02-08 13:31:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839346186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:31:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500676744] [2025-02-08 13:31:21,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:31:21,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:31:21,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:31:21,543 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:31:21,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:31:22,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:31:22,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:31:22,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:31:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:31:22,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 1870 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:31:22,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:31:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:22,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:31:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:31:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500676744] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:31:22,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:31:22,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:31:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401921408] [2025-02-08 13:31:22,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:31:22,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:31:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:31:22,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:31:22,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:31:22,598 INFO L87 Difference]: Start difference. First operand 282 states and 347 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)