./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/rm-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:27:59,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:27:59,332 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:59,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:27:59,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:27:59,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:27:59,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:27:59,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:27:59,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:27:59,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:27:59,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:27:59,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:27:59,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:27:59,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:27:59,370 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:27:59,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:27:59,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:27:59,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:27:59,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:27:59,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:27:59,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:27:59,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:27:59,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:27:59,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:27:59,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:27:59,373 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 -> 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 [2025-02-08 13:27:59,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:27:59,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:27:59,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:27:59,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:27:59,620 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:27:59,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-02-08 13:28:00,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a6de4854/26ec6620284243b28568ba1058c6c16f/FLAG8c9357d1c [2025-02-08 13:28:01,237 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:28:01,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-02-08 13:28:01,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a6de4854/26ec6620284243b28568ba1058c6c16f/FLAG8c9357d1c [2025-02-08 13:28:01,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a6de4854/26ec6620284243b28568ba1058c6c16f [2025-02-08 13:28:01,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:28:01,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:28:01,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:28:01,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:28:01,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:28:01,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:28:01" (1/1) ... [2025-02-08 13:28:01,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eb93b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:01, skipping insertion in model container [2025-02-08 13:28:01,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:28:01" (1/1) ... [2025-02-08 13:28:01,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:28:02,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:28:02,412 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:28:02,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:28:02,689 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:28:02,700 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:28:02,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02 WrapperNode [2025-02-08 13:28:02,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:28:02,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:28:02,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:28:02,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:28:02,706 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:28:02" (1/1) ... [2025-02-08 13:28:02,743 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:28:02" (1/1) ... [2025-02-08 13:28:02,827 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2806 [2025-02-08 13:28:02,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:28:02,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:28:02,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:28:02,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:28:02,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,860 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:28:02,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:28:02,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:28:02,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:28:02,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:28:02,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (1/1) ... [2025-02-08 13:28:02,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:28:02,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:02,961 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:28:02,967 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:28:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-02-08 13:28:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-02-08 13:28:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-02-08 13:28:02,984 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-02-08 13:28:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:28:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-02-08 13:28:02,985 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:28:02,985 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-02-08 13:28:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-02-08 13:28:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-02-08 13:28:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-02-08 13:28:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-02-08 13:28:02,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-02-08 13:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:28:02,987 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-02-08 13:28:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-02-08 13:28:03,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:28:03,437 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:28:03,505 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3564: havoc #t~nondet287; [2025-02-08 13:28:03,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: assume !(concat_subpath_file_~f#1.base == 0 && concat_subpath_file_~f#1.offset == 0);call concat_subpath_file_#t~mem78#1 := read~int(concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:28:03,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: assume !!(concat_subpath_file_~f#1.base == 0 && concat_subpath_file_~f#1.offset == 0); [2025-02-08 13:28:03,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: assume !(~new_path~0#1.base == 0 && ~new_path~0#1.offset == 0);havoc ~return_value_remove_file$7~0#1; [2025-02-08 13:28:03,989 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3273: assume !!(~new_path~0#1.base == 0 && ~new_path~0#1.offset == 0); [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3587-1: SUMMARY for call assume_abort_if_not((if 0 != readdir_#t~mem295#1 then 1 else 0)); srcloc: null [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3587: havoc readdir_#t~mem295#1;readdir_#res#1.base, readdir_#res#1.offset := 0, 0; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: assume !(0 == #t~bitwise222#1);havoc #t~bitwise222#1;havoc #t~ret223#1;havoc #t~ret223#1;havoc ~return_value_bb_ask_confirmation$9~0#1; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: assume !!(0 == #t~bitwise222#1);havoc #t~bitwise222#1; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-2: havoc #t~bitwise222#1;assume (((#t~bitwise222#1 <= 16 && (~flags#1 < 0 || #t~bitwise222#1 <= ~flags#1)) && #t~bitwise222#1 >= 0) && (~flags#1 >= 0 || #t~bitwise222#1 > 16 + ~flags#1)) && #t~bitwise222#1 >= -2147483648; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-1: [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-4: assume 0 == ~flags#1;#t~bitwise222#1 := 0; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-4: assume !(0 == ~flags#1); [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-3: assume 16 == ~flags#1;#t~bitwise222#1 := 16; [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290-3: assume !(16 == ~flags#1); [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3439-1: SUMMARY for call xasprintf_#t~ret258#1 := vasprintf(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset); srcloc: null [2025-02-08 13:28:03,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3439: assume -2147483648 <= xasprintf_#t~ret258#1 && xasprintf_#t~ret258#1 <= 2147483647;xasprintf_~r~0#1 := xasprintf_#t~ret258#1;havoc xasprintf_#t~ret258#1;call ULTIMATE.dealloc(xasprintf_~p~4#1.base, 0); [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume 0 != closedir_#t~nondet284#1;havoc closedir_#t~nondet284#1;havoc closedir_#t~nondet285#1;assume -2147483648 <= closedir_#t~nondet285#1 && closedir_#t~nondet285#1 <= 2147483647;call write~int(closedir_#t~nondet285#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc closedir_#t~nondet285#1;call closedir_#t~mem286#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: assume !(0 != closedir_#t~nondet284#1);havoc closedir_#t~nondet284#1;closedir_#res#1 := 0; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;assume { :begin_inline_concat_path_file } true;concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset, concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset := concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset;havoc concat_path_file_#res#1.base, concat_path_file_#res#1.offset;havoc concat_path_file_#t~ret74#1.base, concat_path_file_#t~ret74#1.offset, concat_path_file_#t~mem75#1, concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset, concat_path_file_#t~ret77#1.base, concat_path_file_#t~ret77#1.offset, concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset, concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;concat_path_file_~path#1.base, concat_path_file_~path#1.offset := concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset;concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset := concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset;havoc concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc ~dp~0#1.base, ~dp~0#1.offset, ~d~0#1.base, ~d~0#1.offset, ~status~0#1, ~return_value_closedir$8~0#1, ~return_value_rmdir$10~0#1; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605-1: SUMMARY for call assume_abort_if_not((if 0 != rmdir_#t~mem307#1 then 1 else 0)); srcloc: null [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605: havoc rmdir_#t~mem307#1;rmdir_#res#1 := -1; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume 46 == concat_subpath_file_#t~mem78#1;havoc concat_subpath_file_#t~mem78#1;call concat_subpath_file_#t~mem79#1 := read~int(concat_subpath_file_~f#1.base, 1 + concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: assume !(46 == concat_subpath_file_#t~mem78#1);havoc concat_subpath_file_#t~mem78#1; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: concat_subpath_file_#t~ret82#1.base, concat_subpath_file_#t~ret82#1.offset := concat_path_file_#res#1.base, concat_path_file_#res#1.offset;havoc concat_path_file_#t~ret74#1.base, concat_path_file_#t~ret74#1.offset, concat_path_file_#t~mem75#1, concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset, concat_path_file_#t~ret77#1.base, concat_path_file_#t~ret77#1.offset, concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset, concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;havoc concat_path_file_#in~path#1.base, concat_path_file_#in~path#1.offset, concat_path_file_#in~filename#1.base, concat_path_file_#in~filename#1.offset;assume { :end_inline_concat_path_file } true;concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset := concat_subpath_file_#t~ret82#1.base, concat_subpath_file_#t~ret82#1.offset;havoc concat_subpath_file_#t~ret82#1.base, concat_subpath_file_#t~ret82#1.offset;concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset := concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset; [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441: assume xasprintf_~r~0#1 < 0;call xasprintf_#t~varargs259#1.base, xasprintf_#t~varargs259#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:28:03,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3441: assume !(xasprintf_~r~0#1 < 0); [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276: assume -2147483648 <= #t~ret219#1 && #t~ret219#1 <= 2147483647;~return_value_remove_file$7~0#1 := #t~ret219#1;havoc #t~ret219#1; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3276-1: SUMMARY for call #t~ret219#1 := remove_file(~new_path~0#1.base, ~new_path~0#1.offset, ~flags#1); srcloc: null [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc lstat_#t~ret332#1; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3557-1: SUMMARY for call assume_abort_if_not((if 0 != closedir_#t~mem286#1 then 1 else 0)); srcloc: null [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3557: havoc closedir_#t~mem286#1;closedir_#res#1 := -1; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2715: assume concat_path_file_~path#1.base == 0 && concat_path_file_~path#1.offset == 0;concat_path_file_~path#1.base, concat_path_file_~path#1.offset := 6, 0; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2715: assume !(concat_path_file_~path#1.base == 0 && concat_path_file_~path#1.offset == 0); [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3442: SUMMARY for call bb_error_msg_and_die(~#bb_msg_memory_exhausted~0.base, ~#bb_msg_memory_exhausted~0.offset, xasprintf_#t~varargs259#1.base, xasprintf_#t~varargs259#1.offset); srcloc: null [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume 0 == concat_subpath_file_#t~mem79#1;havoc concat_subpath_file_#t~mem79#1;concat_subpath_file_~tmp_if_expr$2~2#1 := 1; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2732: assume !(0 == concat_subpath_file_#t~mem79#1);havoc concat_subpath_file_#t~mem79#1;call concat_subpath_file_#t~mem80#1 := read~int(concat_subpath_file_~f#1.base, 1 + concat_subpath_file_~f#1.offset, 1); [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3277: assume ~return_value_remove_file$7~0#1 < 0;~status~0#1 := -1; [2025-02-08 13:28:03,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3277: assume !(~return_value_remove_file$7~0#1 < 0); [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3294: assume -2147483648 <= #t~ret224#1 && #t~ret224#1 <= 2147483647;~return_value_bb_ask_confirmation$9~0#1 := #t~ret224#1;havoc #t~ret224#1; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3294-1: SUMMARY for call #t~ret224#1 := bb_ask_confirmation(); srcloc: null [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: havoc xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;concat_path_file_#t~ret77#1.base, concat_path_file_#t~ret77#1.offset := xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret258#1, xasprintf_#t~varargs259#1.base, xasprintf_#t~varargs259#1.offset, xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~0#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;havoc xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset;assume { :end_inline_xasprintf } true;concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset := concat_path_file_#t~ret77#1.base, concat_path_file_#t~ret77#1.offset;havoc concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset;havoc concat_path_file_#t~ret77#1.base, concat_path_file_#t~ret77#1.offset;concat_path_file_#res#1.base, concat_path_file_#res#1.offset := concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443-2: call xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset := read~$Pointer$(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset, 8);xasprintf_#res#1.base, xasprintf_#res#1.offset := xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;havoc xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume 0 == ~return_value_bb_ask_confirmation$9~0#1;#res#1 := ~status~0#1;call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3295: assume !(0 == ~return_value_bb_ask_confirmation$9~0#1);havoc ~return_value_bb_ask_confirmation$9~0#1; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717-1: SUMMARY for call concat_path_file_#t~ret74#1.base, concat_path_file_#t~ret74#1.offset := last_char_is(concat_path_file_~path#1.base, concat_path_file_~path#1.offset, 47); srcloc: null [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: concat_path_file_~lc~0#1.base, concat_path_file_~lc~0#1.offset := concat_path_file_#t~ret74#1.base, concat_path_file_#t~ret74#1.offset;havoc concat_path_file_#t~ret74#1.base, concat_path_file_#t~ret74#1.offset; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3279: call ULTIMATE.dealloc(~new_path~0#1.base, ~new_path~0#1.offset);havoc ~return_value_remove_file$7~0#1; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3593-1: SUMMARY for call assume_abort_if_not((if (if readdir_#t~mem299#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem299#1 % 65536 % 4294967296 else readdir_#t~mem299#1 % 65536 % 4294967296 - 4294967296) % 18446744073709551616 < 255 then 1 else 0)); srcloc: null [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3593: havoc readdir_#t~mem299#1;readdir_~i~1#1 := 0; [2025-02-08 13:28:03,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2718: assume true;call concat_path_file_#t~mem75#1 := read~int(concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, 1); [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2718: assume !true; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3263: #t~ret216#1.base, #t~ret216#1.offset := opendir_#res#1.base, opendir_#res#1.offset;havoc opendir_#t~mem288#1, opendir_#t~nondet289#1, opendir_#t~nondet290#1, opendir_#t~mem291#1, opendir_~name#1.base, opendir_~name#1.offset;havoc opendir_#in~name#1.base, opendir_#in~name#1.offset;assume { :end_inline_opendir } true;~dp~0#1.base, ~dp~0#1.offset := #t~ret216#1.base, #t~ret216#1.offset;havoc #t~ret216#1.base, #t~ret216#1.offset; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2718-2: assume !(47 == concat_path_file_#t~mem75#1);havoc concat_path_file_#t~mem75#1; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2718-2: assume 47 == concat_path_file_#t~mem75#1;havoc concat_path_file_#t~mem75#1;concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset := concat_path_file_~filename#1.base, 1 + concat_path_file_~filename#1.offset; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc readdir_~i~1#1;call readdir_#t~mem303#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2);call write~int(0, ~#ret~0.base, 19 + ~#ret~0.offset + (if readdir_#t~mem303#1 % 65536 % 18446744073709551616 <= 9223372036854775807 then readdir_#t~mem303#1 % 65536 % 18446744073709551616 else readdir_#t~mem303#1 % 65536 % 18446744073709551616 - 18446744073709551616), 1);havoc readdir_#t~mem303#1;readdir_#res#1.base, readdir_#res#1.offset := ~#ret~0.base, ~#ret~0.offset; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-2: assume 1 + readdir_~i~1#1 <= 2147483647;readdir_#t~pre302#1 := 1 + readdir_~i~1#1;readdir_~i~1#1 := 1 + readdir_~i~1#1;havoc readdir_#t~pre302#1; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-2: assume !(1 + readdir_~i~1#1 <= 2147483647); [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-1: assume true;call readdir_#t~mem300#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2); [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-1: assume !true; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-4: assume !(readdir_~i~1#1 < (if readdir_#t~mem300#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem300#1 % 65536 % 4294967296 else readdir_#t~mem300#1 % 65536 % 4294967296 - 4294967296));havoc readdir_#t~mem300#1; [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-4: assume readdir_~i~1#1 < (if readdir_#t~mem300#1 % 65536 % 4294967296 <= 2147483647 then readdir_#t~mem300#1 % 65536 % 4294967296 else readdir_#t~mem300#1 % 65536 % 4294967296 - 4294967296);havoc readdir_#t~mem300#1;havoc readdir_#t~nondet301#1;assume -128 <= readdir_#t~nondet301#1 && readdir_#t~nondet301#1 <= 127;call write~int(readdir_#t~nondet301#1, ~#ret~0.base, 19 + ~#ret~0.offset + readdir_~i~1#1, 1); [2025-02-08 13:28:03,994 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-3: assume 1 + readdir_~i~1#1 >= -2147483648; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594-3: assume !(1 + readdir_~i~1#1 >= -2147483648); [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: assume ~dp~0#1.base == 0 && ~dp~0#1.offset == 0;#res#1 := -1;call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3264: assume !(~dp~0#1.base == 0 && ~dp~0#1.offset == 0); [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736: assume 46 == concat_subpath_file_#t~mem80#1;havoc concat_subpath_file_#t~mem80#1;call concat_subpath_file_#t~mem81#1 := read~int(concat_subpath_file_~f#1.base, 2 + concat_subpath_file_~f#1.offset, 1);concat_subpath_file_~tmp_if_expr$1~1#1 := (if 0 == (if 0 != (if !(0 != concat_subpath_file_#t~mem81#1) then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2736: assume !(46 == concat_subpath_file_#t~mem80#1);havoc concat_subpath_file_#t~mem80#1;concat_subpath_file_~tmp_if_expr$1~1#1 := 0; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3298: havoc ~return_value_rmdir$10~0#1;assume { :begin_inline_rmdir } true;rmdir_#in~pathname#1.base, rmdir_#in~pathname#1.offset := ~path#1.base, ~path#1.offset;havoc rmdir_#res#1;havoc rmdir_#t~mem304#1, rmdir_#t~nondet305#1, rmdir_#t~nondet306#1, rmdir_#t~mem307#1, rmdir_~pathname#1.base, rmdir_~pathname#1.offset;rmdir_~pathname#1.base, rmdir_~pathname#1.offset := rmdir_#in~pathname#1.base, rmdir_#in~pathname#1.offset;call rmdir_#t~mem304#1 := read~int(rmdir_~pathname#1.base, rmdir_~pathname#1.offset, 1);havoc rmdir_#t~mem304#1;havoc rmdir_#t~nondet305#1;assume -2147483648 <= rmdir_#t~nondet305#1 && rmdir_#t~nondet305#1 <= 2147483647; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2720: havoc concat_path_file_~return_value_xasprintf$1~0#1.base, concat_path_file_~return_value_xasprintf$1~0#1.offset;call concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(concat_path_file_~path#1.base, concat_path_file_~path#1.offset, concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset, 8);call write~$Pointer$((if concat_path_file_~lc~0#1.base == 0 && concat_path_file_~lc~0#1.offset == 0 then 8 else 9), (if concat_path_file_~lc~0#1.base == 0 && concat_path_file_~lc~0#1.offset == 0 then 0 else 0), concat_path_file_#t~varargs76#1.base, 8 + concat_path_file_#t~varargs76#1.offset, 8);call write~$Pointer$(concat_path_file_~filename#1.base, concat_path_file_~filename#1.offset, concat_path_file_#t~varargs76#1.base, 16 + concat_path_file_#t~varargs76#1.offset, 8);assume { :begin_inline_xasprintf } true;xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset, xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset := 7, 0, concat_path_file_#t~varargs76#1.base, concat_path_file_#t~varargs76#1.offset;havoc xasprintf_#res#1.base, xasprintf_#res#1.offset;havoc xasprintf_#t~ret258#1, xasprintf_#t~varargs259#1.base, xasprintf_#t~varargs259#1.offset, xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset, xasprintf_~format#1.base, xasprintf_~format#1.offset, xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset, xasprintf_~r~0#1, xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset;xasprintf_~format#1.base, xasprintf_~format#1.offset := xasprintf_#in~format#1.base, xasprintf_#in~format#1.offset;havoc xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset;havoc xasprintf_~r~0#1;call xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset := #Ultimate.allocOnStack(8);xasprintf_~p~4#1.base, xasprintf_~p~4#1.offset := xasprintf_#varArgs#1.base, xasprintf_#varArgs#1.offset; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266: assume true;assume { :begin_inline_readdir } true;readdir_#in~d#1.base, readdir_#in~d#1.offset := ~dp~0#1.base, ~dp~0#1.offset;havoc readdir_#res#1.base, readdir_#res#1.offset;havoc readdir_#t~nondet292#1, readdir_#t~nondet293#1, readdir_#t~nondet294#1, readdir_#t~mem295#1, readdir_#t~nondet296#1, readdir_#t~nondet297#1, readdir_#t~nondet298#1, readdir_#t~mem299#1, readdir_#t~mem300#1, readdir_#t~nondet301#1, readdir_#t~pre302#1, readdir_~i~1#1, readdir_#t~mem303#1, readdir_~d#1.base, readdir_~d#1.offset;readdir_~d#1.base, readdir_~d#1.offset := readdir_#in~d#1.base, readdir_#in~d#1.offset;havoc readdir_#t~nondet292#1;assume -2147483648 <= readdir_#t~nondet292#1 && readdir_#t~nondet292#1 <= 2147483647; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266: assume !true; [2025-02-08 13:28:03,995 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3299: #t~ret225#1 := rmdir_#res#1;havoc rmdir_#t~mem304#1, rmdir_#t~nondet305#1, rmdir_#t~nondet306#1, rmdir_#t~mem307#1, rmdir_~pathname#1.base, rmdir_~pathname#1.offset;havoc rmdir_#in~pathname#1.base, rmdir_#in~pathname#1.offset;assume { :end_inline_rmdir } true;assume -2147483648 <= #t~ret225#1 && #t~ret225#1 <= 2147483647;~return_value_rmdir$10~0#1 := #t~ret225#1;havoc #t~ret225#1; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266-1: assume true; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3266-1: assume !true; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3283: havoc ~return_value_closedir$8~0#1;assume { :begin_inline_closedir } true;closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset := ~dp~0#1.base, ~dp~0#1.offset;havoc closedir_#res#1;havoc closedir_#t~nondet284#1, closedir_#t~nondet285#1, closedir_#t~mem286#1, closedir_~dirp#1.base, closedir_~dirp#1.offset;closedir_~dirp#1.base, closedir_~dirp#1.offset := closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset;havoc closedir_#t~nondet284#1;assume -2147483648 <= closedir_#t~nondet284#1 && closedir_#t~nondet284#1 <= 2147483647; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3300: assume ~return_value_rmdir$10~0#1 < 0;call #t~varargs226#1.base, #t~varargs226#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(~path#1.base, ~path#1.offset, #t~varargs226#1.base, #t~varargs226#1.offset, 8); [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3300: assume !(~return_value_rmdir$10~0#1 < 0);#res#1 := ~status~0#1;call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3267: havoc ~new_path~0#1.base, ~new_path~0#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3284: #t~ret220#1 := closedir_#res#1;havoc closedir_#t~nondet284#1, closedir_#t~nondet285#1, closedir_#t~mem286#1, closedir_~dirp#1.base, closedir_~dirp#1.offset;havoc closedir_#in~dirp#1.base, closedir_#in~dirp#1.offset;assume { :end_inline_closedir } true;assume -2147483648 <= #t~ret220#1 && #t~ret220#1 <= 2147483647;~return_value_closedir$8~0#1 := #t~ret220#1;havoc #t~ret220#1; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268: #t~ret217#1.base, #t~ret217#1.offset := readdir_#res#1.base, readdir_#res#1.offset;havoc readdir_#t~nondet292#1, readdir_#t~nondet293#1, readdir_#t~nondet294#1, readdir_#t~mem295#1, readdir_#t~nondet296#1, readdir_#t~nondet297#1, readdir_#t~nondet298#1, readdir_#t~mem299#1, readdir_#t~mem300#1, readdir_#t~nondet301#1, readdir_#t~pre302#1, readdir_~i~1#1, readdir_#t~mem303#1, readdir_~d#1.base, readdir_~d#1.offset;havoc readdir_#in~d#1.base, readdir_#in~d#1.offset;assume { :end_inline_readdir } true;~d~0#1.base, ~d~0#1.offset := #t~ret217#1.base, #t~ret217#1.offset;havoc #t~ret217#1.base, #t~ret217#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582: assume 0 != readdir_#t~nondet292#1;havoc readdir_#t~nondet292#1;readdir_#res#1.base, readdir_#res#1.offset := 0, 0; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3582: assume !(0 != readdir_#t~nondet292#1);havoc readdir_#t~nondet292#1;havoc readdir_#t~nondet293#1;assume -2147483648 <= readdir_#t~nondet293#1 && readdir_#t~nondet293#1 <= 2147483647; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2740: concat_subpath_file_~tmp_if_expr$2~2#1 := (if 0 == (if 0 != (if 0 != concat_subpath_file_~tmp_if_expr$1~1#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume ~return_value_closedir$8~0#1 < 0;call #t~varargs221#1.base, #t~varargs221#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(~path#1.base, ~path#1.offset, #t~varargs221#1.base, #t~varargs221#1.offset, 8); [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: assume !(~return_value_closedir$8~0#1 < 0); [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302: havoc #t~varargs226#1.base, #t~varargs226#1.offset;#res#1 := -1;call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3302-1: SUMMARY for call bb_perror_msg(15, 0, #t~varargs226#1.base, #t~varargs226#1.offset); srcloc: null [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: assume ~d~0#1.base == 0 && ~d~0#1.offset == 0; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3269: assume !(~d~0#1.base == 0 && ~d~0#1.offset == 0);havoc ~new_path~0#1.base, ~new_path~0#1.offset;assume { :begin_inline_concat_subpath_file } true;concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset, concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset := ~path#1.base, ~path#1.offset, ~d~0#1.base, 19 + ~d~0#1.offset;havoc concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset;havoc concat_subpath_file_#t~mem78#1, concat_subpath_file_#t~mem79#1, concat_subpath_file_#t~mem80#1, concat_subpath_file_#t~mem81#1, concat_subpath_file_#t~ret82#1.base, concat_subpath_file_#t~ret82#1.offset, concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, concat_subpath_file_~tmp_if_expr$2~2#1, concat_subpath_file_~tmp_if_expr$1~1#1, concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset := concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset;concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset := concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset;havoc concat_subpath_file_~tmp_if_expr$2~2#1;havoc concat_subpath_file_~tmp_if_expr$1~1#1; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287-1: SUMMARY for call bb_perror_msg(14, 0, #t~varargs221#1.base, #t~varargs221#1.offset); srcloc: null [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2742: assume !(0 == concat_subpath_file_~tmp_if_expr$2~2#1 % 256);concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset := 0, 0; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2742: assume !!(0 == concat_subpath_file_~tmp_if_expr$2~2#1 % 256); [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3287: havoc #t~varargs221#1.base, #t~varargs221#1.offset;#res#1 := -1;call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-02-08 13:28:03,996 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3585: assume 0 != readdir_#t~nondet293#1;havoc readdir_#t~nondet293#1;havoc readdir_#t~nondet294#1;assume -2147483648 <= readdir_#t~nondet294#1 && readdir_#t~nondet294#1 <= 2147483647;call write~int(readdir_#t~nondet294#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc readdir_#t~nondet294#1;call readdir_#t~mem295#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:03,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3585: assume !(0 != readdir_#t~nondet293#1);havoc readdir_#t~nondet293#1;havoc readdir_#t~nondet296#1;assume -9223372036854775808 <= readdir_#t~nondet296#1 && readdir_#t~nondet296#1 <= 9223372036854775807;call write~int(readdir_#t~nondet296#1, ~#ret~0.base, ~#ret~0.offset, 8);havoc readdir_#t~nondet296#1;havoc readdir_#t~nondet297#1;assume -9223372036854775808 <= readdir_#t~nondet297#1 && readdir_#t~nondet297#1 <= 9223372036854775807;call write~int(readdir_#t~nondet297#1, ~#ret~0.base, 8 + ~#ret~0.offset, 8);havoc readdir_#t~nondet297#1;havoc readdir_#t~nondet298#1;assume -32768 <= readdir_#t~nondet298#1 && readdir_#t~nondet298#1 <= 32767;call write~int(readdir_#t~nondet298#1, ~#ret~0.base, 16 + ~#ret~0.offset, 2);havoc readdir_#t~nondet298#1;call readdir_#t~mem299#1 := read~int(~#ret~0.base, 16 + ~#ret~0.offset, 2); [2025-02-08 13:28:03,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3602: assume 0 != rmdir_#t~nondet305#1;havoc rmdir_#t~nondet305#1;havoc rmdir_#t~nondet306#1;assume -2147483648 <= rmdir_#t~nondet306#1 && rmdir_#t~nondet306#1 <= 2147483647;call write~int(rmdir_#t~nondet306#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4);havoc rmdir_#t~nondet306#1;call rmdir_#t~mem307#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:03,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3602: assume !(0 != rmdir_#t~nondet305#1);havoc rmdir_#t~nondet305#1;rmdir_#res#1 := 0; [2025-02-08 13:28:03,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: #t~ret218#1.base, #t~ret218#1.offset := concat_subpath_file_#res#1.base, concat_subpath_file_#res#1.offset;havoc concat_subpath_file_#t~mem78#1, concat_subpath_file_#t~mem79#1, concat_subpath_file_#t~mem80#1, concat_subpath_file_#t~mem81#1, concat_subpath_file_#t~ret82#1.base, concat_subpath_file_#t~ret82#1.offset, concat_subpath_file_~path#1.base, concat_subpath_file_~path#1.offset, concat_subpath_file_~f#1.base, concat_subpath_file_~f#1.offset, concat_subpath_file_~tmp_if_expr$2~2#1, concat_subpath_file_~tmp_if_expr$1~1#1, concat_subpath_file_~return_value_concat_path_file$3~0#1.base, concat_subpath_file_~return_value_concat_path_file$3~0#1.offset;havoc concat_subpath_file_#in~path#1.base, concat_subpath_file_#in~path#1.offset, concat_subpath_file_#in~f#1.base, concat_subpath_file_#in~f#1.offset;assume { :end_inline_concat_subpath_file } true;~new_path~0#1.base, ~new_path~0#1.offset := #t~ret218#1.base, #t~ret218#1.offset;havoc #t~ret218#1.base, #t~ret218#1.offset; [2025-02-08 13:28:03,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3652: havoc stat_#t~ret331#1; [2025-02-08 13:28:04,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:28:04,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:28:04,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: 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:28:04,199 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~2#1 || (write_~ret~2#1 >= 0 && write_~ret~2#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727: write_#res#1 := write_~ret~2#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422: 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~nondet368#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~2#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~nondet368#1;assume -9223372036854775808 <= write_#t~nondet368#1 && write_#t~nondet368#1 <= 9223372036854775807;write_~ret~2#1 := write_#t~nondet368#1;havoc write_#t~nondet368#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422: assume !true; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422-1: assume 0 != safe_write_~tmp_if_expr$1~3#1 % 256; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3422-1: assume !(0 != safe_write_~tmp_if_expr$1~3#1 % 256); [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2762: full_write_#t~ret84#1 := safe_write_#res#1;havoc safe_write_#t~ret256#1, safe_write_#t~mem257#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~3#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~ret84#1 && full_write_#t~ret84#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret84#1;havoc full_write_#t~ret84#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3431-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: #t~ret68#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet83#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= #t~ret68#1 && #t~ret68#1 <= 2147483647;havoc #t~ret68#1;call #t~mem69#1.base, #t~mem69#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~mem69#1.base, #t~mem69#1.offset, ~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret84#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:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763: assume full_write_~cc~0#1 < 0; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3424: safe_write_#t~ret256#1 := write_#res#1;havoc write_#t~nondet368#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~2#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~ret256#1 && safe_write_#t~ret256#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret256#1;havoc safe_write_#t~ret256#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2706: #t~ret70#1 := full_write_#res#1;havoc full_write_#t~ret84#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~ret70#1 && #t~ret70#1 <= 9223372036854775807;havoc #t~mem69#1.base, #t~mem69#1.offset;havoc #t~ret70#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3425: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem257#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~3#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem257#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3425: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~3#1 := 0; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2765: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2765: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: 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~ret256#1, safe_write_#t~mem257#1, safe_write_~fd#1, safe_write_~buf#1.base, safe_write_~buf#1.offset, safe_write_~count#1, safe_write_~n~0#1, safe_write_~tmp_if_expr$1~3#1;safe_write_~fd#1 := safe_write_#in~fd#1;safe_write_~buf#1.base, safe_write_~buf#1.offset := safe_write_#in~buf#1.base, safe_write_#in~buf#1.offset;safe_write_~count#1 := safe_write_#in~count#1;havoc safe_write_~n~0#1;havoc safe_write_~tmp_if_expr$1~3#1; [2025-02-08 13:28:04,200 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3504: assume !(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem271#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem271#1.offset);havoc xstrtou_range_sfx_#t~mem271#1.base, xstrtou_range_sfx_#t~mem271#1.offset;call xstrtou_range_sfx_#t~mem272#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3504: assume !!(xstrtou_range_sfx_~numstr#1.base == xstrtou_range_sfx_#t~mem271#1.base && xstrtou_range_sfx_~numstr#1.offset == xstrtou_range_sfx_#t~mem271#1.offset);havoc xstrtou_range_sfx_#t~mem271#1.base, xstrtou_range_sfx_#t~mem271#1.offset; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: assume 0 != getopt32_#t~bitwise165#1 % 4294967296;havoc getopt32_#t~mem164#1;havoc getopt32_#t~bitwise165#1; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108: assume !(0 != getopt32_#t~bitwise165#1 % 4294967296);havoc getopt32_#t~mem164#1;havoc getopt32_#t~bitwise165#1;call getopt32_#t~mem166#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4);call getopt32_#t~mem167#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-2: havoc getopt32_#t~bitwise165#1;assume getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_#t~mem164#1 % 4294967296 && getopt32_#t~bitwise165#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-1: [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-4: assume 0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise165#1 := 0; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-4: assume !(0 == getopt32_#t~mem164#1 % 4294967296 || 0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-3: assume getopt32_#t~mem164#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise165#1 := getopt32_#t~mem164#1; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-3: assume !(getopt32_#t~mem164#1 % 4294967296 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3108-5: call getopt32_#t~mem164#1 := read~int(getopt32_~on_off~0#1.base, 10 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3506: assume 0 == xstrtou_range_sfx_#t~mem272#1;havoc xstrtou_range_sfx_#t~mem272#1;call write~int(xstrtou_range_sfx_~old_errno~0#1, ~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3506: assume !(0 == xstrtou_range_sfx_#t~mem272#1);havoc xstrtou_range_sfx_#t~mem272#1; [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3407: __main_~status~1#1 := 1;__main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~base~0#1.base, __main_~base~0#1.offset;call __main_#t~mem254#1.base, __main_#t~mem254#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110: getopt32_~trigger~0#1 := getopt32_#t~bitwise168#1;havoc getopt32_#t~mem166#1;havoc getopt32_#t~mem167#1;havoc getopt32_#t~bitwise168#1;call getopt32_#t~mem169#1 := read~int(getopt32_~on_off~0#1.base, 6 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:28:06,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-2: havoc getopt32_#t~bitwise168#1;assume getopt32_#t~bitwise168#1 % 4294967296 <= getopt32_#t~mem166#1 % 4294967296 && getopt32_#t~bitwise168#1 % 4294967296 <= getopt32_#t~mem167#1 % 4294967296; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-1: [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-4: assume 0 == getopt32_#t~mem166#1 % 4294967296 || 0 == getopt32_#t~mem167#1 % 4294967296;getopt32_#t~bitwise168#1 := 0; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-4: assume !(0 == getopt32_#t~mem166#1 % 4294967296 || 0 == getopt32_#t~mem167#1 % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-3: assume getopt32_#t~mem166#1 % 4294967296 == getopt32_#t~mem167#1 % 4294967296;getopt32_#t~bitwise168#1 := getopt32_#t~mem166#1; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3110-3: assume !(getopt32_#t~mem166#1 % 4294967296 == getopt32_#t~mem167#1 % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-1: [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111: getopt32_~flags~0#1 := getopt32_#t~bitwise171#1;havoc getopt32_#t~mem169#1;havoc getopt32_#t~bitwise170#1;havoc getopt32_#t~bitwise171#1;call getopt32_#t~mem172#1 := read~int(getopt32_~on_off~0#1.base, 2 + getopt32_~on_off~0#1.offset, 4); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-3: assume getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise170#1) % 4294967296;getopt32_#t~bitwise171#1 := getopt32_~flags~0#1; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-3: assume !(getopt32_~flags~0#1 % 4294967296 == (4294967295 - getopt32_#t~bitwise170#1) % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-2: havoc getopt32_#t~bitwise171#1;assume getopt32_#t~bitwise171#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise171#1 % 4294967296 <= (4294967295 - getopt32_#t~bitwise170#1) % 4294967296; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-5: [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise170#1) % 4294967296;getopt32_#t~bitwise171#1 := 0; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || 0 == (4294967295 - getopt32_#t~bitwise170#1) % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-7: assume getopt32_#t~mem169#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise170#1 := 0; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-7: assume !(getopt32_#t~mem169#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-6: havoc getopt32_#t~bitwise170#1;assume getopt32_#t~bitwise170#1 % 4294967296 <= getopt32_#t~mem169#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-9: assume 0 == getopt32_#t~mem169#1 % 4294967296;getopt32_#t~bitwise170#1 := getopt32_~trigger~0#1; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-9: assume !(0 == getopt32_#t~mem169#1 % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise170#1 := getopt32_#t~mem169#1; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3111-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112: getopt32_~flags~0#1 := getopt32_#t~bitwise174#1;havoc getopt32_#t~mem172#1;havoc getopt32_#t~bitwise173#1;havoc getopt32_#t~bitwise174#1; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-2: havoc getopt32_#t~bitwise174#1;assume (getopt32_#t~bitwise174#1 % 4294967296 >= getopt32_~flags~0#1 % 4294967296 && getopt32_#t~bitwise174#1 % 4294967296 >= getopt32_#t~bitwise173#1 % 4294967296) && getopt32_#t~bitwise174#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_#t~bitwise173#1 % 4294967296; [2025-02-08 13:28:06,011 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-1: [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-4: assume 0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise173#1 % 4294967296;getopt32_#t~bitwise174#1 := getopt32_#t~bitwise173#1; [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-4: assume !(0 == getopt32_~flags~0#1 % 4294967296 || getopt32_~flags~0#1 % 4294967296 == getopt32_#t~bitwise173#1 % 4294967296); [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-3: assume 0 == getopt32_#t~bitwise173#1 % 4294967296;getopt32_#t~bitwise174#1 := getopt32_~flags~0#1; [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-3: assume !(0 == getopt32_#t~bitwise173#1 % 4294967296); [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-6: havoc getopt32_#t~bitwise173#1;assume getopt32_#t~bitwise173#1 % 4294967296 <= getopt32_#t~mem172#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-5: [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-8: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_#t~mem172#1; [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-8: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-7: assume getopt32_#t~mem172#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise173#1 := 0; [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-7: assume !(getopt32_#t~mem172#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,012 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-9: assume 0 == getopt32_#t~mem172#1 % 4294967296;getopt32_#t~bitwise173#1 := getopt32_~trigger~0#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3112-9: assume !(0 == getopt32_#t~mem172#1 % 4294967296); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: assume !(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3509: assume !!(xstrtou_range_sfx_~suffixes#1.base == 0 && xstrtou_range_sfx_~suffixes#1.offset == 0); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377-1: assume !(__main_#t~mem254#1.base == 0 && __main_#t~mem254#1.offset == 0);havoc __main_#t~mem254#1.base, __main_#t~mem254#1.offset; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377-1: assume !!(__main_#t~mem254#1.base == 0 && __main_#t~mem254#1.offset == 0);havoc __main_#t~mem254#1.base, __main_#t~mem254#1.offset; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-1: [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113: getopt32_~flags~0#1 := getopt32_#t~bitwise175#1;havoc getopt32_#t~bitwise175#1;call getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-3: assume getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise175#1 := 0; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-3: assume !(getopt32_~flags~0#1 % 4294967296 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-2: havoc getopt32_#t~bitwise175#1;assume getopt32_#t~bitwise175#1 % 4294967296 <= getopt32_~flags~0#1 % 4294967296 + getopt32_~trigger~0#1 % 4294967296; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-5: assume 0 == getopt32_~flags~0#1 % 4294967296;getopt32_#t~bitwise175#1 := getopt32_~trigger~0#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-5: assume !(0 == getopt32_~flags~0#1 % 4294967296); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-4: assume 0 == getopt32_~trigger~0#1 % 4294967296;getopt32_#t~bitwise175#1 := getopt32_~flags~0#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3113-4: assume !(0 == getopt32_~trigger~0#1 % 4294967296); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3543-1: SUMMARY for call bb_error_msg_and_die(21, 0, xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset); srcloc: null [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: assume true;call xstrtou_range_sfx_#t~mem273#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: assume !true; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3543: havoc xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset;xatou_range_#t~ret262#1 := xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem266#1, xstrtou_range_sfx_#t~mem267#1, xstrtou_range_sfx_#t~mem268#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem269#1, xstrtou_range_sfx_#t~ret270#1, xstrtou_range_sfx_#t~mem271#1.base, xstrtou_range_sfx_#t~mem271#1.offset, xstrtou_range_sfx_#t~mem272#1, xstrtou_range_sfx_#t~mem273#1, xstrtou_range_sfx_#t~mem274#1.base, xstrtou_range_sfx_#t~mem274#1.offset, xstrtou_range_sfx_#t~nondet275#1, xstrtou_range_sfx_#t~mem276#1, xstrtou_range_sfx_#t~mem277#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset, xstrtou_range_sfx_#t~mem279#1, xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset, xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~1#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~4#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;havoc xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;assume { :end_inline_xstrtou_range_sfx } true;xatou_range_~return_value_xstrtou_range_sfx$1~0#1 := xatou_range_#t~ret262#1;havoc xatou_range_#t~ret262#1;xatou_range_#res#1 := xatou_range_~return_value_xstrtou_range_sfx$1~0#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3543-2: call xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset, 8); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510-1: assume !(0 == xstrtou_range_sfx_#t~mem273#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem273#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510-1: assume !!(0 == xstrtou_range_sfx_#t~mem273#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem273#1; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3114: assume !(getopt32_#t~mem176#1.base == 0 && getopt32_#t~mem176#1.offset == 0);havoc getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset;call getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 26 + getopt32_~on_off~0#1.offset, 8);call getopt32_#t~mem179#1 := read~int(getopt32_#t~mem178#1.base, getopt32_#t~mem178#1.offset, 4); [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3114: assume !!(getopt32_#t~mem176#1.base == 0 && getopt32_#t~mem176#1.offset == 0);havoc getopt32_#t~mem176#1.base, getopt32_#t~mem176#1.offset; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115-1: assume 1 + getopt32_#t~mem179#1 >= -2147483648; [2025-02-08 13:28:06,013 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115-1: assume !(1 + getopt32_#t~mem179#1 >= -2147483648); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115: assume 1 + getopt32_#t~mem179#1 <= 2147483647;call write~int(1 + getopt32_#t~mem179#1, getopt32_#t~mem177#1.base, getopt32_#t~mem177#1.offset, 4); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3115: assume !(1 + getopt32_#t~mem179#1 <= 2147483647); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3512: havoc xstrtou_range_sfx_~__s1_len~0#1;havoc xstrtou_range_sfx_~__s2_len~0#1;havoc xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;call xstrtou_range_sfx_#t~mem274#1.base, xstrtou_range_sfx_#t~mem274#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1 := xstrtou_range_sfx_#t~nondet275#1;havoc xstrtou_range_sfx_#t~mem274#1.base, xstrtou_range_sfx_#t~mem274#1.offset;havoc xstrtou_range_sfx_#t~nondet275#1;xstrtou_range_sfx_~tmp_statement_expression$4~0#1 := xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1; [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3380: __main_#t~ret246#1.base, __main_#t~ret246#1.offset := bb_get_last_path_component_strip_#res#1.base, bb_get_last_path_component_strip_#res#1.offset;havoc bb_get_last_path_component_strip_#t~ret40#1.base, bb_get_last_path_component_strip_#t~ret40#1.offset, bb_get_last_path_component_strip_#t~mem41#1, bb_get_last_path_component_strip_#t~ret42#1.base, bb_get_last_path_component_strip_#t~ret42#1.offset, bb_get_last_path_component_strip_~path#1.base, bb_get_last_path_component_strip_~path#1.offset, bb_get_last_path_component_strip_~slash~1#1.base, bb_get_last_path_component_strip_~slash~1#1.offset, bb_get_last_path_component_strip_~tmp_post$1~0#1.base, bb_get_last_path_component_strip_~tmp_post$1~0#1.offset, bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.base, bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.offset;havoc bb_get_last_path_component_strip_#in~path#1.base, bb_get_last_path_component_strip_#in~path#1.offset;assume { :end_inline_bb_get_last_path_component_strip } true;__main_~base~0#1.base, __main_~base~0#1.offset := __main_#t~ret246#1.base, __main_#t~ret246#1.offset;havoc __main_#t~mem245#1.base, __main_#t~mem245#1.offset;havoc __main_#t~ret246#1.base, __main_#t~ret246#1.offset;call __main_#t~mem247#1 := read~int(__main_~base~0#1.base, __main_~base~0#1.offset, 1); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3116: assume !(~optarg~0.base == 0 && ~optarg~0.offset == 0);call getopt32_#t~mem180#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3116: assume !!(~optarg~0.base == 0 && ~optarg~0.offset == 0); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3381: assume 46 == __main_#t~mem247#1;havoc __main_#t~mem247#1;call __main_#t~mem248#1 := read~int(__main_~base~0#1.base, 1 + __main_~base~0#1.offset, 1); [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3381: assume !(46 == __main_#t~mem247#1);havoc __main_#t~mem247#1;__main_~tmp_if_expr$4~1#1 := 0; [2025-02-08 13:28:06,014 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448: xatoi_positive_#t~ret261#1 := xatou_range_#res#1;havoc xatou_range_#t~ret262#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;havoc xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1;assume { :end_inline_xatou_range } true;xatoi_positive_~return_value_xatou_range$1~0#1 := xatoi_positive_#t~ret261#1;havoc xatoi_positive_#t~ret261#1;xatoi_positive_#res#1 := (if xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 <= 2147483647 then xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 else xatoi_positive_~return_value_xatou_range$1~0#1 % 4294967296 % 4294967296 - 4294967296); [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: assume 1 == getopt32_#t~mem180#1;havoc getopt32_#t~mem180#1;call getopt32_#t~mem181#1.base, getopt32_#t~mem181#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);assume { :begin_inline_llist_add_to_end } true;llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset := getopt32_#t~mem181#1.base, getopt32_#t~mem181#1.offset, ~optarg~0.base, ~optarg~0.offset;havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset, llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset, llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset;llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset := llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: assume !(1 == getopt32_#t~mem180#1);havoc getopt32_#t~mem180#1;call getopt32_#t~mem182#1 := read~int(getopt32_~on_off~0#1.base, 1 + getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc getopt_long_#t~ret364#1;getopt32_#t~ret161#1 := getopt_long_#res#1;havoc getopt_long_#t~mem360#1.base, getopt_long_#t~mem360#1.offset, getopt_long_#t~mem361#1, getopt_long_#t~mem362#1.base, getopt_long_#t~mem362#1.offset, getopt_long_#t~mem363#1, getopt_long_#t~ret364#1, getopt_long_~argc#1, getopt_long_~#argv#1.base, getopt_long_~#argv#1.offset, getopt_long_~optstring#1.base, getopt_long_~optstring#1.offset, getopt_long_~longopts#1.base, getopt_long_~longopts#1.offset, getopt_long_~longindex#1.base, getopt_long_~longindex#1.offset;havoc getopt_long_#in~argc#1, getopt_long_#in~argv#1.base, getopt_long_#in~argv#1.offset, getopt_long_#in~optstring#1.base, getopt_long_#in~optstring#1.offset, getopt_long_#in~longopts#1.base, getopt_long_#in~longopts#1.offset, getopt_long_#in~longindex#1.base, getopt_long_#in~longindex#1.offset;assume { :end_inline_getopt_long } true;assume -2147483648 <= getopt32_#t~ret161#1 && getopt32_#t~ret161#1 <= 2147483647;getopt32_~c~0#1 := getopt32_#t~ret161#1;havoc getopt32_#t~ret161#1; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713-2: getopt_long_#t~ret364#1 := getopt_#res#1;havoc getopt_#t~mem344#1.base, getopt_#t~mem344#1.offset, getopt_#t~mem345#1, getopt_#t~short346#1, getopt_#t~nondet347#1, getopt_#t~nondet348#1, getopt_#t~mem349#1, getopt_#t~short350#1, getopt_#t~nondet351#1, getopt_#t~mem352#1, getopt_#t~nondet353#1, getopt_#t~pre354#1, getopt_#t~mem355#1, getopt_#t~short356#1, getopt_#t~nondet357#1, getopt_#t~mem358#1.base, getopt_#t~mem358#1.offset, getopt_#t~pre359#1, getopt_~argc#1, getopt_~argv#1.base, getopt_~argv#1.offset, getopt_~optstring#1.base, getopt_~optstring#1.offset, getopt_~result~0#1, getopt_~opt_index~0#1;havoc getopt_#in~argc#1, getopt_#in~argv#1.base, getopt_#in~argv#1.offset, getopt_#in~optstring#1.base, getopt_#in~optstring#1.offset;assume { :end_inline_getopt } true;assume -2147483648 <= getopt_long_#t~ret364#1 && getopt_long_#t~ret364#1 <= 2147483647;getopt_long_#res#1 := getopt_long_#t~ret364#1;havoc getopt_long_#t~ret364#1; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3548: xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset := xzalloc_#t~ret282#1.base, xzalloc_#t~ret282#1.offset;havoc xzalloc_#t~ret282#1.base, xzalloc_#t~ret282#1.offset; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3548-1: SUMMARY for call xzalloc_#t~ret282#1.base, xzalloc_#t~ret282#1.offset := xmalloc(xzalloc_~size#1); srcloc: null [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3383: assume 0 == __main_#t~mem248#1;havoc __main_#t~mem248#1;__main_~tmp_if_expr$3~1#1 := 1; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3383: assume !(0 == __main_#t~mem248#1);havoc __main_#t~mem248#1;call __main_#t~mem249#1 := read~int(__main_~base~0#1.base, 1 + __main_~base~0#1.offset, 1); [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3549-1: SUMMARY for call xzalloc_#t~memset~res283#1.base, xzalloc_#t~memset~res283#1.offset := #Ultimate.C_memset(xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset, 0, xzalloc_~size#1); srcloc: null [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3549: havoc xzalloc_#t~memset~res283#1.base, xzalloc_#t~memset~res283#1.offset;xzalloc_#res#1.base, xzalloc_#res#1.offset := xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3484: assume 45 == xstrtou_range_sfx_#t~mem266#1;havoc xstrtou_range_sfx_#t~mem266#1;xstrtou_range_sfx_~tmp_if_expr$1~4#1 := 1; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3484: assume !(45 == xstrtou_range_sfx_#t~mem266#1);havoc xstrtou_range_sfx_#t~mem266#1;call xstrtou_range_sfx_#t~mem267#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1);xstrtou_range_sfx_~tmp_if_expr$1~4#1 := (if 0 == (if 0 != (if 43 == xstrtou_range_sfx_#t~mem267#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3517: assume 0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1;call xstrtou_range_sfx_#t~mem276#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4); [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3517: assume !(0 == xstrtou_range_sfx_~tmp_statement_expression$4~0#1);havoc xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_~suffixes#1.base, 8 + xstrtou_range_sfx_~suffixes#1.offset; [2025-02-08 13:28:06,015 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume 2 == getopt32_#t~mem182#1;havoc getopt32_#t~mem182#1;havoc getopt32_~return_value_xatoi_positive$13~0#1;assume { :begin_inline_xatoi_positive } true;xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset := ~optarg~0.base, ~optarg~0.offset;havoc xatoi_positive_#res#1;havoc xatoi_positive_#t~ret261#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset := xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;havoc xatoi_positive_~return_value_xatou_range$1~0#1;assume { :begin_inline_xatou_range } true;xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset, xatou_range_#in~lower#1, xatou_range_#in~upper#1 := xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, 0, 2147483647;havoc xatou_range_#res#1;havoc xatou_range_#t~ret262#1, xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, xatou_range_~lower#1, xatou_range_~upper#1, xatou_range_~return_value_xstrtou_range_sfx$1~0#1;xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset := xatou_range_#in~numstr#1.base, xatou_range_#in~numstr#1.offset;xatou_range_~lower#1 := xatou_range_#in~lower#1;xatou_range_~upper#1 := xatou_range_#in~upper#1;havoc xatou_range_~return_value_xstrtou_range_sfx$1~0#1;assume { :begin_inline_xstrtou_range_sfx } true;xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset, xstrtou_range_sfx_#in~base#1, xstrtou_range_sfx_#in~lower#1, xstrtou_range_sfx_#in~upper#1, xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset := xatou_range_~numstr#1.base, xatou_range_~numstr#1.offset, 10, xatou_range_~lower#1, xatou_range_~upper#1, 0, 0;havoc xstrtou_range_sfx_#res#1;havoc xstrtou_range_sfx_#t~mem266#1, xstrtou_range_sfx_#t~mem267#1, xstrtou_range_sfx_#t~mem268#1, xstrtou_range_sfx_~bb__isspace~0#1, xstrtou_range_sfx_#t~mem269#1, xstrtou_range_sfx_#t~ret270#1, xstrtou_range_sfx_#t~mem271#1.base, xstrtou_range_sfx_#t~mem271#1.offset, xstrtou_range_sfx_#t~mem272#1, xstrtou_range_sfx_#t~mem273#1, xstrtou_range_sfx_#t~mem274#1.base, xstrtou_range_sfx_#t~mem274#1.offset, xstrtou_range_sfx_#t~nondet275#1, xstrtou_range_sfx_#t~mem276#1, xstrtou_range_sfx_#t~mem277#1, xstrtou_range_sfx_~__s1_len~0#1, xstrtou_range_sfx_~__s2_len~0#1, xstrtou_range_sfx_~return_value___builtin_strcmp$5~0#1, xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset, xstrtou_range_sfx_#t~mem279#1, xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset, xstrtou_range_sfx_#t~varargs281#1.base, xstrtou_range_sfx_#t~varargs281#1.offset, xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~base#1, xstrtou_range_sfx_~lower#1, xstrtou_range_sfx_~upper#1, xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset, xstrtou_range_sfx_~r~1#1, xstrtou_range_sfx_~old_errno~0#1, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~tmp_if_expr$1~4#1, xstrtou_range_sfx_~tmp_if_expr$3~2#1, xstrtou_range_sfx_~tmp_statement_expression$2~0#1, xstrtou_range_sfx_~tmp_statement_expression$4~0#1;xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset := xstrtou_range_sfx_#in~numstr#1.base, xstrtou_range_sfx_#in~numstr#1.offset;xstrtou_range_sfx_~base#1 := xstrtou_range_sfx_#in~base#1;xstrtou_range_sfx_~lower#1 := xstrtou_range_sfx_#in~lower#1;xstrtou_range_sfx_~upper#1 := xstrtou_range_sfx_#in~upper#1;xstrtou_range_sfx_~suffixes#1.base, xstrtou_range_sfx_~suffixes#1.offset := xstrtou_range_sfx_#in~suffixes#1.base, xstrtou_range_sfx_#in~suffixes#1.offset;havoc xstrtou_range_sfx_~r~1#1;havoc xstrtou_range_sfx_~old_errno~0#1;call xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset := #Ultimate.allocOnStack(8);havoc xstrtou_range_sfx_~tmp_if_expr$1~4#1;call xstrtou_range_sfx_#t~mem266#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: assume !(2 == getopt32_#t~mem182#1);havoc getopt32_#t~mem182#1;call getopt32_#t~mem185#1.base, getopt32_#t~mem185#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2627: assume bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295;call write~int(34, ~bb_errno~0.base, ~bb_errno~0.offset, 4);bb_strtoui_#res#1 := 4294967295; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2627: assume !(bb_strtoui_~v~0#1 % 18446744073709551616 > 4294967295);bb_strtoui_#res#1 := bb_strtoui_~v~0#1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3519: assume !(4294967295 / (xstrtou_range_sfx_#t~mem276#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem276#1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3519: assume !!(4294967295 / (xstrtou_range_sfx_#t~mem276#1 % 4294967296) % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296);havoc xstrtou_range_sfx_#t~mem276#1;call xstrtou_range_sfx_#t~mem277#1 := read~int(xstrtou_range_sfx_~suffixes#1.base, 4 + xstrtou_range_sfx_~suffixes#1.offset, 4);xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_~r~1#1 * xstrtou_range_sfx_#t~mem277#1;havoc xstrtou_range_sfx_#t~mem277#1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: assume 46 == __main_#t~mem249#1;havoc __main_#t~mem249#1;call __main_#t~mem250#1 := read~int(__main_~base~0#1.base, 2 + __main_~base~0#1.offset, 1);__main_~tmp_if_expr$2~3#1 := (if 0 == (if 0 != (if !(0 != __main_#t~mem250#1) then 1 else 0) then 1 else 0) then 0 else 1);havoc __main_#t~mem250#1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: assume !(46 == __main_#t~mem249#1);havoc __main_#t~mem249#1;__main_~tmp_if_expr$2~3#1 := 0; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3124: getopt32_#t~ret183#1 := xatoi_positive_#res#1;havoc xatoi_positive_#t~ret261#1, xatoi_positive_~numstr#1.base, xatoi_positive_~numstr#1.offset, xatoi_positive_~return_value_xatou_range$1~0#1;havoc xatoi_positive_#in~numstr#1.base, xatoi_positive_#in~numstr#1.offset;assume { :end_inline_xatoi_positive } true;assume -2147483648 <= getopt32_#t~ret183#1 && getopt32_#t~ret183#1 <= 2147483647;getopt32_~return_value_xatoi_positive$13~0#1 := getopt32_#t~ret183#1;havoc getopt32_#t~ret183#1;call getopt32_#t~mem184#1.base, getopt32_#t~mem184#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~int(getopt32_~return_value_xatoi_positive$13~0#1, getopt32_#t~mem184#1.base, getopt32_#t~mem184#1.offset, 4);havoc getopt32_~return_value_xatoi_positive$13~0#1;havoc getopt32_#t~mem184#1.base, getopt32_#t~mem184#1.offset; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3488: havoc xstrtou_range_sfx_~tmp_if_expr$3~2#1;havoc xstrtou_range_sfx_~tmp_statement_expression$2~0#1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$1~4#1 % 256);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := 1; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3490: assume !!(0 == xstrtou_range_sfx_~tmp_if_expr$1~4#1 % 256);call xstrtou_range_sfx_#t~mem268#1 := read~int(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, 1); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3194: assume true;call llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3194: assume !true; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3194-2: assume !!(llist_add_to_end_#t~mem197#1.base == 0 && llist_add_to_end_#t~mem197#1.offset == 0);havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3194-2: assume !(llist_add_to_end_#t~mem197#1.base == 0 && llist_add_to_end_#t~mem197#1.offset == 0);havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset;call llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset := llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset;havoc llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: assume !(getopt32_#t~mem185#1.base == 0 && getopt32_#t~mem185#1.offset == 0);havoc getopt32_#t~mem185#1.base, getopt32_#t~mem185#1.offset;call getopt32_#t~mem186#1.base, getopt32_#t~mem186#1.offset := read~$Pointer$(getopt32_~on_off~0#1.base, 18 + getopt32_~on_off~0#1.offset, 8);call write~$Pointer$(~optarg~0.base, ~optarg~0.offset, getopt32_#t~mem186#1.base, getopt32_#t~mem186#1.offset, 8); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: assume !!(getopt32_#t~mem185#1.base == 0 && getopt32_#t~mem185#1.offset == 0);havoc getopt32_#t~mem185#1.base, getopt32_#t~mem185#1.offset; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: bb_get_last_path_component_strip_#t~ret42#1.base, bb_get_last_path_component_strip_#t~ret42#1.offset := bb_get_last_path_component_nostrip_#res#1.base, bb_get_last_path_component_nostrip_#res#1.offset;havoc bb_get_last_path_component_nostrip_#t~nondet37#1.base, bb_get_last_path_component_nostrip_#t~nondet37#1.offset, bb_get_last_path_component_nostrip_#t~nondet38#1, bb_get_last_path_component_nostrip_#t~mem39#1, bb_get_last_path_component_nostrip_~path#1.base, bb_get_last_path_component_nostrip_~path#1.offset, bb_get_last_path_component_nostrip_~slash~0#1.base, bb_get_last_path_component_nostrip_~slash~0#1.offset, bb_get_last_path_component_nostrip_~tmp_if_expr$2~0#1, bb_get_last_path_component_nostrip_~tmp_if_expr$1~0#1;havoc bb_get_last_path_component_nostrip_#in~path#1.base, bb_get_last_path_component_nostrip_#in~path#1.offset;assume { :end_inline_bb_get_last_path_component_nostrip } true;bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.base, bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.offset := bb_get_last_path_component_strip_#t~ret42#1.base, bb_get_last_path_component_strip_#t~ret42#1.offset;havoc bb_get_last_path_component_strip_#t~ret42#1.base, bb_get_last_path_component_strip_#t~ret42#1.offset;bb_get_last_path_component_strip_#res#1.base, bb_get_last_path_component_strip_#res#1.offset := bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.base, bb_get_last_path_component_strip_~return_value_bb_get_last_path_component_nostrip$2~0#1.offset; [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525-1: call xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8);call xstrtou_range_sfx_#t~mem279#1 := read~int(xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset, 1); [2025-02-08 13:28:06,016 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525: assume 0 == xstrtou_range_sfx_#t~mem279#1;havoc xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset;havoc xstrtou_range_sfx_#t~mem279#1; [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525: assume !(0 == xstrtou_range_sfx_#t~mem279#1);havoc xstrtou_range_sfx_#t~mem278#1.base, xstrtou_range_sfx_#t~mem278#1.offset;havoc xstrtou_range_sfx_#t~mem279#1; [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3393: __main_~tmp_if_expr$3~1#1 := (if 0 == (if 0 != (if 0 != __main_~tmp_if_expr$2~3#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3196: havoc llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;assume { :begin_inline_xzalloc } true;xzalloc_#in~size#1 := 16;havoc xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret282#1.base, xzalloc_#t~ret282#1.offset, xzalloc_#t~memset~res283#1.base, xzalloc_#t~memset~res283#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;xzalloc_~size#1 := xzalloc_#in~size#1;havoc xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset; [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: assume xstrtou_range_sfx_#t~mem268#1 - 9 <= 2147483647;xstrtou_range_sfx_~bb__isspace~0#1 := xstrtou_range_sfx_#t~mem268#1 - 9;havoc xstrtou_range_sfx_#t~mem268#1;xstrtou_range_sfx_~tmp_statement_expression$2~0#1 := (if 0 == (if 23 == (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) || (if xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 <= 2147483647 then xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 else xstrtou_range_sfx_~bb__isspace~0#1 % 256 % 4294967296 - 4294967296) <= 4 then 1 else 0) then 0 else 1);xstrtou_range_sfx_~tmp_if_expr$3~2#1 := (if 0 == (if 0 != (if 0 != xstrtou_range_sfx_~tmp_statement_expression$2~0#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1);havoc xstrtou_range_sfx_~bb__isspace~0#1; [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: assume !(xstrtou_range_sfx_#t~mem268#1 - 9 <= 2147483647); [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494-1: assume xstrtou_range_sfx_#t~mem268#1 - 9 >= -2147483648; [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494-1: assume !(xstrtou_range_sfx_#t~mem268#1 - 9 >= -2147483648); [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3395: __main_~tmp_if_expr$4~1#1 := (if 0 == (if 0 != (if 0 != __main_~tmp_if_expr$3~1#1 % 256 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:28:06,017 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset := xzalloc_#res#1.base, xzalloc_#res#1.offset;havoc xzalloc_#t~ret282#1.base, xzalloc_#t~ret282#1.offset, xzalloc_#t~memset~res283#1.base, xzalloc_#t~memset~res283#1.offset, xzalloc_~size#1, xzalloc_~ptr~1#1.base, xzalloc_~ptr~1#1.offset;havoc xzalloc_#in~size#1;assume { :end_inline_xzalloc } true;llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset := llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset;havoc llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset;call write~$Pointer$(llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#1.offset := read~$Pointer$(llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, 8);call write~$Pointer$(llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_#t~mem200#1.base, 8 + llist_add_to_end_#t~mem200#1.offset, 8);havoc llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#1.offset;havoc llist_add_to_end_#t~mem197#1.base, llist_add_to_end_#t~mem197#1.offset, llist_add_to_end_#t~mem198#1.base, llist_add_to_end_#t~mem198#1.offset, llist_add_to_end_#t~ret199#1.base, llist_add_to_end_#t~ret199#1.offset, llist_add_to_end_#t~mem200#1.base, llist_add_to_end_#t~mem200#1.offset, llist_add_to_end_~list_head#1.base, llist_add_to_end_~list_head#1.offset, llist_add_to_end_~data#1.base, llist_add_to_end_~data#1.offset, llist_add_to_end_~return_value_xzalloc$1~0#1.base, llist_add_to_end_~return_value_xzalloc$1~0#1.offset;havoc llist_add_to_end_#in~list_head#1.base, llist_add_to_end_#in~list_head#1.offset, llist_add_to_end_#in~data#1.base, llist_add_to_end_#in~data#1.offset;assume { :end_inline_llist_add_to_end } true; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3098-1: assume true; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3098-1: assume !true; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3529: assume xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3529: assume !(xstrtou_range_sfx_~r~1#1 % 4294967296 >= xstrtou_range_sfx_~lower#1 % 4294967296); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: assume -1 == getopt32_~c~0#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: assume !(-1 == getopt32_~c~0#1);getopt32_~c~0#1 := getopt32_~c~0#1 % 256;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3498: havoc xstrtou_range_sfx_~tmp_statement_expression$4~0#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3531: assume xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296;xstrtou_range_sfx_#res#1 := xstrtou_range_sfx_~r~1#1;call ULTIMATE.dealloc(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset);havoc xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3531: assume !(xstrtou_range_sfx_~upper#1 % 4294967296 >= xstrtou_range_sfx_~r~1#1 % 4294967296); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3399: assume !(0 == __main_~tmp_if_expr$4~1#1 % 256);call __main_#t~varargs251#1.base, __main_#t~varargs251#1.offset := #Ultimate.allocOnHeap(0); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3399: assume !!(0 == __main_~tmp_if_expr$4~1#1 % 256);call __main_#t~mem252#1.base, __main_#t~mem252#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: assume 0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256;call xstrtou_range_sfx_#t~mem269#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);xstrtou_range_sfx_~old_errno~0#1 := xstrtou_range_sfx_#t~mem269#1;havoc xstrtou_range_sfx_#t~mem269#1;call write~int(0, ~bb_errno~0.base, ~bb_errno~0.offset, 4);assume { :begin_inline_bb_strtoui } true;bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1 := xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, xstrtou_range_sfx_~base#1;havoc bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet46#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset := bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset;bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset := bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset;bb_strtoui_~b#1 := bb_strtoui_#in~b#1;havoc bb_strtoui_~v~0#1;bb_strtoui_~v~0#1 := bb_strtoui_#t~nondet46#1;havoc bb_strtoui_#t~nondet46#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3499: assume !(0 == xstrtou_range_sfx_~tmp_if_expr$3~2#1 % 256); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3400: SUMMARY for call bb_error_msg(19, 0, __main_#t~varargs251#1.base, __main_#t~varargs251#1.offset); srcloc: null [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: assume true;call getopt32_#t~mem162#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105: assume !true; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105-2: assume !!((if getopt32_#t~mem162#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem162#1 % 256 % 4294967296 else getopt32_#t~mem162#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem162#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3105-2: assume !((if getopt32_#t~mem162#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem162#1 % 256 % 4294967296 else getopt32_#t~mem162#1 % 256 % 4294967296 - 4294967296) == getopt32_~c~0#1);havoc getopt32_#t~mem162#1;call getopt32_#t~mem163#1 := read~int(getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset, 1); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3403-1: SUMMARY for call __main_#t~ret253#1 := remove_file(__main_#t~mem252#1.base, __main_#t~mem252#1.offset, __main_~flags~1#1); srcloc: null [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3403: assume -2147483648 <= __main_#t~ret253#1 && __main_#t~ret253#1 <= 2147483647;__main_~return_value_remove_file$1~0#1 := __main_#t~ret253#1;havoc __main_#t~mem252#1.base, __main_#t~mem252#1.offset;havoc __main_#t~ret253#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume 0 == (if getopt32_#t~mem163#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem163#1 % 256 % 4294967296 else getopt32_#t~mem163#1 % 256 % 4294967296 - 4294967296);havoc getopt32_#t~mem163#1; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: assume !(0 == (if getopt32_#t~mem163#1 % 256 % 4294967296 <= 2147483647 then getopt32_#t~mem163#1 % 256 % 4294967296 else getopt32_#t~mem163#1 % 256 % 4294967296 - 4294967296));havoc getopt32_#t~mem163#1;getopt32_~on_off~0#1.base, getopt32_~on_off~0#1.offset := getopt32_~on_off~0#1.base, 34 + getopt32_~on_off~0#1.offset; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536: havoc xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset; [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536-2: call xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset := #Ultimate.allocOnHeap(24);call write~$Pointer$(xstrtou_range_sfx_~numstr#1.base, xstrtou_range_sfx_~numstr#1.offset, xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset, 8);call write~int(xstrtou_range_sfx_~lower#1 % 4294967296, xstrtou_range_sfx_#t~varargs280#1.base, 8 + xstrtou_range_sfx_#t~varargs280#1.offset, 8);call write~int(xstrtou_range_sfx_~upper#1 % 4294967296, xstrtou_range_sfx_#t~varargs280#1.base, 16 + xstrtou_range_sfx_#t~varargs280#1.offset, 8); [2025-02-08 13:28:06,018 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536-1: SUMMARY for call bb_error_msg_and_die(20, 0, xstrtou_range_sfx_#t~varargs280#1.base, xstrtou_range_sfx_#t~varargs280#1.offset); srcloc: null [2025-02-08 13:28:06,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3503: xstrtou_range_sfx_#t~ret270#1 := bb_strtoui_#res#1;havoc bb_strtoui_#t~nondet46#1, bb_strtoui_~str#1.base, bb_strtoui_~str#1.offset, bb_strtoui_~end#1.base, bb_strtoui_~end#1.offset, bb_strtoui_~b#1, bb_strtoui_~v~0#1;havoc bb_strtoui_#in~str#1.base, bb_strtoui_#in~str#1.offset, bb_strtoui_#in~end#1.base, bb_strtoui_#in~end#1.offset, bb_strtoui_#in~b#1;assume { :end_inline_bb_strtoui } true;xstrtou_range_sfx_~r~1#1 := xstrtou_range_sfx_#t~ret270#1;havoc xstrtou_range_sfx_#t~ret270#1;call xstrtou_range_sfx_#t~mem271#1.base, xstrtou_range_sfx_#t~mem271#1.offset := read~$Pointer$(xstrtou_range_sfx_~#e~0#1.base, xstrtou_range_sfx_~#e~0#1.offset, 8); [2025-02-08 13:28:06,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: assume __main_~return_value_remove_file$1~0#1 >= 0; [2025-02-08 13:28:06,019 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: assume !(__main_~return_value_remove_file$1~0#1 >= 0); [2025-02-08 13:28:06,145 INFO L? ?]: Removed 521 outVars from TransFormulas that were not future-live. [2025-02-08 13:28:06,145 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:28:06,184 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:28:06,184 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:28:06,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:28:06 BoogieIcfgContainer [2025-02-08 13:28:06,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:28:06,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:28:06,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:28:06,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:28:06,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:28:01" (1/3) ... [2025-02-08 13:28:06,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55abca10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:28:06, skipping insertion in model container [2025-02-08 13:28:06,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:28:02" (2/3) ... [2025-02-08 13:28:06,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55abca10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:28:06, skipping insertion in model container [2025-02-08 13:28:06,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:28:06" (3/3) ... [2025-02-08 13:28:06,197 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-2.i [2025-02-08 13:28:06,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:28:06,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-2.i that has 16 procedures, 541 locations, 1 initial locations, 34 loop locations, and 70 error locations. [2025-02-08 13:28:06,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:28:06,276 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;@7e68d54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:28:06,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-02-08 13:28:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 503 states, 377 states have (on average 1.660477453580902) internal successors, (626), 462 states have internal predecessors, (626), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-08 13:28:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:28:06,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:06,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:28:06,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1185610, now seen corresponding path program 1 times [2025-02-08 13:28:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012569751] [2025-02-08 13:28:06,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:06,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:28:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:28:06,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:06,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,075 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:28:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012569751] [2025-02-08 13:28:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012569751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:07,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:28:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225923238] [2025-02-08 13:28:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:07,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:07,095 INFO L87 Difference]: Start difference. First operand has 503 states, 377 states have (on average 1.660477453580902) internal successors, (626), 462 states have internal predecessors, (626), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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:28:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:07,183 INFO L93 Difference]: Finished difference Result 642 states and 879 transitions. [2025-02-08 13:28:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:07,190 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:28:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:07,199 INFO L225 Difference]: With dead ends: 642 [2025-02-08 13:28:07,199 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 13:28:07,211 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:28:07,213 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:07,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 510 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:07,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 13:28:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-08 13:28:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 181 states have internal predecessors, (227), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 243 transitions. [2025-02-08 13:28:07,280 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 243 transitions. Word has length 3 [2025-02-08 13:28:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:07,281 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 243 transitions. [2025-02-08 13:28:07,281 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:28:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 243 transitions. [2025-02-08 13:28:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:28:07,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:07,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:28:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:28:07,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:07,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash 961890365, now seen corresponding path program 1 times [2025-02-08 13:28:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623484400] [2025-02-08 13:28:07,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:07,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:07,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:07,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:07,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:07,767 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:28:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623484400] [2025-02-08 13:28:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623484400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063060880] [2025-02-08 13:28:07,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:07,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:07,770 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:28:07,772 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:28:08,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:28:08,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:28:08,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:08,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:08,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1734 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:08,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:08,365 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:28:08,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063060880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:28:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345857775] [2025-02-08 13:28:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:08,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:08,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:08,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:08,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:08,369 INFO L87 Difference]: Start difference. First operand 195 states and 243 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:28:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:09,209 INFO L93 Difference]: Finished difference Result 195 states and 243 transitions. [2025-02-08 13:28:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:09,210 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:28:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:09,211 INFO L225 Difference]: With dead ends: 195 [2025-02-08 13:28:09,211 INFO L226 Difference]: Without dead ends: 194 [2025-02-08 13:28:09,211 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:28:09,211 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:09,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 459 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 13:28:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-08 13:28:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-02-08 13:28:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 148 states have (on average 1.527027027027027) internal successors, (226), 180 states have internal predecessors, (226), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 242 transitions. [2025-02-08 13:28:09,230 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 242 transitions. Word has length 6 [2025-02-08 13:28:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:09,230 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 242 transitions. [2025-02-08 13:28:09,230 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:28:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 242 transitions. [2025-02-08 13:28:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:28:09,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:09,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:28:09,240 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:28:09,435 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:28:09,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:09,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash -246168628, now seen corresponding path program 1 times [2025-02-08 13:28:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:09,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532157747] [2025-02-08 13:28:09,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:09,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:09,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:28:09,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:28:09,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:09,777 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:28:09,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:09,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532157747] [2025-02-08 13:28:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532157747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:09,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716340515] [2025-02-08 13:28:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:09,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:09,779 INFO L87 Difference]: Start difference. First operand 194 states and 242 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:28:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:09,818 INFO L93 Difference]: Finished difference Result 194 states and 242 transitions. [2025-02-08 13:28:09,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:09,818 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:28:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:09,819 INFO L225 Difference]: With dead ends: 194 [2025-02-08 13:28:09,819 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 13:28:09,820 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:09,820 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:09,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 13:28:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-02-08 13:28:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 177 states have internal predecessors, (223), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 239 transitions. [2025-02-08 13:28:09,826 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 239 transitions. Word has length 7 [2025-02-08 13:28:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 239 transitions. [2025-02-08 13:28:09,826 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:28:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 239 transitions. [2025-02-08 13:28:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:28:09,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:09,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:09,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:28:09,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash 371695498, now seen corresponding path program 1 times [2025-02-08 13:28:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878753222] [2025-02-08 13:28:09,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:09,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:09,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:09,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:09,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:09,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:10,209 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:28:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878753222] [2025-02-08 13:28:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878753222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005855535] [2025-02-08 13:28:10,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:10,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:10,211 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:28:10,213 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:28:10,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:28:10,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:28:10,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:10,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:10,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:10,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:10,798 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:28:10,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:10,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005855535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:10,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306381448] [2025-02-08 13:28:10,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:10,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:10,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:10,800 INFO L87 Difference]: Start difference. First operand 191 states and 239 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:28:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:11,529 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2025-02-08 13:28:11,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:11,529 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:28:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:11,530 INFO L225 Difference]: With dead ends: 191 [2025-02-08 13:28:11,531 INFO L226 Difference]: Without dead ends: 189 [2025-02-08 13:28:11,531 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:28:11,531 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 187 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:11,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 263 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 13:28:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-08 13:28:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-08 13:28:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 146 states have (on average 1.5136986301369864) internal successors, (221), 175 states have internal predecessors, (221), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 237 transitions. [2025-02-08 13:28:11,538 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 237 transitions. Word has length 11 [2025-02-08 13:28:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 237 transitions. [2025-02-08 13:28:11,539 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:28:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 237 transitions. [2025-02-08 13:28:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:28:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:11,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:11,549 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:28:11,740 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:28:11,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1362340327, now seen corresponding path program 1 times [2025-02-08 13:28:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609993249] [2025-02-08 13:28:11,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:11,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:11,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:11,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:11,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:12,183 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:28:12,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609993249] [2025-02-08 13:28:12,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609993249] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:12,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656511008] [2025-02-08 13:28:12,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:12,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:12,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:12,187 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:28:12,201 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:28:12,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:28:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:28:12,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:12,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:12,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:12,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:12,796 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:28:12,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:12,833 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:28:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656511008] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:12,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:12,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:28:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499386083] [2025-02-08 13:28:12,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:12,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:12,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:12,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:12,834 INFO L87 Difference]: Start difference. First operand 189 states and 237 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:28:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:12,879 INFO L93 Difference]: Finished difference Result 382 states and 480 transitions. [2025-02-08 13:28:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:12,879 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:28:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:12,880 INFO L225 Difference]: With dead ends: 382 [2025-02-08 13:28:12,880 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 13:28:12,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:12,881 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:12,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 13:28:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-02-08 13:28:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 184 states have internal predecessors, (230), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 246 transitions. [2025-02-08 13:28:12,896 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 246 transitions. Word has length 12 [2025-02-08 13:28:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 246 transitions. [2025-02-08 13:28:12,896 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:28:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 246 transitions. [2025-02-08 13:28:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:28:12,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:12,896 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:12,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 13:28:13,096 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:28:13,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:13,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:13,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1805405606, now seen corresponding path program 2 times [2025-02-08 13:28:13,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104278479] [2025-02-08 13:28:13,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:13,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:13,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:28:13,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:28:13,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:13,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:13,545 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:28:13,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:13,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104278479] [2025-02-08 13:28:13,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104278479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:13,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:13,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739406896] [2025-02-08 13:28:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:13,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:13,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:13,546 INFO L87 Difference]: Start difference. First operand 198 states and 246 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:28:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:14,498 INFO L93 Difference]: Finished difference Result 198 states and 246 transitions. [2025-02-08 13:28:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:14,499 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:28:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:14,499 INFO L225 Difference]: With dead ends: 198 [2025-02-08 13:28:14,500 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 13:28:14,500 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:28:14,500 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 186 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:14,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 694 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 13:28:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 13:28:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 13:28:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 182 states have internal predecessors, (228), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2025-02-08 13:28:14,509 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 21 [2025-02-08 13:28:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2025-02-08 13:28:14,510 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:28:14,510 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2025-02-08 13:28:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:28:14,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:14,510 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:28:14,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:28:14,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:14,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash 907202840, now seen corresponding path program 1 times [2025-02-08 13:28:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772079824] [2025-02-08 13:28:14,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:28:14,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:28:14,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:14,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:14,808 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:28:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772079824] [2025-02-08 13:28:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772079824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:28:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224611641] [2025-02-08 13:28:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:14,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:14,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:14,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:14,809 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:15,792 INFO L93 Difference]: Finished difference Result 376 states and 473 transitions. [2025-02-08 13:28:15,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:15,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-02-08 13:28:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:15,794 INFO L225 Difference]: With dead ends: 376 [2025-02-08 13:28:15,794 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 13:28:15,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:15,795 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 2 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:15,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 449 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 13:28:15,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 13:28:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-08 13:28:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 158 states have (on average 1.4620253164556962) internal successors, (231), 185 states have internal predecessors, (231), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:15,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2025-02-08 13:28:15,805 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 26 [2025-02-08 13:28:15,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:15,805 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2025-02-08 13:28:15,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2025-02-08 13:28:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 13:28:15,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:15,806 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:28:15,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1941816576, now seen corresponding path program 1 times [2025-02-08 13:28:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577355156] [2025-02-08 13:28:15,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:15,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:15,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 13:28:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 13:28:15,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:15,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:16,102 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:28:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577355156] [2025-02-08 13:28:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577355156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:16,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522723383] [2025-02-08 13:28:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:16,104 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:16,139 INFO L93 Difference]: Finished difference Result 316 states and 402 transitions. [2025-02-08 13:28:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:16,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-02-08 13:28:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:16,140 INFO L225 Difference]: With dead ends: 316 [2025-02-08 13:28:16,140 INFO L226 Difference]: Without dead ends: 314 [2025-02-08 13:28:16,140 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:16,141 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 140 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:16,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 449 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-08 13:28:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2025-02-08 13:28:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 162 states have (on average 1.4567901234567902) internal successors, (236), 189 states have internal predecessors, (236), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 252 transitions. [2025-02-08 13:28:16,149 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 252 transitions. Word has length 27 [2025-02-08 13:28:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:16,149 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 252 transitions. [2025-02-08 13:28:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 252 transitions. [2025-02-08 13:28:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:16,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:16,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:16,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:28:16,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:16,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1743515553, now seen corresponding path program 1 times [2025-02-08 13:28:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27436552] [2025-02-08 13:28:16,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:16,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:16,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 13:28:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27436552] [2025-02-08 13:28:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27436552] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:16,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5239015] [2025-02-08 13:28:16,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:16,480 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:28:16,481 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:28:16,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:16,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:16,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:16,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:17,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1919 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:28:17,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 13:28:17,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5239015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:17,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:17,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:28:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577804917] [2025-02-08 13:28:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:17,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:17,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:17,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:17,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:17,027 INFO L87 Difference]: Start difference. First operand 203 states and 252 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:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:17,661 INFO L93 Difference]: Finished difference Result 203 states and 252 transitions. [2025-02-08 13:28:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2025-02-08 13:28:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:17,662 INFO L225 Difference]: With dead ends: 203 [2025-02-08 13:28:17,662 INFO L226 Difference]: Without dead ends: 202 [2025-02-08 13:28:17,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:17,663 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:17,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 439 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 13:28:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-08 13:28:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-08 13:28:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 162 states have (on average 1.4506172839506173) internal successors, (235), 188 states have internal predecessors, (235), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2025-02-08 13:28:17,670 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 29 [2025-02-08 13:28:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2025-02-08 13:28:17,670 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:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2025-02-08 13:28:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:28:17,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:17,671 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:28:17,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:17,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 13:28:17,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1743515393, now seen corresponding path program 1 times [2025-02-08 13:28:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:17,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114860125] [2025-02-08 13:28:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:18,224 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:28:18,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114860125] [2025-02-08 13:28:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114860125] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369438326] [2025-02-08 13:28:18,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:18,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:18,226 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:18,228 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:18,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:28:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:28:18,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:18,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:18,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:18,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:18,807 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:28:18,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:18,881 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:28:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369438326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:18,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:28:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603035999] [2025-02-08 13:28:18,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:18,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:28:18,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:18,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:28:18,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:18,883 INFO L87 Difference]: Start difference. First operand 202 states and 251 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:28:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:20,261 INFO L93 Difference]: Finished difference Result 407 states and 511 transitions. [2025-02-08 13:28:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:28:20,261 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:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:20,262 INFO L225 Difference]: With dead ends: 407 [2025-02-08 13:28:20,262 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 13:28:20,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:28:20,263 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 5 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:20,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1310 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 13:28:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 13:28:20,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-08 13:28:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.4) internal successors, (252), 205 states have internal predecessors, (252), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 268 transitions. [2025-02-08 13:28:20,274 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 268 transitions. Word has length 29 [2025-02-08 13:28:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:20,274 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 268 transitions. [2025-02-08 13:28:20,274 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:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 268 transitions. [2025-02-08 13:28:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:20,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:20,276 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:20,288 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:20,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 13:28:20,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:20,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash -407583115, now seen corresponding path program 1 times [2025-02-08 13:28:20,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:20,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651681741] [2025-02-08 13:28:20,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:20,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:20,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:20,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:20,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:20,772 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:20,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:20,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651681741] [2025-02-08 13:28:20,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651681741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:20,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:20,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249558276] [2025-02-08 13:28:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:20,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:20,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:20,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:20,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:20,775 INFO L87 Difference]: Start difference. First operand 219 states and 268 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:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:21,313 INFO L93 Difference]: Finished difference Result 230 states and 281 transitions. [2025-02-08 13:28:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:21,313 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:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:21,314 INFO L225 Difference]: With dead ends: 230 [2025-02-08 13:28:21,314 INFO L226 Difference]: Without dead ends: 229 [2025-02-08 13:28:21,315 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:21,315 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:21,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 443 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 13:28:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-08 13:28:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2025-02-08 13:28:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 214 states have internal predecessors, (264), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 280 transitions. [2025-02-08 13:28:21,328 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 280 transitions. Word has length 48 [2025-02-08 13:28:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:21,329 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 280 transitions. [2025-02-08 13:28:21,330 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:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 280 transitions. [2025-02-08 13:28:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:28:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:21,330 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:21,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:28:21,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:21,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -407578150, now seen corresponding path program 1 times [2025-02-08 13:28:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225734516] [2025-02-08 13:28:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:28:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:28:21,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:21,625 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:21,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:21,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225734516] [2025-02-08 13:28:21,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225734516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:21,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:21,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:21,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443648271] [2025-02-08 13:28:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:21,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:21,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:21,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:21,627 INFO L87 Difference]: Start difference. First operand 228 states and 280 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:22,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:22,815 INFO L93 Difference]: Finished difference Result 228 states and 280 transitions. [2025-02-08 13:28:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:22,816 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:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:22,817 INFO L225 Difference]: With dead ends: 228 [2025-02-08 13:28:22,817 INFO L226 Difference]: Without dead ends: 227 [2025-02-08 13:28:22,817 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:22,817 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:22,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 13:28:22,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-08 13:28:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2025-02-08 13:28:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 185 states have (on average 1.3945945945945946) internal successors, (258), 209 states have internal predecessors, (258), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 274 transitions. [2025-02-08 13:28:22,824 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 274 transitions. Word has length 48 [2025-02-08 13:28:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:22,824 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 274 transitions. [2025-02-08 13:28:22,825 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:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 274 transitions. [2025-02-08 13:28:22,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 13:28:22,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:22,825 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:22,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 13:28:22,826 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:22,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:22,826 INFO L85 PathProgramCache]: Analyzing trace with hash 138615332, now seen corresponding path program 1 times [2025-02-08 13:28:22,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:22,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479945563] [2025-02-08 13:28:22,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:23,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:28:23,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:28:23,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:23,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479945563] [2025-02-08 13:28:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479945563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336347206] [2025-02-08 13:28:23,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:23,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:23,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:23,164 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:23,173 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:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 13:28:23,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 13:28:23,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:23,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:23,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:23,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:23,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336347206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-08 13:28:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707676164] [2025-02-08 13:28:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:23,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:23,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:23,762 INFO L87 Difference]: Start difference. First operand 223 states and 274 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:23,813 INFO L93 Difference]: Finished difference Result 334 states and 422 transitions. [2025-02-08 13:28:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:28:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-02-08 13:28:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:23,817 INFO L225 Difference]: With dead ends: 334 [2025-02-08 13:28:23,817 INFO L226 Difference]: Without dead ends: 333 [2025-02-08 13:28:23,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:28:23,818 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 279 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:23,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 672 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-08 13:28:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 222. [2025-02-08 13:28:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 208 states have internal predecessors, (257), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2025-02-08 13:28:23,828 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 49 [2025-02-08 13:28:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2025-02-08 13:28:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2025-02-08 13:28:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 13:28:23,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:23,831 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:23,842 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:24,031 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:24,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2109095, now seen corresponding path program 1 times [2025-02-08 13:28:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316456877] [2025-02-08 13:28:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:24,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:24,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:24,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:24,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316456877] [2025-02-08 13:28:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316456877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266297726] [2025-02-08 13:28:24,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:24,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:24,403 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:24,405 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:24,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 13:28:24,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 13:28:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:24,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:24,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:24,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 13:28:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266297726] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:24,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-08 13:28:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453940870] [2025-02-08 13:28:24,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:24,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:24,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:24,993 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:25,091 INFO L93 Difference]: Finished difference Result 679 states and 883 transitions. [2025-02-08 13:28:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:25,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-02-08 13:28:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:25,093 INFO L225 Difference]: With dead ends: 679 [2025-02-08 13:28:25,093 INFO L226 Difference]: Without dead ends: 678 [2025-02-08 13:28:25,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:25,094 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 695 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:25,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1590 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-08 13:28:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 234. [2025-02-08 13:28:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 197 states have (on average 1.380710659898477) internal successors, (272), 220 states have internal predecessors, (272), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2025-02-08 13:28:25,108 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 50 [2025-02-08 13:28:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2025-02-08 13:28:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2025-02-08 13:28:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:28:25,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:25,109 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:25,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 13:28:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:25,309 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash 526456964, now seen corresponding path program 1 times [2025-02-08 13:28:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062733011] [2025-02-08 13:28:25,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:28:25,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:28:25,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:25,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062733011] [2025-02-08 13:28:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062733011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842377914] [2025-02-08 13:28:25,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:25,611 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:25,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 13:28:26,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:28:26,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:28:26,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:26,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:26,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:26,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:26,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 13:28:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842377914] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:26,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:28:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267514208] [2025-02-08 13:28:26,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:26,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:28:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:26,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:28:26,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:26,215 INFO L87 Difference]: Start difference. First operand 234 states and 288 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:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:28,620 INFO L93 Difference]: Finished difference Result 444 states and 554 transitions. [2025-02-08 13:28:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-08 13:28:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:28,622 INFO L225 Difference]: With dead ends: 444 [2025-02-08 13:28:28,622 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 13:28:28,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:28:28,622 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:28,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 883 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 13:28:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 13:28:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-08 13:28:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 238 states have internal predecessors, (290), 10 states have call successors, (10), 7 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:28:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 306 transitions. [2025-02-08 13:28:28,630 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 306 transitions. Word has length 55 [2025-02-08 13:28:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:28,630 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 306 transitions. [2025-02-08 13:28:28,630 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:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 306 transitions. [2025-02-08 13:28:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 13:28:28,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:28,631 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:28,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 13:28:28,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 13:28:28,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:28,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1315963383, now seen corresponding path program 1 times [2025-02-08 13:28:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780784143] [2025-02-08 13:28:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:29,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 13:28:29,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 13:28:29,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:29,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:29,205 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:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780784143] [2025-02-08 13:28:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780784143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:29,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459106248] [2025-02-08 13:28:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:29,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:29,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:29,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:29,206 INFO L87 Difference]: Start difference. First operand 252 states and 306 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:29,282 INFO L93 Difference]: Finished difference Result 499 states and 633 transitions. [2025-02-08 13:28:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:29,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-02-08 13:28:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:29,283 INFO L225 Difference]: With dead ends: 499 [2025-02-08 13:28:29,283 INFO L226 Difference]: Without dead ends: 345 [2025-02-08 13:28:29,284 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:29,284 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 113 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:29,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 394 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-02-08 13:28:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 294. [2025-02-08 13:28:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.34765625) internal successors, (345), 279 states have internal predecessors, (345), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 363 transitions. [2025-02-08 13:28:29,293 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 363 transitions. Word has length 59 [2025-02-08 13:28:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:29,293 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 363 transitions. [2025-02-08 13:28:29,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 363 transitions. [2025-02-08 13:28:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-08 13:28:29,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:29,294 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:29,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 13:28:29,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:29,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1920460437, now seen corresponding path program 1 times [2025-02-08 13:28:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131665187] [2025-02-08 13:28:29,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:29,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 13:28:29,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 13:28:29,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:29,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:29,540 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:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:29,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131665187] [2025-02-08 13:28:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131665187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064247460] [2025-02-08 13:28:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:29,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:29,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:29,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:29,541 INFO L87 Difference]: Start difference. First operand 294 states and 363 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:29,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:29,565 INFO L93 Difference]: Finished difference Result 296 states and 363 transitions. [2025-02-08 13:28:29,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:29,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-02-08 13:28:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:29,567 INFO L225 Difference]: With dead ends: 296 [2025-02-08 13:28:29,567 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 13:28:29,568 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:29,568 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:29,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 13:28:29,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-08 13:28:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.33984375) internal successors, (343), 279 states have internal predecessors, (343), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 361 transitions. [2025-02-08 13:28:29,576 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 361 transitions. Word has length 61 [2025-02-08 13:28:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:29,576 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 361 transitions. [2025-02-08 13:28:29,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 361 transitions. [2025-02-08 13:28:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:28:29,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:29,577 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:29,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 13:28:29,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:29,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1278542117, now seen corresponding path program 2 times [2025-02-08 13:28:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101682174] [2025-02-08 13:28:29,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:29,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-02-08 13:28:29,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-02-08 13:28:29,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:29,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:28:30,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:30,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101682174] [2025-02-08 13:28:30,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101682174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:30,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 13:28:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355075656] [2025-02-08 13:28:30,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:28:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:30,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:28:30,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:30,023 INFO L87 Difference]: Start difference. First operand 294 states and 361 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:31,462 INFO L93 Difference]: Finished difference Result 518 states and 646 transitions. [2025-02-08 13:28:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2025-02-08 13:28:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:31,464 INFO L225 Difference]: With dead ends: 518 [2025-02-08 13:28:31,464 INFO L226 Difference]: Without dead ends: 294 [2025-02-08 13:28:31,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:31,466 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 186 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:31,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 880 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 13:28:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-08 13:28:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-08 13:28:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.3359375) internal successors, (342), 279 states have internal predecessors, (342), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 360 transitions. [2025-02-08 13:28:31,474 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 360 transitions. Word has length 62 [2025-02-08 13:28:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:31,474 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 360 transitions. [2025-02-08 13:28:31,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 360 transitions. [2025-02-08 13:28:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:28:31,475 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:31,475 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:31,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 13:28:31,475 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:31,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:31,475 INFO L85 PathProgramCache]: Analyzing trace with hash -251476204, now seen corresponding path program 2 times [2025-02-08 13:28:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704813905] [2025-02-08 13:28:31,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:31,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:31,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:28:31,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:28:31,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:31,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:28:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:31,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704813905] [2025-02-08 13:28:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704813905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:31,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448748756] [2025-02-08 13:28:31,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:31,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:31,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:31,726 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:31,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 13:28:32,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:28:32,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:28:32,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:28:32,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:32,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:28:32,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:28:32,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-02-08 13:28:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448748756] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:32,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:32,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:28:32,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291634204] [2025-02-08 13:28:32,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:32,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:28:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:32,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:28:32,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:32,481 INFO L87 Difference]: Start difference. First operand 294 states and 360 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:34,990 INFO L93 Difference]: Finished difference Result 294 states and 360 transitions. [2025-02-08 13:28:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:28:34,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-02-08 13:28:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:34,992 INFO L225 Difference]: With dead ends: 294 [2025-02-08 13:28:34,992 INFO L226 Difference]: Without dead ends: 293 [2025-02-08 13:28:34,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 13:28:34,992 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 172 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:34,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 506 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-08 13:28:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-08 13:28:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 278. [2025-02-08 13:28:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 241 states have (on average 1.3485477178423237) internal successors, (325), 263 states have internal predecessors, (325), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 343 transitions. [2025-02-08 13:28:35,000 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 343 transitions. Word has length 73 [2025-02-08 13:28:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:35,001 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 343 transitions. [2025-02-08 13:28:35,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 343 transitions. [2025-02-08 13:28:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-08 13:28:35,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:35,003 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:35,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:35,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:35,204 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:35,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash -523091677, now seen corresponding path program 1 times [2025-02-08 13:28:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:35,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739849962] [2025-02-08 13:28:35,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:35,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:28:35,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:28:35,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:35,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:28:35,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:35,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739849962] [2025-02-08 13:28:35,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739849962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:35,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141705145] [2025-02-08 13:28:35,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:35,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:35,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:35,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 13:28:35,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 13:28:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 13:28:36,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 13:28:36,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:36,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:36,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:36,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:28:36,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-08 13:28:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141705145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:36,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 13:28:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940857080] [2025-02-08 13:28:36,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:28:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:36,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:28:36,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:28:36,391 INFO L87 Difference]: Start difference. First operand 278 states and 343 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:39,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-08 13:28:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:40,567 INFO L93 Difference]: Finished difference Result 536 states and 670 transitions. [2025-02-08 13:28:40,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:28:40,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2025-02-08 13:28:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:40,569 INFO L225 Difference]: With dead ends: 536 [2025-02-08 13:28:40,569 INFO L226 Difference]: Without dead ends: 296 [2025-02-08 13:28:40,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:28:40,570 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 4 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:40,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1317 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-02-08 13:28:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-08 13:28:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-08 13:28:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 281 states have internal predecessors, (343), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2025-02-08 13:28:40,579 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 78 [2025-02-08 13:28:40,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:40,580 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2025-02-08 13:28:40,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 13:28:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2025-02-08 13:28:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 13:28:40,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:40,580 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:40,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:40,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:40,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:40,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:40,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1101802755, now seen corresponding path program 2 times [2025-02-08 13:28:40,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:40,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161125795] [2025-02-08 13:28:40,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:40,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 13:28:41,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:28:41,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:28:41,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161125795] [2025-02-08 13:28:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161125795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35385401] [2025-02-08 13:28:41,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:28:41,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:41,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:41,399 INFO L229 MonitoredProcess]: Starting monitored process 12 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,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 13:28:41,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 13:28:45,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 13:28:45,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 13:28:45,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:45,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 2365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:28:45,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:46,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:46,092 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:46,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35385401] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:28:46,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:28:46,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-08 13:28:46,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969930624] [2025-02-08 13:28:46,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:28:46,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 13:28:46,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:46,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 13:28:46,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:28:46,093 INFO L87 Difference]: Start difference. First operand 296 states and 361 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:46,327 INFO L93 Difference]: Finished difference Result 1851 states and 2427 transitions. [2025-02-08 13:28:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 13:28:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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 96 [2025-02-08 13:28:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:46,333 INFO L225 Difference]: With dead ends: 1851 [2025-02-08 13:28:46,333 INFO L226 Difference]: Without dead ends: 1850 [2025-02-08 13:28:46,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:28:46,334 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 2746 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2786 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:46,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2786 Valid, 2050 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:28:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-02-08 13:28:46,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 320. [2025-02-08 13:28:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 283 states have (on average 1.3180212014134276) internal successors, (373), 305 states have internal predecessors, (373), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 391 transitions. [2025-02-08 13:28:46,362 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 391 transitions. Word has length 96 [2025-02-08 13:28:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:46,362 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 391 transitions. [2025-02-08 13:28:46,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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,363 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 391 transitions. [2025-02-08 13:28:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 13:28:46,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:46,363 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:46,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 13:28:46,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 13:28:46,564 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 975812968, now seen corresponding path program 1 times [2025-02-08 13:28:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669115450] [2025-02-08 13:28:46,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:46,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:28:46,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:28:46,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:46,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:46,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:46,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669115450] [2025-02-08 13:28:46,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669115450] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:46,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:46,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:28:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546419971] [2025-02-08 13:28:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:46,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:28:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:46,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:28:46,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:28:46,977 INFO L87 Difference]: Start difference. First operand 320 states and 391 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:47,870 INFO L93 Difference]: Finished difference Result 423 states and 518 transitions. [2025-02-08 13:28:47,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-02-08 13:28:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:47,872 INFO L225 Difference]: With dead ends: 423 [2025-02-08 13:28:47,872 INFO L226 Difference]: Without dead ends: 329 [2025-02-08 13:28:47,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:28:47,874 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 202 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:47,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 437 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 13:28:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-08 13:28:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 320. [2025-02-08 13:28:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 283 states have (on average 1.314487632508834) internal successors, (372), 305 states have internal predecessors, (372), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 390 transitions. [2025-02-08 13:28:47,888 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 390 transitions. Word has length 102 [2025-02-08 13:28:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:47,888 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 390 transitions. [2025-02-08 13:28:47,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 390 transitions. [2025-02-08 13:28:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-08 13:28:47,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:47,889 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:47,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 13:28:47,889 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:47,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash 88309287, now seen corresponding path program 1 times [2025-02-08 13:28:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694114664] [2025-02-08 13:28:47,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:48,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 13:28:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 13:28:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:48,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694114664] [2025-02-08 13:28:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694114664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:48,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:48,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743222428] [2025-02-08 13:28:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:48,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:48,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:48,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:48,228 INFO L87 Difference]: Start difference. First operand 320 states and 390 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:48,289 INFO L93 Difference]: Finished difference Result 367 states and 456 transitions. [2025-02-08 13:28:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:48,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-02-08 13:28:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:48,292 INFO L225 Difference]: With dead ends: 367 [2025-02-08 13:28:48,292 INFO L226 Difference]: Without dead ends: 362 [2025-02-08 13:28:48,292 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:48,293 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 140 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:48,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 307 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-08 13:28:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2025-02-08 13:28:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 300 states have internal predecessors, (367), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 385 transitions. [2025-02-08 13:28:48,307 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 385 transitions. Word has length 102 [2025-02-08 13:28:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:48,307 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 385 transitions. [2025-02-08 13:28:48,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 385 transitions. [2025-02-08 13:28:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 13:28:48,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:48,308 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:48,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 13:28:48,308 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:48,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:48,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1557378522, now seen corresponding path program 1 times [2025-02-08 13:28:48,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:48,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683090860] [2025-02-08 13:28:48,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:48,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 13:28:48,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 13:28:48,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:48,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:48,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:48,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683090860] [2025-02-08 13:28:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683090860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:48,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991578450] [2025-02-08 13:28:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:48,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:48,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:48,636 INFO L87 Difference]: Start difference. First operand 315 states and 385 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:48,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:48,692 INFO L93 Difference]: Finished difference Result 362 states and 451 transitions. [2025-02-08 13:28:48,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:48,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-02-08 13:28:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:48,695 INFO L225 Difference]: With dead ends: 362 [2025-02-08 13:28:48,696 INFO L226 Difference]: Without dead ends: 357 [2025-02-08 13:28:48,696 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:48,696 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 138 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:48,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 338 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-02-08 13:28:48,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 298. [2025-02-08 13:28:48,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 271 states have (on average 1.2730627306273063) internal successors, (345), 283 states have internal predecessors, (345), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2025-02-08 13:28:48,710 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 103 [2025-02-08 13:28:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:48,710 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2025-02-08 13:28:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2025-02-08 13:28:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 13:28:48,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:48,711 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 13:28:48,712 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1525325169, now seen corresponding path program 1 times [2025-02-08 13:28:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582754537] [2025-02-08 13:28:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:48,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:28:48,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:28:48,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:48,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:49,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582754537] [2025-02-08 13:28:49,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582754537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:49,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646087910] [2025-02-08 13:28:49,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:49,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:49,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:49,127 INFO L229 MonitoredProcess]: Starting monitored process 13 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:49,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 13:28:49,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 13:28:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 13:28:49,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:49,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:49,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 2450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 13:28:49,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-02-08 13:28:49,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:28:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646087910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:28:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 13:28:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052639875] [2025-02-08 13:28:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:49,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:28:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:49,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:28:49,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:49,940 INFO L87 Difference]: Start difference. First operand 298 states and 363 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:50,041 INFO L93 Difference]: Finished difference Result 550 states and 696 transitions. [2025-02-08 13:28:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:28:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-02-08 13:28:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:50,043 INFO L225 Difference]: With dead ends: 550 [2025-02-08 13:28:50,043 INFO L226 Difference]: Without dead ends: 404 [2025-02-08 13:28:50,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:28:50,044 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 263 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:50,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 724 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:28:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-08 13:28:50,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 296. [2025-02-08 13:28:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 271 states have (on average 1.2583025830258303) internal successors, (341), 281 states have internal predecessors, (341), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2025-02-08 13:28:50,060 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 104 [2025-02-08 13:28:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:50,060 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2025-02-08 13:28:50,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 13:28:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2025-02-08 13:28:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 13:28:50,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:50,062 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:50,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 13:28:50,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:50,263 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:50,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:50,263 INFO L85 PathProgramCache]: Analyzing trace with hash 209193005, now seen corresponding path program 1 times [2025-02-08 13:28:50,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:50,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929583665] [2025-02-08 13:28:50,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:50,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:50,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 13:28:50,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 13:28:50,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:50,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-02-08 13:28:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929583665] [2025-02-08 13:28:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929583665] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:28:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069233063] [2025-02-08 13:28:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:50,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:50,549 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:50,576 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2025-02-08 13:28:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-02-08 13:28:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:50,577 INFO L225 Difference]: With dead ends: 296 [2025-02-08 13:28:50,577 INFO L226 Difference]: Without dead ends: 295 [2025-02-08 13:28:50,578 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:50,578 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:50,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-08 13:28:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-08 13:28:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 271 states have (on average 1.2546125461254614) internal successors, (340), 280 states have internal predecessors, (340), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2025-02-08 13:28:50,589 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 107 [2025-02-08 13:28:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:50,589 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2025-02-08 13:28:50,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2025-02-08 13:28:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:28:50,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:50,590 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 13:28:50,590 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2104950366, now seen corresponding path program 1 times [2025-02-08 13:28:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:50,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757041304] [2025-02-08 13:28:50,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:50,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:28:50,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:28:50,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:50,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-02-08 13:28:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757041304] [2025-02-08 13:28:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757041304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:28:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:28:50,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:28:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078442517] [2025-02-08 13:28:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:28:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:28:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:28:50,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:28:50,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:50,986 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:28:51,013 INFO L93 Difference]: Finished difference Result 467 states and 575 transitions. [2025-02-08 13:28:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:28:51,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-02-08 13:28:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:28:51,015 INFO L225 Difference]: With dead ends: 467 [2025-02-08 13:28:51,015 INFO L226 Difference]: Without dead ends: 296 [2025-02-08 13:28:51,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:28:51,018 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:28:51,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:28:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-08 13:28:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-08 13:28:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 272 states have (on average 1.2536764705882353) internal successors, (341), 281 states have internal predecessors, (341), 11 states have call successors, (11), 7 states have call predecessors, (11), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 13:28:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2025-02-08 13:28:51,035 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 108 [2025-02-08 13:28:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:28:51,035 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2025-02-08 13:28:51,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:28:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2025-02-08 13:28:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-08 13:28:51,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:28:51,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:28:51,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 13:28:51,036 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-02-08 13:28:51,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:28:51,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1696126141, now seen corresponding path program 1 times [2025-02-08 13:28:51,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:28:51,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844433917] [2025-02-08 13:28:51,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:51,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:28:51,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:28:51,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:28:51,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:51,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-02-08 13:28:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:28:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844433917] [2025-02-08 13:28:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844433917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:28:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326781975] [2025-02-08 13:28:55,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:28:55,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:28:55,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:28:55,752 INFO L229 MonitoredProcess]: Starting monitored process 14 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:55,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 13:28:56,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 13:28:56,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 13:28:56,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:28:56,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:28:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-02-08 13:28:56,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:28:56,604 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 13:28:56,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 13:28:56,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:56,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-02-08 13:28:56,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:56,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:57,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:57,168 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-08 13:28:57,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-08 13:28:57,292 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-02-08 13:28:57,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-02-08 13:28:57,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:57,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2025-02-08 13:28:57,413 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2025-02-08 13:28:57,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-02-08 13:28:57,448 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-08 13:28:57,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-02-08 13:28:57,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-02-08 13:28:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-02-08 13:28:57,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 13:28:57,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-02-08 13:28:57,508 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,550 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,596 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,636 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,682 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,727 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,772 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,814 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,856 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-02-08 13:28:57,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-02-08 13:28:57,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-02-08 13:28:57,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-02-08 13:28:57,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 13:28:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-08 13:28:58,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:28:58,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8367 (Array Int Int)) (v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8365 (Array Int Int)) (v_ArrVal_8366 (Array Int Int)) (v_ArrVal_8369 (Array Int Int)) (v_ArrVal_8370 (Array Int Int)) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8363 (Array Int Int)) (v_ArrVal_8364 (Array Int Int))) (not (= (select (select (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8364))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8365))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8367))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8363) .cse1 v_ArrVal_8366) .cse2 v_ArrVal_8368) .cse3 v_ArrVal_8369) (select (select (store .cse4 .cse3 v_ArrVal_8370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_8371))))))))) 18) 0) 33))) is different from false [2025-02-08 13:28:59,104 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8370 (Array Int Int)) (v_ArrVal_8360 (Array Int Int)) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8363 (Array Int Int)) (v_ArrVal_8364 (Array Int Int)) (v_ArrVal_8361 (Array Int Int)) (v_ArrVal_8362 (Array Int Int)) (v_ArrVal_8367 (Array Int Int)) (v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8365 (Array Int Int)) (v_ArrVal_8366 (Array Int Int)) (v_ArrVal_8369 (Array Int Int)) (v_ArrVal_8359 (Array Int Int))) (not (= (select (select (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8360))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_8361))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_8364))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_8365))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_8367))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8359) .cse1 v_ArrVal_8362) .cse2 v_ArrVal_8363) .cse3 v_ArrVal_8366) .cse4 v_ArrVal_8368) .cse5 v_ArrVal_8369) (select (select (store .cse6 .cse5 v_ArrVal_8370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_8371))))))))))))) 18) 0) 33))) is different from false [2025-02-08 13:28:59,167 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8370 (Array Int Int)) (v_ArrVal_8360 (Array Int Int)) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8363 (Array Int Int)) (v_ArrVal_8364 (Array Int Int)) (v_ArrVal_8361 (Array Int Int)) (v_ArrVal_8362 (Array Int Int)) (v_ArrVal_8367 (Array Int Int)) (v_ArrVal_8357 (Array Int Int)) (v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8365 (Array Int Int)) (v_ArrVal_8366 (Array Int Int)) (v_ArrVal_8358 (Array Int Int)) (v_ArrVal_8369 (Array Int Int)) (v_ArrVal_8359 (Array Int Int))) (not (= (select (select (let ((.cse8 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8357))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_8360))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_8361))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_8364))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_8365))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_8367))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8358) .cse1 v_ArrVal_8359) .cse2 v_ArrVal_8362) .cse3 v_ArrVal_8363) .cse4 v_ArrVal_8366) .cse5 v_ArrVal_8368) .cse6 v_ArrVal_8369) (select (select (store .cse7 .cse6 v_ArrVal_8370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_8371))))))))))))))) 18) 0) 33))) is different from false [2025-02-08 13:28:59,496 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8370 (Array Int Int)) (v_ArrVal_8360 (Array Int Int)) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8363 (Array Int Int)) (v_ArrVal_8364 (Array Int Int)) (v_ArrVal_8361 (Array Int Int)) (v_ArrVal_8362 (Array Int Int)) (v_ArrVal_8356 (Array Int Int)) (v_ArrVal_8367 (Array Int Int)) (v_ArrVal_8357 (Array Int Int)) (v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8365 (Array Int Int)) (v_ArrVal_8355 (Array Int Int)) (v_ArrVal_8366 (Array Int Int)) (v_ArrVal_8358 (Array Int Int)) (v_ArrVal_8369 (Array Int Int)) (v_ArrVal_8359 (Array Int Int))) (not (= 33 (select (select (let ((.cse9 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8355))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_8357))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_8360))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_8361))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_8364))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_8365))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_8367))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8356) .cse1 v_ArrVal_8358) .cse2 v_ArrVal_8359) .cse3 v_ArrVal_8362) .cse4 v_ArrVal_8363) .cse5 v_ArrVal_8366) .cse6 v_ArrVal_8368) .cse7 v_ArrVal_8369) (select (select (store .cse8 .cse7 v_ArrVal_8370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_8371))))))))))))))))) 18) 0)))) is different from false [2025-02-08 13:29:02,734 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8370 (Array Int Int)) (v_ArrVal_8360 (Array Int Int)) (v_ArrVal_8371 (Array Int Int)) (v_ArrVal_8363 (Array Int Int)) (v_ArrVal_8353 (Array Int Int)) (v_ArrVal_8364 (Array Int Int)) (v_ArrVal_8361 (Array Int Int)) (v_ArrVal_8362 (Array Int Int)) (v_ArrVal_8356 (Array Int Int)) (v_ArrVal_8367 (Array Int Int)) (v_ArrVal_8357 (Array Int Int)) (v_ArrVal_8368 (Array Int Int)) (v_ArrVal_8354 (Array Int Int)) (v_ArrVal_8365 (Array Int Int)) (v_ArrVal_8355 (Array Int Int)) (v_ArrVal_8366 (Array Int Int)) (v_ArrVal_8358 (Array Int Int)) (v_ArrVal_8369 (Array Int Int)) (v_ArrVal_8359 (Array Int Int))) (not (= 33 (select (select (let ((.cse10 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8354))) (let ((.cse1 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse16 (store .cse17 .cse1 v_ArrVal_8355))) (let ((.cse2 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse15 (store .cse16 .cse2 v_ArrVal_8357))) (let ((.cse3 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse14 (store .cse15 .cse3 v_ArrVal_8360))) (let ((.cse4 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse13 (store .cse14 .cse4 v_ArrVal_8361))) (let ((.cse5 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse5 v_ArrVal_8364))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_8365))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse9 (store .cse11 .cse7 v_ArrVal_8367))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (store (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8353) .cse1 v_ArrVal_8356) .cse2 v_ArrVal_8358) .cse3 v_ArrVal_8359) .cse4 v_ArrVal_8362) .cse5 v_ArrVal_8363) .cse6 v_ArrVal_8366) .cse7 v_ArrVal_8368) .cse8 v_ArrVal_8369) (select (select (store .cse9 .cse8 v_ArrVal_8370) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) v_ArrVal_8371))))))))))))))))))) 18) 0)))) is different from false [2025-02-08 13:29:02,784 INFO L349 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2025-02-08 13:29:02,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102352 treesize of output 28731