./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-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/printf-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 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:27:13,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:27:13,264 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:27:13,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:27:13,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:27:13,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:27:13,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:27:13,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:27:13,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:27:13,296 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:27:13,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:27:13,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:27:13,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:27:13,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:27:13,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:27:13,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:27:13,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:13,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:27:13,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:27:13,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:27:13,300 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 -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-02-08 13:27:13,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:27:13,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:27:13,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:27:13,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:27:13,552 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:27:13,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-02-08 13:27:14,744 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e5bd8bc/e39b798812d54ae09f2193bebd7c01dc/FLAG74dacc2c9 [2025-02-08 13:27:15,145 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:27:15,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-02-08 13:27:15,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e5bd8bc/e39b798812d54ae09f2193bebd7c01dc/FLAG74dacc2c9 [2025-02-08 13:27:15,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/69e5bd8bc/e39b798812d54ae09f2193bebd7c01dc [2025-02-08 13:27:15,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:27:15,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:27:15,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:15,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:27:15,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:27:15,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:15" (1/1) ... [2025-02-08 13:27:15,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223c2ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:15, skipping insertion in model container [2025-02-08 13:27:15,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:27:15" (1/1) ... [2025-02-08 13:27:15,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:27:15,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:15,966 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:27:16,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:27:16,227 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:27:16,233 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:27:16,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16 WrapperNode [2025-02-08 13:27:16,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:27:16,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:16,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:27:16,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:27:16,238 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:27:16" (1/1) ... [2025-02-08 13:27:16,271 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:27:16" (1/1) ... [2025-02-08 13:27:16,337 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1869 [2025-02-08 13:27:16,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:27:16,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:27:16,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:27:16,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:27:16,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,362 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:27:16,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:27:16,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:27:16,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:27:16,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:27:16,455 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (1/1) ... [2025-02-08 13:27:16,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:16,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:16,484 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:27:16,489 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:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-02-08 13:27:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-02-08 13:27:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:27:16,508 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:27:16,508 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:27:16,509 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-02-08 13:27:16,509 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-02-08 13:27:16,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:27:16,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:27:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:27:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-02-08 13:27:16,512 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-02-08 13:27:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:27:16,512 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-02-08 13:27:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-02-08 13:27:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-02-08 13:27:16,513 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-02-08 13:27:16,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-02-08 13:27:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:27:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-08 13:27:16,514 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-08 13:27:16,903 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:27:16,905 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:27:16,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-02-08 13:27:17,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: SUMMARY for call reach_error(); srcloc: null [2025-02-08 13:27:17,241 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678: assume -9223372036854775808 <= conv_strtoull_#t~ret142#1 && conv_strtoull_#t~ret142#1 <= 9223372036854775807;conv_strtoull_~return_value_bb_strtoll$1~0#1 := conv_strtoull_#t~ret142#1;havoc conv_strtoull_#t~ret142#1; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2678-1: SUMMARY for call conv_strtoull_#t~ret142#1 := bb_strtoll(conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, 0, 0, 0); srcloc: null [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset;conv_strtoull_#t~ret140#1 := bb_strtoull_#res#1;havoc bb_strtoull_#t~mem103#1, bb_strtoull_#t~ret104#1, bb_strtoull_#t~ret105#1, bb_strtoull_#t~nondet106#1, bb_strtoull_#t~ret107#1, bb_strtoull_~arg#1.base, bb_strtoull_~arg#1.offset, bb_strtoull_~endp#1.base, bb_strtoull_~endp#1.offset, bb_strtoull_~base#1, bb_strtoull_~v~2#1, bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset, bb_strtoull_~return_value_bb_ascii_isalnum$2~0#1, bb_strtoull_~return_value_ret_ERANGE$1~0#1, bb_strtoull_~return_value_handle_errors$3~0#1;havoc bb_strtoull_#in~arg#1.base, bb_strtoull_#in~arg#1.offset, bb_strtoull_#in~endp#1.base, bb_strtoull_#in~endp#1.offset, bb_strtoull_#in~base#1;assume { :end_inline_bb_strtoull } true;call write~int(conv_strtoull_#t~ret140#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_#t~ret140#1;call conv_strtoull_#t~mem141#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: havoc conv_strtoull_#t~ret140#1, conv_strtoull_#t~mem141#1, conv_strtoull_#t~ret142#1, conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~arg#1.base, conv_strtoull_~arg#1.offset, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset;havoc conv_strtoull_#in~arg#1.base, conv_strtoull_#in~arg#1.offset, conv_strtoull_#in~result#1.base, conv_strtoull_#in~result#1.offset;assume { :end_inline_conv_strtoull } true; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2683: call write~int(conv_strtoull_~return_value_bb_strtoll$1~0#1, conv_strtoull_~result#1.base, conv_strtoull_~result#1.offset, 8);havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3257: utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset := utoa_to_buf_#res#1.base, utoa_to_buf_#res#1.offset;havoc utoa_to_buf_~n#1, utoa_to_buf_~buf#1.base, utoa_to_buf_~buf#1.offset, utoa_to_buf_~buflen#1, utoa_to_buf_~i~0#1, utoa_to_buf_~out~0#1, utoa_to_buf_~res~0#1, utoa_to_buf_~tmp_post$1~1#1.base, utoa_to_buf_~tmp_post$1~1#1.offset;havoc utoa_to_buf_#in~n#1, utoa_to_buf_#in~buf#1.base, utoa_to_buf_#in~buf#1.offset, utoa_to_buf_#in~buflen#1;assume { :end_inline_utoa_to_buf } true;utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset := utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset;call write~int(0, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset, 1);utoa_#res#1.base, utoa_#res#1.offset := ~#local_buf~0.base, ~#local_buf~0.offset; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679: assume !!(conv_strtoull_~result#1.base == 0 && conv_strtoull_~result#1.offset == 0); [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1;havoc conv_strtoull_~return_value_bb_strtoll$1~0#1; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: assume !!(0 == conv_strtoull_#t~mem141#1);havoc conv_strtoull_#t~mem141#1; [2025-02-08 13:27:17,242 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2754: #t~ret156#1.base, #t~ret156#1.offset := utoa_#res#1.base, utoa_#res#1.offset;havoc utoa_#t~ret316#1.base, utoa_#t~ret316#1.offset, utoa_~n#1, utoa_~return_value_utoa_to_buf$1~0#1.base, utoa_~return_value_utoa_to_buf$1~0#1.offset;havoc utoa_#in~n#1;assume { :end_inline_utoa } true;~arg#1.base, ~arg#1.offset := #t~ret156#1.base, #t~ret156#1.offset;havoc #t~mem155#1;havoc #t~ret156#1.base, #t~ret156#1.offset; [2025-02-08 13:27:17,313 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-02-08 13:27:17,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret208#1; [2025-02-08 13:27:17,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2967: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret209#1; [2025-02-08 13:27:17,438 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2959: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2984: assume { :begin_inline_my_xstrtod } true;my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset := my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;call my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset := #Ultimate.allocOnStack(8); [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret214#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2993: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret215#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume ~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2985: assume !(~have_width~0#1.base == 0 && ~have_width~0#1.offset == 0); [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779-1: SUMMARY for call my_xstrtoll_#t~ret163#1 := multiconvert(my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, #funAddr~conv_strtoll.base, #funAddr~conv_strtoll.offset); srcloc: null [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: assume -2147483648 <= my_xstrtoll_#t~ret163#1 && my_xstrtoll_#t~ret163#1 <= 2147483647;my_xstrtoll_~return_value_multiconvert$1~0#1 := my_xstrtoll_#t~ret163#1;havoc my_xstrtoll_#t~ret163#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret206#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2961: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret207#1; [2025-02-08 13:27:17,439 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: assume -2147483648 <= my_xstrtoull_#t~ret165#1 && my_xstrtoull_#t~ret165#1 <= 2147483647;my_xstrtoull_~return_value_multiconvert$1~1#1 := my_xstrtoull_#t~ret165#1;havoc my_xstrtoull_#t~ret165#1; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788-1: SUMMARY for call my_xstrtoull_#t~ret165#1 := multiconvert(my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, #funAddr~conv_strtoull.base, #funAddr~conv_strtoull.offset); srcloc: null [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !(0 == my_xstrtoll_~return_value_multiconvert$1~0#1);call write~int(0, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8); [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780: assume !!(0 == my_xstrtoll_~return_value_multiconvert$1~0#1); [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772: assume -2147483648 <= my_xstrtod_#t~ret161#1 && my_xstrtod_#t~ret161#1 <= 2147483647;havoc my_xstrtod_#t~ret161#1;call my_xstrtod_#t~mem162#1 := read~real(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, 8);my_xstrtod_#res#1 := my_xstrtod_#t~mem162#1;havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: SUMMARY for call my_xstrtod_#t~ret161#1 := multiconvert(my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset, #funAddr~conv_strtod.base, #funAddr~conv_strtod.offset); srcloc: null [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume ~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0;havoc #t~ret212#1; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2987: assume !(~have_prec~0#1.base == 0 && ~have_prec~0#1.offset == 0);havoc #t~ret213#1; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !(0 == my_xstrtoull_~return_value_multiconvert$1~1#1);call write~int(0, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8); [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2789: assume !!(0 == my_xstrtoull_~return_value_multiconvert$1~1#1); [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;#t~ret211#1 := my_xstrtod_#res#1;havoc my_xstrtod_#t~ret161#1, my_xstrtod_#t~mem162#1, my_xstrtod_~arg#1.base, my_xstrtod_~arg#1.offset, my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset;havoc my_xstrtod_#in~arg#1.base, my_xstrtod_#in~arg#1.offset;assume { :end_inline_my_xstrtod } true;~dv~0#1 := #t~ret211#1;havoc #t~ret211#1; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2980: ~llv~0#1 := ~argument#1.base + ~argument#1.offset; [2025-02-08 13:27:17,440 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset;#t~ret205#1 := my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;havoc my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;assume { :end_inline_my_xstrtoll } true;assume -9223372036854775808 <= #t~ret205#1 && #t~ret205#1 <= 9223372036854775807;~llv~0#1 := #t~ret205#1;havoc #t~ret205#1; [2025-02-08 13:27:17,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782-2: call my_xstrtoll_#t~mem164#1 := read~int(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, 8);my_xstrtoll_#res#1 := my_xstrtoll_#t~mem164#1;havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-02-08 13:27:17,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: assume { :begin_inline_my_xstrtoll } true;my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoll_#res#1;havoc my_xstrtoll_#t~ret163#1, my_xstrtoll_#t~mem164#1, my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset, my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset, my_xstrtoll_~return_value_multiconvert$1~0#1;my_xstrtoll_~arg#1.base, my_xstrtoll_~arg#1.offset := my_xstrtoll_#in~arg#1.base, my_xstrtoll_#in~arg#1.offset;call my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoll_~return_value_multiconvert$1~0#1; [2025-02-08 13:27:17,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset;#t~ret210#1 := my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;havoc my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;assume { :end_inline_my_xstrtoull } true;~return_value_my_xstrtoull$2~0#1 := #t~ret210#1;havoc #t~ret210#1;~llv~0#1 := (if ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 else ~return_value_my_xstrtoull$2~0#1 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616); [2025-02-08 13:27:17,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791-2: call my_xstrtoull_#t~mem166#1 := read~int(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, 8);my_xstrtoull_#res#1 := my_xstrtoull_#t~mem166#1;havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-02-08 13:27:17,441 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2974: havoc ~return_value_my_xstrtoull$2~0#1;assume { :begin_inline_my_xstrtoull } true;my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset := ~argument#1.base, ~argument#1.offset;havoc my_xstrtoull_#res#1;havoc my_xstrtoull_#t~ret165#1, my_xstrtoull_#t~mem166#1, my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset, my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset, my_xstrtoull_~return_value_multiconvert$1~1#1;my_xstrtoull_~arg#1.base, my_xstrtoull_~arg#1.offset := my_xstrtoull_#in~arg#1.base, my_xstrtoull_#in~arg#1.offset;call my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset := #Ultimate.allocOnStack(8);havoc my_xstrtoull_~return_value_multiconvert$1~1#1; [2025-02-08 13:27:17,579 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: 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~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~1#1;havoc safe_write_~tmp_if_expr$1~4#1; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2696: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: 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:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: full_write_#t~ret144#1 := safe_write_#res#1;havoc safe_write_#t~ret314#1, safe_write_#t~mem315#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~1#1, safe_write_~tmp_if_expr$1~4#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~ret144#1 && full_write_#t~ret144#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret144#1;havoc full_write_#t~ret144#1; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume 0 != safe_write_~tmp_if_expr$1~4#1 % 256; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243-1: assume !(0 != safe_write_~tmp_if_expr$1~4#1 % 256); [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: 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~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet355#1;assume -9223372036854775808 <= write_#t~nondet355#1 && write_#t~nondet355#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet355#1;havoc write_#t~nondet355#1; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3243: assume !true; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3252-1: safe_write_#res#1 := safe_write_~n~1#1; [2025-02-08 13:27:17,580 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume full_write_~cc~0#1 < 0; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2699: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: safe_write_#t~ret314#1 := write_#res#1;havoc write_#t~nondet355#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret314#1 && safe_write_#t~ret314#1 <= 9223372036854775807;safe_write_~n~1#1 := safe_write_#t~ret314#1;havoc safe_write_#t~ret314#1; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: write_#res#1 := write_~ret~1#1; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume safe_write_~n~1#1 < 0;call safe_write_#t~mem315#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem315#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3246: assume !(safe_write_~n~1#1 < 0);safe_write_~tmp_if_expr$1~4#1 := 0; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2701: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: #t~ret129#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet143#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret129#1 && #t~ret129#1 <= 2147483647;havoc #t~ret129#1;call #t~mem130#1.base, #t~mem130#1.offset := read~$Pointer$(~#msg~0#1.base, ~#msg~0#1.offset, 8);assume { :begin_inline_full_write } true;full_write_#in~fd#1, full_write_#in~buf#1.base, full_write_#in~buf#1.offset, full_write_#in~len#1 := 2, #t~mem130#1.base, #t~mem130#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret144#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:27:17,581 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636: #t~ret131#1 := full_write_#res#1;havoc full_write_#t~ret144#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~ret131#1 && #t~ret131#1 <= 9223372036854775807;havoc #t~mem130#1.base, #t~mem130#1.offset;havoc #t~ret131#1; [2025-02-08 13:27:23,333 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-02-08 13:27:23,334 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);call __main_#t~mem311#1.base, __main_#t~mem311#1.offset := read~$Pointer$(__main_~argv2~0#1.base, __main_~argv2~0#1.offset, 8);__main_~tmp_if_expr$2~1#1 := (if 0 == (if 0 != (if __main_#t~mem311#1.base != 0 || __main_#t~mem311#1.offset != 0 then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem311#1.base, __main_#t~mem311#1.offset; [2025-02-08 13:27:23,334 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3224: assume !!(__main_~argv#1.base == __main_~argv2~0#1.base && __main_~argv#1.offset >= __main_~argv2~0#1.offset);__main_~tmp_if_expr$2~1#1 := 0; [2025-02-08 13:27:23,334 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset;__main_#t~ret310#1.base, __main_#t~ret310#1.offset := print_formatted_#res#1.base, print_formatted_#res#1.offset;havoc print_formatted_#t~mem222#1.base, print_formatted_#t~mem222#1.offset, print_formatted_#t~mem223#1, print_formatted_#t~mem224#1.base, print_formatted_#t~mem224#1.offset, print_formatted_#t~mem225#1, print_formatted_#t~mem226#1.base, print_formatted_#t~mem226#1.offset, print_formatted_#t~mem227#1, print_formatted_#t~mem228#1.base, print_formatted_#t~mem228#1.offset, print_formatted_#t~mem229#1.base, print_formatted_#t~mem229#1.offset, print_formatted_#t~mem230#1.base, print_formatted_#t~mem230#1.offset, print_formatted_#t~mem231#1, print_formatted_#t~ret232#1, print_formatted_#t~mem233#1.base, print_formatted_#t~mem233#1.offset, print_formatted_#t~mem234#1, print_formatted_#t~mem235#1.base, print_formatted_#t~mem235#1.offset, print_formatted_#t~mem236#1.base, print_formatted_#t~mem236#1.offset, print_formatted_#t~mem237#1.base, print_formatted_#t~mem237#1.offset, print_formatted_#t~mem238#1, print_formatted_#t~nondet239#1.base, print_formatted_#t~nondet239#1.offset, print_formatted_#t~mem240#1.base, print_formatted_#t~mem240#1.offset, print_formatted_#t~mem241#1, print_formatted_#t~mem242#1.base, print_formatted_#t~mem242#1.offset, print_formatted_#t~mem243#1.base, print_formatted_#t~mem243#1.offset, print_formatted_#t~mem244#1, print_formatted_#t~mem245#1.base, print_formatted_#t~mem245#1.offset, print_formatted_#t~mem246#1.base, print_formatted_#t~mem246#1.offset, print_formatted_#t~mem247#1.base, print_formatted_#t~mem247#1.offset, print_formatted_#t~ret248#1, print_formatted_#t~mem249#1.base, print_formatted_#t~mem249#1.offset, print_formatted_#t~mem250#1, print_formatted_#t~mem251#1.base, print_formatted_#t~mem251#1.offset, print_formatted_#t~mem252#1.base, print_formatted_#t~mem252#1.offset, print_formatted_#t~mem253#1, print_formatted_#t~mem254#1.base, print_formatted_#t~mem254#1.offset, print_formatted_#t~mem255#1.base, print_formatted_#t~mem255#1.offset, print_formatted_#t~mem256#1, print_formatted_#t~mem257#1.base, print_formatted_#t~mem257#1.offset, print_formatted_#t~mem258#1.base, print_formatted_#t~mem258#1.offset, print_formatted_#t~mem259#1.base, print_formatted_#t~mem259#1.offset, print_formatted_#t~ret260#1, print_formatted_#t~mem261#1.base, print_formatted_#t~mem261#1.offset, print_formatted_#t~mem262#1, print_formatted_#t~mem263#1.base, print_formatted_#t~mem263#1.offset, print_formatted_#t~mem264#1.base, print_formatted_#t~mem264#1.offset, print_formatted_#t~mem265#1, print_formatted_#t~bitwise266#1, print_formatted_#t~mem267#1.base, print_formatted_#t~mem267#1.offset, print_formatted_#t~mem268#1, print_formatted_#t~mem269#1.base, print_formatted_#t~mem269#1.offset, print_formatted_#t~mem270#1, print_formatted_#t~mem271#1.base, print_formatted_#t~mem271#1.offset, print_formatted_#t~mem272#1.base, print_formatted_#t~mem272#1.offset, print_formatted_#t~mem273#1.base, print_formatted_#t~mem273#1.offset, print_formatted_#t~mem274#1, print_formatted_#t~nondet275#1.base, print_formatted_#t~nondet275#1.offset, print_formatted_#t~mem276#1.base, print_formatted_#t~mem276#1.offset, print_formatted_#t~mem277#1, print_formatted_#t~short278#1, print_formatted_#t~varargs279#1.base, print_formatted_#t~varargs279#1.offset, print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset, print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset, print_formatted_#t~mem282#1, print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset, print_formatted_#t~mem283#1.base, print_formatted_#t~mem283#1.offset, print_formatted_#t~mem284#1.base, print_formatted_#t~mem284#1.offset, print_formatted_#t~mem285#1, print_formatted_#t~mem286#1, print_formatted_#t~bitwise287#1, print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset, print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, print_formatted_#t~mem290#1, print_formatted_#t~ret291#1, print_formatted_#t~ret292#1, print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset, print_formatted_#t~mem294#1.base, print_formatted_#t~mem294#1.offset, print_formatted_#t~mem295#1, print_formatted_#t~nondet296#1, print_formatted_#t~mem297#1.base, print_formatted_#t~mem297#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, print_formatted_~argv#1.base, print_formatted_~argv#1.offset, print_formatted_~conv_err#1.base, print_formatted_~conv_err#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1, print_formatted_~field_width~0#1, print_formatted_~precision~0#1, print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset, print_formatted_~tmp_post$1~0#1.base, print_formatted_~tmp_post$1~0#1.offset, print_formatted_~return_value___builtin_strchr$2~0#1.base, print_formatted_~return_value___builtin_strchr$2~0#1.offset, print_formatted_~tmp_post$3~0#1.base, print_formatted_~tmp_post$3~0#1.offset, print_formatted_~tmp_post$4~0#1.base, print_formatted_~tmp_post$4~0#1.offset, print_formatted_~tmp_post$7~1#1.base, print_formatted_~tmp_post$7~1#1.offset, print_formatted_~return_value_bb_process_escape_sequence$8~0#1;havoc print_formatted_#in~f#1.base, print_formatted_#in~f#1.offset, print_formatted_#in~argv#1.base, print_formatted_#in~argv#1.offset, print_formatted_#in~conv_err#1.base, print_formatted_#in~conv_err#1.offset;assume { :end_inline_print_formatted } true;__main_~argv2~0#1.base, __main_~argv2~0#1.offset := __main_#t~ret310#1.base, __main_#t~ret310#1.offset;havoc __main_#t~ret310#1.base, __main_#t~ret310#1.offset; [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3169: call print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem288#1.base, 1 + print_formatted_#t~mem288#1.offset, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem288#1.base, print_formatted_#t~mem288#1.offset;call print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call print_formatted_#t~mem290#1 := read~int(print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset, 1); [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset := xmalloc_#res#1.base, xmalloc_#res#1.offset;havoc xmalloc_#t~malloc318#1.base, xmalloc_#t~malloc318#1.offset, xmalloc_#t~varargs319#1.base, xmalloc_#t~varargs319#1.offset, xmalloc_~size#1, xmalloc_~ptr~0#1.base, xmalloc_~ptr~0#1.offset;havoc xmalloc_#in~size#1;assume { :end_inline_xmalloc } true;print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset := print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;havoc print_formatted_#t~ret280#1.base, print_formatted_#t~ret280#1.offset;print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset := print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset;assume { :begin_inline_#Ultimate.C_memcpy } true;#Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1 := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset, print_formatted_~direc_length~0#1 % 4294967296;havoc #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;#Ultimate.C_memcpy_#t~loopctr374#1 := 0; [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume 99 == print_formatted_#t~mem290#1;havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1;print_formatted_#res#1.base, print_formatted_#res#1.offset := print_formatted_~saved_argv~0#1.base, print_formatted_~saved_argv~0#1.offset;call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: assume !(99 == print_formatted_#t~mem290#1);havoc print_formatted_#t~mem289#1.base, print_formatted_#t~mem289#1.offset;havoc print_formatted_#t~mem290#1; [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr381#1, 8);#Ultimate.C_memcpy_#t~loopctr381#1 := 8 + #Ultimate.C_memcpy_#t~loopctr381#1; [2025-02-08 13:27:23,335 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memcpy_#t~loopctr381#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);assume #Ultimate.C_memcpy_#res#1.base == #Ultimate.C_memcpy_dest#1.base && #Ultimate.C_memcpy_#res#1.offset == #Ultimate.C_memcpy_dest#1.offset;print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset := #Ultimate.C_memcpy_#res#1.base, #Ultimate.C_memcpy_#res#1.offset;havoc #Ultimate.C_memcpy_#t~loopctr374#1, #Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_#t~loopctr381#1, #Ultimate.C_memcpy_#t~mem382#1.base, #Ultimate.C_memcpy_#t~mem382#1.offset;havoc #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset, #Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset, #Ultimate.C_memcpy_size#1;assume { :end_inline_#Ultimate.C_memcpy } true;havoc print_formatted_#t~memcpy~res281#1.base, print_formatted_#t~memcpy~res281#1.offset;call print_formatted_#t~mem282#1 := read~int(print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(print_formatted_#t~mem282#1, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 else (1 + print_formatted_~direc_length~0#1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);havoc print_formatted_#t~mem282#1;call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 <= 9223372036854775807 then (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 else (print_formatted_~direc_length~0#1 - 1) % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);call write~int(108, print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset + (if print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 <= 9223372036854775807 then print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 else print_formatted_~direc_length~0#1 % 4294967296 % 18446744073709551616 - 18446744073709551616), 1);print_formatted_~direc_length~0#1 := 2 + print_formatted_~direc_length~0#1;print_formatted_~direc_start~0#1.base, print_formatted_~direc_start~0#1.offset := print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset;havoc print_formatted_~return_value_xmalloc$6~0#1.base, print_formatted_~return_value_xmalloc$6~0#1.offset; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616;call #Ultimate.C_memcpy_#t~mem375#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem375#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 1);call #Ultimate.C_memcpy_#t~mem376#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem376#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 4);call #Ultimate.C_memcpy_#t~mem377#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem377#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem378#1 := read~unchecked~real(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~real(#Ultimate.C_memcpy_#t~mem378#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call #Ultimate.C_memcpy_#t~mem379#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem379#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 2);call #Ultimate.C_memcpy_#t~mem380#1 := read~unchecked~int(#Ultimate.C_memcpy_src#1.base, #Ultimate.C_memcpy_src#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);call write~unchecked~int(#Ultimate.C_memcpy_#t~mem380#1, #Ultimate.C_memcpy_dest#1.base, #Ultimate.C_memcpy_dest#1.offset + #Ultimate.C_memcpy_#t~loopctr374#1, 8);#Ultimate.C_memcpy_#t~loopctr374#1 := 1 + #Ultimate.C_memcpy_#t~loopctr374#1; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memcpy_#t~loopctr374#1 % 18446744073709551616 < #Ultimate.C_memcpy_size#1 % 18446744073709551616);#Ultimate.C_memcpy_#t~loopctr381#1 := 0; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume 0 != __main_~tmp_if_expr$2~1#1 % 256; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3220-1: assume !(0 != __main_~tmp_if_expr$2~1#1 % 256); [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172: assume -128 <= print_formatted_#t~ret291#1 && print_formatted_#t~ret291#1 <= 127;print_formatted_~return_value_bb_process_escape_sequence$8~0#1 := print_formatted_#t~ret291#1;havoc print_formatted_#t~ret291#1; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3172-1: SUMMARY for call print_formatted_#t~ret291#1 := bb_process_escape_sequence(print_formatted_~#f#1.base, print_formatted_~#f#1.offset); srcloc: null [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173-1: SUMMARY for call print_formatted_#t~ret292#1 := bb_putchar(print_formatted_~return_value_bb_process_escape_sequence$8~0#1); srcloc: null [2025-02-08 13:27:23,336 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: assume -2147483648 <= print_formatted_#t~ret292#1 && print_formatted_#t~ret292#1 <= 2147483647;havoc print_formatted_#t~ret292#1;call print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset := read~$Pointer$(print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);call write~$Pointer$(print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset - 1, print_formatted_~#f#1.base, print_formatted_~#f#1.offset, 8);havoc print_formatted_#t~mem293#1.base, print_formatted_#t~mem293#1.offset; [2025-02-08 13:27:23,417 INFO L? ?]: Removed 542 outVars from TransFormulas that were not future-live. [2025-02-08 13:27:23,417 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:27:23,445 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:27:23,447 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:27:23,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:23 BoogieIcfgContainer [2025-02-08 13:27:23,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:27:23,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:27:23,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:27:23,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:27:23,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:27:15" (1/3) ... [2025-02-08 13:27:23,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae57a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:23, skipping insertion in model container [2025-02-08 13:27:23,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:27:16" (2/3) ... [2025-02-08 13:27:23,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae57a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:27:23, skipping insertion in model container [2025-02-08 13:27:23,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:27:23" (3/3) ... [2025-02-08 13:27:23,456 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-02-08 13:27:23,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:27:23,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 449 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-02-08 13:27:23,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:27:23,528 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;@2091c7c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:27:23,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-02-08 13:27:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 433 states, 312 states have (on average 1.625) internal successors, (507), 388 states have internal predecessors, (507), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-08 13:27:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:27:23,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:23,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:27:23,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash 781459, now seen corresponding path program 1 times [2025-02-08 13:27:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282978869] [2025-02-08 13:27:23,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:23,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:24,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:27:24,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:27:24,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:24,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:24,590 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:27:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282978869] [2025-02-08 13:27:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282978869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:27:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369472633] [2025-02-08 13:27:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:24,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:24,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:24,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:24,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:24,611 INFO L87 Difference]: Start difference. First operand has 433 states, 312 states have (on average 1.625) internal successors, (507), 388 states have internal predecessors, (507), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) 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:27:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:24,718 INFO L93 Difference]: Finished difference Result 668 states and 954 transitions. [2025-02-08 13:27:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:24,721 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:27:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:24,725 INFO L225 Difference]: With dead ends: 668 [2025-02-08 13:27:24,725 INFO L226 Difference]: Without dead ends: 166 [2025-02-08 13:27:24,729 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:27:24,730 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:24,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 741 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-08 13:27:24,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-02-08 13:27:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.4108527131782946) internal successors, (182), 145 states have internal predecessors, (182), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2025-02-08 13:27:24,775 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 3 [2025-02-08 13:27:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2025-02-08 13:27:24,776 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:27:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2025-02-08 13:27:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:27:24,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:24,777 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:27:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:27:24,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:24,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:24,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1806325661, now seen corresponding path program 1 times [2025-02-08 13:27:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274975565] [2025-02-08 13:27:24,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:25,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:27:25,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:27:25,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:25,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:25,621 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:27:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:25,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274975565] [2025-02-08 13:27:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274975565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:25,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952987009] [2025-02-08 13:27:25,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:25,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:25,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:25,623 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:27:25,625 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:27:26,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:27:26,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:27:26,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:26,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1682 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:26,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:26,524 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:27:26,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:27:26,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952987009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:26,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:27:26,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:27:26,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487262410] [2025-02-08 13:27:26,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:26,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:27:26,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:26,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:27:26,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:26,526 INFO L87 Difference]: Start difference. First operand 166 states and 210 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:27:30,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:30,624 INFO L93 Difference]: Finished difference Result 166 states and 210 transitions. [2025-02-08 13:27:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:27:30,624 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:27:30,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:30,626 INFO L225 Difference]: With dead ends: 166 [2025-02-08 13:27:30,626 INFO L226 Difference]: Without dead ends: 165 [2025-02-08 13:27:30,626 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:27:30,631 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:30,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-08 13:27:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-08 13:27:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 144 states have internal predecessors, (181), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2025-02-08 13:27:30,643 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 6 [2025-02-08 13:27:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:30,648 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2025-02-08 13:27:30,648 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:27:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2025-02-08 13:27:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:27:30,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:30,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:27:30,658 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:27:30,849 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:27:30,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:30,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash 161521365, now seen corresponding path program 1 times [2025-02-08 13:27:30,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:30,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650768857] [2025-02-08 13:27:30,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:31,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:27:31,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:27:31,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:31,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:31,645 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:27:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:31,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650768857] [2025-02-08 13:27:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650768857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982339874] [2025-02-08 13:27:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:31,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:31,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:31,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:31,652 INFO L87 Difference]: Start difference. First operand 165 states and 209 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:27:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:31,718 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2025-02-08 13:27:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:31,719 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:27:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:31,720 INFO L225 Difference]: With dead ends: 165 [2025-02-08 13:27:31,720 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 13:27:31,720 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:27:31,721 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:31,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 13:27:31,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-02-08 13:27:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 141 states have internal predecessors, (178), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2025-02-08 13:27:31,735 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 7 [2025-02-08 13:27:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:31,735 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2025-02-08 13:27:31,736 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:27:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2025-02-08 13:27:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:27:31,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:31,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:31,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:27:31,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:31,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1819603307, now seen corresponding path program 1 times [2025-02-08 13:27:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:31,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404935044] [2025-02-08 13:27:31,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:32,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:27:32,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:27:32,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:32,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:32,562 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:27:32,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404935044] [2025-02-08 13:27:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404935044] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:32,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252902552] [2025-02-08 13:27:32,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:32,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:32,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:32,564 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:27:32,566 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:27:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:27:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:27:33,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:33,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:33,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:27:33,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:33,449 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:27:33,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:27:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252902552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:27:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:27:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345058283] [2025-02-08 13:27:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:33,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:33,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:33,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:33,451 INFO L87 Difference]: Start difference. First operand 162 states and 206 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:27:37,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:37,639 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2025-02-08 13:27:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:37,640 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:27:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:37,641 INFO L225 Difference]: With dead ends: 162 [2025-02-08 13:27:37,641 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 13:27:37,641 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:27:37,641 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 101 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 285 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:37,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 285 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:27:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 13:27:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 13:27:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 139 states have internal predecessors, (176), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2025-02-08 13:27:37,656 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 11 [2025-02-08 13:27:37,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:37,656 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2025-02-08 13:27:37,656 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:27:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2025-02-08 13:27:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:27:37,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:37,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:37,677 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:27:37,864 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:27:37,864 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:37,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 573128385, now seen corresponding path program 1 times [2025-02-08 13:27:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:37,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879598105] [2025-02-08 13:27:37,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:38,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:27:38,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:27:38,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:38,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:38,596 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:27:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879598105] [2025-02-08 13:27:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879598105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492203582] [2025-02-08 13:27:38,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:38,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:38,598 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:27:38,606 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:27:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:27:39,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:27:39,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:39,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:39,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:27:39,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:39,577 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:27:39,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:39,648 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:27:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492203582] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:39,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:27:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891510167] [2025-02-08 13:27:39,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:27:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:39,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:27:39,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:39,651 INFO L87 Difference]: Start difference. First operand 160 states and 204 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:27:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:39,734 INFO L93 Difference]: Finished difference Result 324 states and 414 transitions. [2025-02-08 13:27:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:27:39,736 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:27:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:39,737 INFO L225 Difference]: With dead ends: 324 [2025-02-08 13:27:39,738 INFO L226 Difference]: Without dead ends: 169 [2025-02-08 13:27:39,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:27:39,739 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 4 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:39,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:27:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-08 13:27:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-02-08 13:27:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3602941176470589) internal successors, (185), 148 states have internal predecessors, (185), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-02-08 13:27:39,752 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 12 [2025-02-08 13:27:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:39,755 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-02-08 13:27:39,755 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:27:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-02-08 13:27:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:27:39,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:39,755 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:27:39,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:27:39,956 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:27:39,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:39,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash 351709879, now seen corresponding path program 2 times [2025-02-08 13:27:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:39,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776618043] [2025-02-08 13:27:39,957 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:27:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:40,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:27:40,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:27:40,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:27:40,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:40,876 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:27:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776618043] [2025-02-08 13:27:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776618043] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:27:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224848687] [2025-02-08 13:27:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:40,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:27:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:40,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:27:40,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:27:40,878 INFO L87 Difference]: Start difference. First operand 169 states and 213 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:27:44,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:45,093 INFO L93 Difference]: Finished difference Result 169 states and 213 transitions. [2025-02-08 13:27:45,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:27:45,095 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:27:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:45,097 INFO L225 Difference]: With dead ends: 169 [2025-02-08 13:27:45,097 INFO L226 Difference]: Without dead ends: 167 [2025-02-08 13:27:45,097 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:27:45,097 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 100 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:45,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 657 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:27:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-08 13:27:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-08 13:27:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 146 states have internal predecessors, (183), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2025-02-08 13:27:45,114 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 21 [2025-02-08 13:27:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:45,114 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2025-02-08 13:27:45,115 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:27:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2025-02-08 13:27:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:27:45,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:45,115 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:27:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:27:45,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:45,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash 226913136, now seen corresponding path program 1 times [2025-02-08 13:27:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942414791] [2025-02-08 13:27:45,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:45,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:27:45,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:27:45,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:45,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:45,902 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:27:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942414791] [2025-02-08 13:27:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942414791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:27:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:27:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:27:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407813559] [2025-02-08 13:27:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:27:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:27:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:45,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:27:45,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:27:45,903 INFO L87 Difference]: Start difference. First operand 167 states and 211 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:49,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:27:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:27:50,049 INFO L93 Difference]: Finished difference Result 314 states and 404 transitions. [2025-02-08 13:27:50,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:27:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:27:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:27:50,050 INFO L225 Difference]: With dead ends: 314 [2025-02-08 13:27:50,050 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 13:27:50,051 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:27:50,051 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:27:50,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:27:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 13:27:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-08 13:27:50,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 139 states have (on average 1.3381294964028776) internal successors, (186), 149 states have internal predecessors, (186), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:27:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2025-02-08 13:27:50,058 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 26 [2025-02-08 13:27:50,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:27:50,058 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2025-02-08 13:27:50,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:27:50,058 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2025-02-08 13:27:50,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:27:50,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:27:50,059 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:27:50,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:27:50,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:27:50,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:27:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash -308588144, now seen corresponding path program 1 times [2025-02-08 13:27:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:27:50,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649589425] [2025-02-08 13:27:50,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:27:50,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:27:50,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:27:50,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:50,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:50,768 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:27:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:27:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649589425] [2025-02-08 13:27:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649589425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:27:50,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806334790] [2025-02-08 13:27:50,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:27:50,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:27:50,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:27:50,771 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:27:50,772 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:27:51,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:27:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:27:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:27:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:27:51,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:27:51,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:27:52,053 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:27:52,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:27:52,464 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:27:52,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806334790] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:27:52,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:27:52,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:27:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43592822] [2025-02-08 13:27:52,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:27:52,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:27:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:27:52,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:27:52,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:27:52,466 INFO L87 Difference]: Start difference. First operand 170 states and 214 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:27:56,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:00,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:01,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:01,195 INFO L93 Difference]: Finished difference Result 343 states and 437 transitions. [2025-02-08 13:28:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:28:01,196 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:28:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:01,197 INFO L225 Difference]: With dead ends: 343 [2025-02-08 13:28:01,197 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 13:28:01,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:01,200 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 5 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:01,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1130 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2025-02-08 13:28:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 13:28:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2025-02-08 13:28:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 166 states have internal predecessors, (203), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 231 transitions. [2025-02-08 13:28:01,215 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 231 transitions. Word has length 29 [2025-02-08 13:28:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:01,215 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 231 transitions. [2025-02-08 13:28:01,215 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:28:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 231 transitions. [2025-02-08 13:28:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:28:01,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:01,216 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:01,239 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:28:01,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:28:01,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:01,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:01,418 INFO L85 PathProgramCache]: Analyzing trace with hash -23833552, now seen corresponding path program 1 times [2025-02-08 13:28:01,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:01,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166789169] [2025-02-08 13:28:01,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:28:01,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:28:01,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:01,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:02,096 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:28:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166789169] [2025-02-08 13:28:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166789169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98534001] [2025-02-08 13:28:02,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:02,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:02,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:02,098 INFO L87 Difference]: Start difference. First operand 187 states and 231 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:28:06,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:06,243 INFO L93 Difference]: Finished difference Result 199 states and 245 transitions. [2025-02-08 13:28:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:28:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:06,244 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:28:06,244 INFO L226 Difference]: Without dead ends: 197 [2025-02-08 13:28:06,244 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:28:06,245 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 382 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:28:06,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 382 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:06,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-08 13:28:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2025-02-08 13:28:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 166 states have (on average 1.2951807228915662) internal successors, (215), 175 states have internal predecessors, (215), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 243 transitions. [2025-02-08 13:28:06,254 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 243 transitions. Word has length 47 [2025-02-08 13:28:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 243 transitions. [2025-02-08 13:28:06,255 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:28:06,255 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 243 transitions. [2025-02-08 13:28:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 13:28:06,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:06,258 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:06,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 13:28:06,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:06,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:06,258 INFO L85 PathProgramCache]: Analyzing trace with hash -349662677, now seen corresponding path program 1 times [2025-02-08 13:28:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:06,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176308207] [2025-02-08 13:28:06,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 13:28:06,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 13:28:06,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:06,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,029 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:28:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176308207] [2025-02-08 13:28:07,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176308207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:07,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595188859] [2025-02-08 13:28:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:07,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:07,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:07,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:07,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:07,031 INFO L87 Difference]: Start difference. First operand 196 states and 243 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:28:11,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:11,147 INFO L93 Difference]: Finished difference Result 201 states and 248 transitions. [2025-02-08 13:28:11,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-02-08 13:28:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:11,150 INFO L225 Difference]: With dead ends: 201 [2025-02-08 13:28:11,150 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:28:11,150 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:28:11,151 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:11,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 386 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:28:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:28:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 169 states have (on average 1.2899408284023668) internal successors, (218), 178 states have internal predecessors, (218), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 246 transitions. [2025-02-08 13:28:11,159 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 246 transitions. Word has length 47 [2025-02-08 13:28:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:11,159 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 246 transitions. [2025-02-08 13:28:11,159 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:28:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 246 transitions. [2025-02-08 13:28:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:11,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:11,160 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:28:11,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:28:11,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash -738834446, now seen corresponding path program 1 times [2025-02-08 13:28:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785491788] [2025-02-08 13:28:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:11,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:11,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:11,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:11,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:11,788 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:28:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785491788] [2025-02-08 13:28:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785491788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442503207] [2025-02-08 13:28:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:11,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:11,791 INFO L87 Difference]: Start difference. First operand 199 states and 246 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:28:15,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:15,878 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2025-02-08 13:28:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:15,879 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:28:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:15,881 INFO L225 Difference]: With dead ends: 199 [2025-02-08 13:28:15,881 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:28:15,881 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:28:15,881 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:15,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-08 13:28:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:28:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-02-08 13:28:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 165 states have (on average 1.284848484848485) internal successors, (212), 173 states have internal predecessors, (212), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 240 transitions. [2025-02-08 13:28:15,891 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 240 transitions. Word has length 48 [2025-02-08 13:28:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:15,892 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 240 transitions. [2025-02-08 13:28:15,892 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:28:15,892 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 240 transitions. [2025-02-08 13:28:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:28:15,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:15,893 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:15,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:28:15,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:15,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:15,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1504634983, now seen corresponding path program 1 times [2025-02-08 13:28:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817120392] [2025-02-08 13:28:15,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:15,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:16,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:16,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817120392] [2025-02-08 13:28:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817120392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059491577] [2025-02-08 13:28:16,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:16,549 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:28:16,550 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:28:17,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:17,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:17,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:17,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:17,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:28:17,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:28:17,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:17,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059491577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:17,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:17,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-08 13:28:17,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393994632] [2025-02-08 13:28:17,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:17,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:17,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:17,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:17,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:17,705 INFO L87 Difference]: Start difference. First operand 194 states and 240 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:17,737 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2025-02-08 13:28:17,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:17,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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 50 [2025-02-08 13:28:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:17,740 INFO L225 Difference]: With dead ends: 203 [2025-02-08 13:28:17,741 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:28:17,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:28:17,742 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:17,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:28:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:28:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 165 states have (on average 1.2787878787878788) internal successors, (211), 173 states have internal predecessors, (211), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2025-02-08 13:28:17,754 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 50 [2025-02-08 13:28:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2025-02-08 13:28:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:28:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2025-02-08 13:28:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:28:17,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:17,755 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:17,769 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:28:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 13:28:17,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:17,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1341469000, now seen corresponding path program 1 times [2025-02-08 13:28:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305590025] [2025-02-08 13:28:17,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:18,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:18,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:28:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305590025] [2025-02-08 13:28:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305590025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416056043] [2025-02-08 13:28:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:18,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:18,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:18,611 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:28:18,617 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:28:19,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:19,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:19,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:19,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:19,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 2126 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:28:19,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-02-08 13:28:19,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416056043] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:19,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:19,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:28:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061514940] [2025-02-08 13:28:19,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:19,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:19,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:19,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:19,922 INFO L87 Difference]: Start difference. First operand 194 states and 239 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:28:23,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:27,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:31,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:36,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:40,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:40,178 INFO L93 Difference]: Finished difference Result 360 states and 453 transitions. [2025-02-08 13:28:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:40,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-02-08 13:28:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:40,179 INFO L225 Difference]: With dead ends: 360 [2025-02-08 13:28:40,179 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 13:28:40,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:40,180 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 4 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:40,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 763 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2025-02-08 13:28:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 13:28:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-02-08 13:28:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 183 states have (on average 1.2513661202185793) internal successors, (229), 191 states have internal predecessors, (229), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 13:28:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 257 transitions. [2025-02-08 13:28:40,186 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 257 transitions. Word has length 54 [2025-02-08 13:28:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:40,186 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 257 transitions. [2025-02-08 13:28:40,186 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:28:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 257 transitions. [2025-02-08 13:28:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 13:28:40,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:40,187 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 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:28:40,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 13:28:40,388 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:28:40,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-02-08 13:28:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1693484338, now seen corresponding path program 1 times [2025-02-08 13:28:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485530083] [2025-02-08 13:28:40,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:40,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:40,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:40,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:41,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485530083] [2025-02-08 13:28:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485530083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855375820] [2025-02-08 13:28:41,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:41,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:41,068 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:28:41,069 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:28:42,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 13:28:42,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 13:28:42,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:42,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:42,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:28:42,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-02-08 13:28:42,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855375820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-02-08 13:28:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986562814] [2025-02-08 13:28:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:42,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:42,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:42,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:42,430 INFO L87 Difference]: Start difference. First operand 212 states and 257 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:28:46,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:50,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []