./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-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/mkfifo-incomplete-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 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:26:32,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:26:32,398 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:26:32,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:26:32,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:26:32,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:26:32,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:26:32,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:26:32,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:26:32,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:26:32,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:26:32,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:26:32,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:26:32,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:26:32,427 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:26:32,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:26:32,428 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:26:32,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:26:32,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:26:32,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:26:32,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:26:32,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:32,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:26:32,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:26:32,430 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 -> 87580337320826adb4ecd48067cecb4358be7d27e3644fa74cf18e815c89b60b [2025-02-08 13:26:32,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:26:32,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:26:32,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:26:32,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:26:32,679 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:26:32,680 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-02-08 13:26:33,855 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ce1187a2/72eed6ed52b94b92acfc6690800617ee/FLAG4eadf08ba [2025-02-08 13:26:34,256 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:26:34,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/mkfifo-incomplete-2.i [2025-02-08 13:26:34,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ce1187a2/72eed6ed52b94b92acfc6690800617ee/FLAG4eadf08ba [2025-02-08 13:26:34,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ce1187a2/72eed6ed52b94b92acfc6690800617ee [2025-02-08 13:26:34,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:26:34,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:26:34,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:34,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:26:34,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:26:34,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:34" (1/1) ... [2025-02-08 13:26:34,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5efc62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:34, skipping insertion in model container [2025-02-08 13:26:34,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:26:34" (1/1) ... [2025-02-08 13:26:34,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:26:34,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:34,873 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:26:34,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:26:35,033 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-02-08 13:26:35,039 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:26:35,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35 WrapperNode [2025-02-08 13:26:35,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:26:35,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:35,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:26:35,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:26:35,045 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:26:35" (1/1) ... [2025-02-08 13:26:35,068 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:26:35" (1/1) ... [2025-02-08 13:26:35,110 INFO L138 Inliner]: procedures = 574, calls = 489, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 790 [2025-02-08 13:26:35,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:26:35,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:26:35,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:26:35,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:26:35,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,124 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,132 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-08 13:26:35,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:26:35,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:26:35,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:26:35,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:26:35,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (1/1) ... [2025-02-08 13:26:35,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:26:35,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:35,263 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:26:35,265 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:26:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:26:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-02-08 13:26:35,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:26:35,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:26:35,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-02-08 13:26:35,283 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 13:26:35,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 13:26:35,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 13:26:35,523 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:26:35,524 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:26:35,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: assume !(0 == ~logmode~0 % 2);assume { :begin_inline_fflush_all } true;havoc fflush_all_#res#1;havoc fflush_all_#t~nondet101#1, fflush_all_~return_value_fflush$1~0#1;havoc fflush_all_~return_value_fflush$1~0#1; [2025-02-08 13:26:35,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: assume !!(0 == ~logmode~0 % 2); [2025-02-08 13:26:35,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume true; [2025-02-08 13:26:35,997 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382: assume !true;bb_verror_msg_#t~ret74#1 := vasprintf_#res#1;havoc vasprintf_#in~__ptr#1.base, vasprintf_#in~__ptr#1.offset, vasprintf_#in~__f#1.base, vasprintf_#in~__f#1.offset, vasprintf_#in~__arg#1.base, vasprintf_#in~__arg#1.offset;assume { :end_inline_vasprintf } true;assume -2147483648 <= bb_verror_msg_#t~ret74#1 && bb_verror_msg_#t~ret74#1 <= 2147483647;bb_verror_msg_~used~0#1 := bb_verror_msg_#t~ret74#1;havoc bb_verror_msg_#t~ret74#1; [2025-02-08 13:26:35,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382-1: assume false; [2025-02-08 13:26:35,998 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L382-1: assume !false; [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034: assume __main_~return_value_mkfifo$1~0#1 < 0;call __main_#t~mem108#1.base, __main_#t~mem108#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8);assume { :begin_inline_bb_simple_perror_msg } true;bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset := __main_#t~mem108#1.base, __main_#t~mem108#1.offset;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset := bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;call bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset, bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, 8);assume { :begin_inline_bb_perror_msg } true;bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset := 4, 0, bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset;havoc bb_perror_msg_#t~mem70#1, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset, bb_perror_msg_#t~nondet72#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset := bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset;havoc bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset;bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset := bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;havoc bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;call bb_perror_msg_#t~mem70#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4); [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2034: assume !(__main_~return_value_mkfifo$1~0#1 < 0); [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: assume !(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0);bb_verror_msg_~return_value_strlen$2~0#1 := bb_verror_msg_#t~nondet76#1;havoc bb_verror_msg_#t~nondet76#1;bb_verror_msg_~tmp_if_expr$3~0#1 := bb_verror_msg_~return_value_strlen$2~0#1; [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1935: assume !!(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0);bb_verror_msg_~tmp_if_expr$3~0#1 := 0; [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1927: assume { :begin_inline_vasprintf } true;vasprintf_#in~__ptr#1.base, vasprintf_#in~__ptr#1.offset, vasprintf_#in~__f#1.base, vasprintf_#in~__f#1.offset, vasprintf_#in~__arg#1.base, vasprintf_#in~__arg#1.offset := bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset;havoc vasprintf_#res#1; [2025-02-08 13:26:36,022 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: assume safe_write_~n~0#1 < 0;call safe_write_#t~mem111#1 := read~int(~bb_errno~0.base, ~bb_errno~0.offset, 4);safe_write_~tmp_if_expr$1~0#1 := (if 0 == (if 0 != (if 4 == safe_write_#t~mem111#1 then 1 else 0) then 1 else 0) then 0 else 1); [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: assume !(safe_write_~n~0#1 < 0);safe_write_~tmp_if_expr$1~0#1 := 0; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: assume bb_verror_msg_~msg1~0#1.base == 0 && bb_verror_msg_~msg1~0#1.offset == 0;bb_verror_msg_~tmp_post$6~0#1 := bb_verror_msg_~used~0#1; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: assume !(bb_verror_msg_~msg1~0#1.base == 0 && bb_verror_msg_~msg1~0#1.offset == 0);call write~$Pointer$(bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_#Ultimate.C_memmove } true;#Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset, #Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset, #Ultimate.C_memmove_size#1 := bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset + bb_verror_msg_~applet_len~0#1, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_~used~0#1;havoc #Ultimate.C_memmove_#res#1.base, #Ultimate.C_memmove_#res#1.offset;havoc #Ultimate.C_memmove_#t~loopctr166#1, #Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_#t~loopctr170#1, #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset;#Ultimate.C_memmove_#t~loopctr166#1 := 0; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969: assume !(0 == bb_verror_msg_#t~mem88#1);havoc bb_verror_msg_#t~mem88#1;bb_verror_msg_~tmp_post$7~0#1 := bb_verror_msg_~used~0#1; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969: assume !!(0 == bb_verror_msg_#t~mem88#1);havoc bb_verror_msg_#t~mem88#1; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: assume bb_verror_msg_~used~0#1 < 0;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset; [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1928: assume !(bb_verror_msg_~used~0#1 < 0); [2025-02-08 13:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: bb_verror_msg_#t~ret95#1 := fflush_all_#res#1;havoc fflush_all_#t~nondet101#1, fflush_all_~return_value_fflush$1~0#1;assume { :end_inline_fflush_all } true;assume -2147483648 <= bb_verror_msg_#t~ret95#1 && bb_verror_msg_#t~ret95#1 <= 2147483647;havoc bb_verror_msg_#t~ret95#1;call bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#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, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_~used~0#1;havoc full_write_#res#1;havoc full_write_#t~ret102#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:26:36,023 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978: havoc bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset;havoc bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset; [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-1: SUMMARY for call bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset + bb_verror_msg_~used~0#1, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset); srcloc: null [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978-2: call bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: 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~ret110#1, safe_write_#t~mem111#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~0#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~0#1; [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2003: assume !!(0 == full_write_~len#1 % 18446744073709551616);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: assume { :begin_inline_bb_verror_msg } true;bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset, bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset, bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset := bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset;havoc bb_verror_msg_#t~ret74#1, bb_verror_msg_#t~nondet75#1, bb_verror_msg_#t~nondet76#1, bb_verror_msg_#t~nondet77#1, bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset, bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset, bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset, bb_verror_msg_#t~mem88#1, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset, bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset, bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset, bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset, bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset, bb_verror_msg_#t~ret95#1, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_#t~ret97#1, bb_verror_msg_#t~bitwise98#1, bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset, bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~applet_len~0#1, bb_verror_msg_~strerr_len~0#1, bb_verror_msg_~msgeol_len~0#1, bb_verror_msg_~used~0#1, bb_verror_msg_~return_value_strlen$1~0#1, bb_verror_msg_~tmp_if_expr$3~0#1, bb_verror_msg_~return_value_strlen$2~0#1, bb_verror_msg_~return_value_strlen$4~0#1, bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset, bb_verror_msg_~tmp_post$6~0#1, bb_verror_msg_~tmp_post$7~0#1, bb_verror_msg_~tmp_post$8~0#1;bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset := bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset;bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset := bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset;bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset := bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset;call bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset := #Ultimate.allocOnStack(8);havoc bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset;havoc bb_verror_msg_~applet_len~0#1;havoc bb_verror_msg_~strerr_len~0#1;havoc bb_verror_msg_~msgeol_len~0#1;havoc bb_verror_msg_~used~0#1; [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127-1: SUMMARY for call assume_abort_if_not((if -1 == write_~ret~1#1 || (write_~ret~1#1 >= 0 && write_~ret~1#1 % 18446744073709551616 <= write_~nbyte#1 % 18446744073709551616) then 1 else 0)); srcloc: null [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2127: write_#res#1 := write_~ret~1#1; [2025-02-08 13:26:36,024 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1987: bb_verror_msg_#t~ret97#1 := full_write_#res#1;havoc full_write_#t~ret102#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 <= bb_verror_msg_#t~ret97#1 && bb_verror_msg_#t~ret97#1 <= 9223372036854775807;havoc bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset;havoc bb_verror_msg_#t~ret97#1; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: 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:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012: assume !(full_write_~total~0#1 + full_write_~cc~0#1 <= 9223372036854775807); [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012-1: assume full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2012-1: assume !(full_write_~total~0#1 + full_write_~cc~0#1 >= -9223372036854775808); [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 <= 2147483647); [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979-1: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 >= -2147483648; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1979-1: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 >= -2147483648); [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: assume true; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: assume !true;fflush_all_~return_value_fflush$1~0#1 := fflush_all_#t~nondet101#1;havoc fflush_all_#t~nondet101#1;fflush_all_#res#1 := fflush_all_~return_value_fflush$1~0#1; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996-1: assume false; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996-1: assume !false; [2025-02-08 13:26:36,025 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1;call bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1 <= 2147483647); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963-1: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1 >= -2147483648; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963-1: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~applet_len~0#1 >= -2147483648); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc bb_verror_msg_~return_value_strlen$1~0#1;bb_verror_msg_~return_value_strlen$1~0#1 := bb_verror_msg_#t~nondet75#1;havoc bb_verror_msg_#t~nondet75#1;bb_verror_msg_~applet_len~0#1 := (if (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 <= 2147483647 then (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 else (2 + bb_verror_msg_~return_value_strlen$1~0#1) % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~tmp_if_expr$3~0#1;havoc bb_verror_msg_~return_value_strlen$2~0#1; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: assume !(0 == bb_perror_msg_#t~mem70#1);havoc bb_perror_msg_#t~mem70#1; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: assume !!(0 == bb_perror_msg_#t~mem70#1);havoc bb_perror_msg_#t~mem70#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := 0, 0; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955: assume 1 + bb_verror_msg_~used~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1;call bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call write~int(10, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset + bb_verror_msg_~tmp_post$6~0#1, 1);havoc bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset;bb_verror_msg_~applet_len~0#1 := 0; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955: assume !(1 + bb_verror_msg_~used~0#1 <= 2147483647); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955-1: assume 1 + bb_verror_msg_~used~0#1 >= -2147483648; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955-1: assume !(1 + bb_verror_msg_~used~0#1 >= -2147483648); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947: assume 3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1) <= 2147483647;assume { :begin_inline_#Ultimate.C_realloc } true;#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1 := bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, 3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1);havoc #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset; [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947: assume !(3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1) <= 2147483647); [2025-02-08 13:26:36,026 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: assume 3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1) >= -2147483648; [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-1: assume !(3 + (bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1) >= -2147483648); [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-2: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1 <= 2147483647; [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-2: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1 <= 2147483647); [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-3: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1 >= -2147483648; [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-3: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 + bb_verror_msg_~msgeol_len~0#1 >= -2147483648); [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-4: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 <= 2147483647; [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-4: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 <= 2147483647); [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-5: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 >= -2147483648; [2025-02-08 13:26:36,027 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-5: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 + bb_verror_msg_~strerr_len~0#1 >= -2147483648); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2005: full_write_#t~ret102#1 := safe_write_#res#1;havoc safe_write_#t~ret110#1, safe_write_#t~mem111#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~0#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~ret102#1 && full_write_#t~ret102#1 <= 9223372036854775807;full_write_~cc~0#1 := full_write_#t~ret102#1;havoc full_write_#t~ret102#1; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-6: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 <= 2147483647; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-6: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 <= 2147483647); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972: assume 1 + bb_verror_msg_~used~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1;call bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call write~int(58, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset + bb_verror_msg_~tmp_post$7~0#1, 1);havoc bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset;bb_verror_msg_~tmp_post$8~0#1 := bb_verror_msg_~used~0#1; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972: assume !(1 + bb_verror_msg_~used~0#1 <= 2147483647); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-7: assume bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 >= -2147483648; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1947-7: assume !(bb_verror_msg_~applet_len~0#1 + bb_verror_msg_~used~0#1 >= -2147483648); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972-1: assume 1 + bb_verror_msg_~used~0#1 >= -2147483648; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972-1: assume !(1 + bb_verror_msg_~used~0#1 >= -2147483648); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030-1: assume !(__main_#t~mem109#1.base == 0 && __main_#t~mem109#1.offset == 0);havoc __main_#t~mem109#1.base, __main_#t~mem109#1.offset; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030-1: assume !!(__main_#t~mem109#1.base == 0 && __main_#t~mem109#1.offset == 0);havoc __main_#t~mem109#1.base, __main_#t~mem109#1.offset; [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964: havoc bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset;havoc bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset;call bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1964-1: SUMMARY for call bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, ~applet_name~0.base, ~applet_name~0.offset); srcloc: null [2025-02-08 13:26:36,028 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: assume !(0 == bb_verror_msg_#t~bitwise98#1);havoc bb_verror_msg_#t~bitwise98#1;call bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);assume { :begin_inline_syslog } true;syslog_#in~priority#1, syslog_#in~format#1.base, syslog_#in~format#1.offset := 3, 6, 0;havoc syslog_~priority#1, syslog_~format#1.base, syslog_~format#1.offset;syslog_~priority#1 := syslog_#in~priority#1;syslog_~format#1.base, syslog_~format#1.offset := syslog_#in~format#1.base, syslog_#in~format#1.offset;havoc syslog_~priority#1, syslog_~format#1.base, syslog_~format#1.offset;havoc syslog_#in~priority#1, syslog_#in~format#1.base, syslog_#in~format#1.offset;assume { :end_inline_syslog } true; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: assume !!(0 == bb_verror_msg_#t~bitwise98#1);havoc bb_verror_msg_#t~bitwise98#1; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-1: [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-2: havoc bb_verror_msg_#t~bitwise98#1;assume (((bb_verror_msg_#t~bitwise98#1 <= 2 && (~logmode~0 < 0 || bb_verror_msg_#t~bitwise98#1 <= ~logmode~0)) && bb_verror_msg_#t~bitwise98#1 >= 0) && (~logmode~0 >= 0 || bb_verror_msg_#t~bitwise98#1 > 2 + ~logmode~0)) && bb_verror_msg_#t~bitwise98#1 >= -2147483648; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: assume 0 == ~logmode~0;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1923: assume !(0 == ~logmode~0); [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-3: assume 2 == ~logmode~0;bb_verror_msg_#t~bitwise98#1 := 2; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-3: assume !(2 == ~logmode~0); [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-4: assume 0 == ~logmode~0;bb_verror_msg_#t~bitwise98#1 := 0; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989-4: assume !(0 == ~logmode~0); [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume #Ultimate.C_memmove_#t~loopctr170#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616;call #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset := read~unchecked~$Pointer$(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr170#1, 8);call write~unchecked~$Pointer$(#Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr170#1, 8);#Ultimate.C_memmove_#t~loopctr170#1 := 8 + #Ultimate.C_memmove_#t~loopctr170#1; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: assume !(#Ultimate.C_memmove_#t~loopctr170#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616);assume #Ultimate.C_memmove_#res#1.base == #Ultimate.C_memmove_dest#1.base && #Ultimate.C_memmove_#res#1.offset == #Ultimate.C_memmove_dest#1.offset;bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset := #Ultimate.C_memmove_#res#1.base, #Ultimate.C_memmove_#res#1.offset;havoc #Ultimate.C_memmove_#t~loopctr166#1, #Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_#t~loopctr170#1, #Ultimate.C_memmove_#t~mem171#1.base, #Ultimate.C_memmove_#t~mem171#1.offset;havoc #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset, #Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset, #Ultimate.C_memmove_size#1;assume { :end_inline_#Ultimate.C_memmove } true;havoc bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset;havoc bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset;havoc bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset; [2025-02-08 13:26:36,029 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume #Ultimate.C_memmove_#t~loopctr166#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616;call #Ultimate.C_memmove_#t~mem167#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 4);call write~unchecked~int(#Ultimate.C_memmove_#t~mem167#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 4);call #Ultimate.C_memmove_#t~mem168#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 1);call write~unchecked~int(#Ultimate.C_memmove_#t~mem168#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 1);call #Ultimate.C_memmove_#t~mem169#1 := read~unchecked~int(#Ultimate.C_memmove_src#1.base, #Ultimate.C_memmove_src#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 2);call write~unchecked~int(#Ultimate.C_memmove_#t~mem169#1, #Ultimate.C_memmove_dest#1.base, #Ultimate.C_memmove_dest#1.offset + #Ultimate.C_memmove_#t~loopctr166#1, 2);#Ultimate.C_memmove_#t~loopctr166#1 := 1 + #Ultimate.C_memmove_#t~loopctr166#1; [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-1: assume !(#Ultimate.C_memmove_#t~loopctr166#1 % 18446744073709551616 < #Ultimate.C_memmove_size#1 % 18446744073709551616);#Ultimate.C_memmove_#t~loopctr170#1 := 0; [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: havoc bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset;havoc bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset; [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-1: SUMMARY for call bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset := #Ultimate.C_strcpy(bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset + bb_verror_msg_~used~0#1, ~msg_eol~0.base, ~msg_eol~0.offset); srcloc: null [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981-2: call bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume #Ultimate.C_realloc_ptr#1.base == 0 && #Ultimate.C_realloc_ptr#1.offset == 0;call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1 % 18446744073709551616); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1-4: assume !(#Ultimate.C_realloc_ptr#1.base == 0 && #Ultimate.C_realloc_ptr#1.offset == 0);call ULTIMATE.dealloc(#Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset);call #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset := #Ultimate.allocOnHeap(#Ultimate.C_realloc_size#1 % 18446744073709551616);#memory_int := ~storeAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~int(#memory_int, #Ultimate.C_realloc_ptr#1.base));#memory_$Pointer$.base, #memory_$Pointer$.offset := ~storeAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base), ~selectAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base)), ~storeAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_#res#1.base, ~selectAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base), ~selectAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, #Ultimate.C_realloc_ptr#1.base));bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset := #Ultimate.C_realloc_#res#1.base, #Ultimate.C_realloc_#res#1.offset;havoc #Ultimate.C_realloc_ptr#1.base, #Ultimate.C_realloc_ptr#1.offset, #Ultimate.C_realloc_size#1;assume { :end_inline_#Ultimate.C_realloc } true;bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset := bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset;havoc bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset;havoc bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset;bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset := bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset;havoc bb_verror_msg_~tmp_post$6~0#1;havoc bb_verror_msg_~tmp_post$7~0#1;havoc bb_verror_msg_~tmp_post$8~0#1; [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2039: __main_~argv#1.base, __main_~argv#1.offset := __main_~argv#1.base, 8 + __main_~argv#1.offset;havoc __main_~return_value_mkfifo$1~0#1;call __main_#t~mem109#1.base, __main_#t~mem109#1.offset := read~$Pointer$(__main_~argv#1.base, __main_~argv#1.offset, 8); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: assume full_write_~cc~0#1 < 0; [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: assume !(full_write_~cc~0#1 < 0); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: assume bb_verror_msg_~applet_len~0#1 - 2 <= 2147483647;call write~int(58, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset + (bb_verror_msg_~applet_len~0#1 - 2), 1);havoc bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset;call bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965: assume !(bb_verror_msg_~applet_len~0#1 - 2 <= 2147483647); [2025-02-08 13:26:36,030 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: assume bb_verror_msg_~applet_len~0#1 - 2 >= -2147483648; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1965-1: assume !(bb_verror_msg_~applet_len~0#1 - 2 >= -2147483648); [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899: bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset := bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset;havoc bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset;havoc bb_perror_msg_#t~nondet72#1;bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset := bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: assume true;bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset := 0, 0; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1899-1: assume true;havoc bb_perror_msg_#t~nondet72#1;assume bb_perror_msg_#t~nondet72#1 % 18446744073709551616 > 0;call bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset := #Ultimate.allocOnHeap(bb_perror_msg_#t~nondet72#1 % 18446744073709551616);call write~int(0, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet72#1 % 18446744073709551616 - 1, 1); [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: 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~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;write_~fildes#1 := write_#in~fildes#1;write_~buf#1.base, write_~buf#1.offset := write_#in~buf#1.base, write_#in~buf#1.offset;write_~nbyte#1 := write_#in~nbyte#1;havoc write_#t~nondet147#1;assume -9223372036854775808 <= write_#t~nondet147#1 && write_#t~nondet147#1 <= 9223372036854775807;write_~ret~1#1 := write_#t~nondet147#1;havoc write_#t~nondet147#1; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: assume !true; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048-1: assume 0 != safe_write_~tmp_if_expr$1~0#1 % 256; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048-1: assume !(0 != safe_write_~tmp_if_expr$1~0#1 % 256); [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1 <= 2147483647); [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982-1: assume bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1 >= -2147483648; [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982-1: assume !(bb_verror_msg_~used~0#1 + bb_verror_msg_~msgeol_len~0#1 >= -2147483648); [2025-02-08 13:26:36,031 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: assume bb_verror_msg_~applet_len~0#1 - 1 <= 2147483647;call write~int(32, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset + (bb_verror_msg_~applet_len~0#1 - 1), 1);havoc bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: assume !(bb_verror_msg_~applet_len~0#1 - 1 <= 2147483647); [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-1: assume bb_verror_msg_~applet_len~0#1 - 1 >= -2147483648; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966-1: assume !(bb_verror_msg_~applet_len~0#1 - 1 >= -2147483648); [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057-1: safe_write_#res#1 := safe_write_~n~0#1; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1991: call bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call ULTIMATE.dealloc(bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset);havoc bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset;call ULTIMATE.dealloc(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset);havoc bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset;havoc bb_verror_msg_#t~ret74#1, bb_verror_msg_#t~nondet75#1, bb_verror_msg_#t~nondet76#1, bb_verror_msg_#t~nondet77#1, bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset, bb_verror_msg_#t~realloc~res79#1.base, bb_verror_msg_#t~realloc~res79#1.offset, bb_verror_msg_#t~mem80#1.base, bb_verror_msg_#t~mem80#1.offset, bb_verror_msg_#t~mem81#1.base, bb_verror_msg_#t~mem81#1.offset, bb_verror_msg_#t~mem82#1.base, bb_verror_msg_#t~mem82#1.offset, bb_verror_msg_#t~memmove~res83#1.base, bb_verror_msg_#t~memmove~res83#1.offset, bb_verror_msg_#t~mem84#1.base, bb_verror_msg_#t~mem84#1.offset, bb_verror_msg_#t~strcpy~res85#1.base, bb_verror_msg_#t~strcpy~res85#1.offset, bb_verror_msg_#t~mem86#1.base, bb_verror_msg_#t~mem86#1.offset, bb_verror_msg_#t~mem87#1.base, bb_verror_msg_#t~mem87#1.offset, bb_verror_msg_#t~mem88#1, bb_verror_msg_#t~mem89#1.base, bb_verror_msg_#t~mem89#1.offset, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset, bb_verror_msg_#t~mem91#1.base, bb_verror_msg_#t~mem91#1.offset, bb_verror_msg_#t~strcpy~res92#1.base, bb_verror_msg_#t~strcpy~res92#1.offset, bb_verror_msg_#t~mem93#1.base, bb_verror_msg_#t~mem93#1.offset, bb_verror_msg_#t~strcpy~res94#1.base, bb_verror_msg_#t~strcpy~res94#1.offset, bb_verror_msg_#t~ret95#1, bb_verror_msg_#t~mem96#1.base, bb_verror_msg_#t~mem96#1.offset, bb_verror_msg_#t~ret97#1, bb_verror_msg_#t~bitwise98#1, bb_verror_msg_#t~mem99#1.base, bb_verror_msg_#t~mem99#1.offset, bb_verror_msg_#t~mem100#1.base, bb_verror_msg_#t~mem100#1.offset, bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, bb_verror_msg_~p#1.base, bb_verror_msg_~p#1.offset, bb_verror_msg_~strerr#1.base, bb_verror_msg_~strerr#1.offset, bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, bb_verror_msg_~msg1~0#1.base, bb_verror_msg_~msg1~0#1.offset, bb_verror_msg_~applet_len~0#1, bb_verror_msg_~strerr_len~0#1, bb_verror_msg_~msgeol_len~0#1, bb_verror_msg_~used~0#1, bb_verror_msg_~return_value_strlen$1~0#1, bb_verror_msg_~tmp_if_expr$3~0#1, bb_verror_msg_~return_value_strlen$2~0#1, bb_verror_msg_~return_value_strlen$4~0#1, bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset, bb_verror_msg_~tmp_post$6~0#1, bb_verror_msg_~tmp_post$7~0#1, bb_verror_msg_~tmp_post$8~0#1;havoc bb_verror_msg_#in~s#1.base, bb_verror_msg_#in~s#1.offset, bb_verror_msg_#in~p#1.base, bb_verror_msg_#in~p#1.offset, bb_verror_msg_#in~strerr#1.base, bb_verror_msg_#in~strerr#1.offset;assume { :end_inline_bb_verror_msg } true;call ULTIMATE.dealloc(bb_perror_msg_~p~0#1.base, 0);havoc bb_perror_msg_#t~mem70#1, bb_perror_msg_#t~nondet71#1.base, bb_perror_msg_#t~nondet71#1.offset, bb_perror_msg_#t~nondet72#1, bb_perror_msg_~s#1.base, bb_perror_msg_~s#1.offset, bb_perror_msg_~p~0#1.base, bb_perror_msg_~p~0#1.offset, bb_perror_msg_~tmp_if_expr$2~0#1.base, bb_perror_msg_~tmp_if_expr$2~0#1.offset, bb_perror_msg_~return_value_strerror$1~0#1.base, bb_perror_msg_~return_value_strerror$1~0#1.offset;havoc bb_perror_msg_#in~s#1.base, bb_perror_msg_#in~s#1.offset, bb_perror_msg_#varArgs#1.base, bb_perror_msg_#varArgs#1.offset;assume { :end_inline_bb_perror_msg } true;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset;havoc bb_simple_perror_msg_#t~varargs73#1.base, bb_simple_perror_msg_#t~varargs73#1.offset, bb_simple_perror_msg_~s#1.base, bb_simple_perror_msg_~s#1.offset;havoc bb_simple_perror_msg_#in~s#1.base, bb_simple_perror_msg_#in~s#1.offset;assume { :end_inline_bb_simple_perror_msg } true;havoc __main_#t~mem108#1.base, __main_#t~mem108#1.offset;__main_~retval~0#1 := 1; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925: assume bb_verror_msg_~s#1.base == 0 && bb_verror_msg_~s#1.offset == 0;bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset := 5, 0; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1925: assume !(bb_verror_msg_~s#1.base == 0 && bb_verror_msg_~s#1.offset == 0); [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: assume !(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~total~0#1; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2008: assume !!(0 == full_write_~total~0#1);full_write_#res#1 := full_write_~cc~0#1; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975: assume 1 + bb_verror_msg_~used~0#1 <= 2147483647;bb_verror_msg_~used~0#1 := 1 + bb_verror_msg_~used~0#1;call bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8);call write~int(32, bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset + bb_verror_msg_~tmp_post$8~0#1, 1);havoc bb_verror_msg_#t~mem90#1.base, bb_verror_msg_#t~mem90#1.offset; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975: assume !(1 + bb_verror_msg_~used~0#1 <= 2147483647); [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975-1: assume 1 + bb_verror_msg_~used~0#1 >= -2147483648; [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975-1: assume !(1 + bb_verror_msg_~used~0#1 >= -2147483648); [2025-02-08 13:26:36,032 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1942: bb_verror_msg_~strerr_len~0#1 := (if bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 <= 2147483647 then bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 else bb_verror_msg_~tmp_if_expr$3~0#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~return_value_strlen$4~0#1;bb_verror_msg_~return_value_strlen$4~0#1 := bb_verror_msg_#t~nondet77#1;havoc bb_verror_msg_#t~nondet77#1;bb_verror_msg_~msgeol_len~0#1 := (if bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 <= 2147483647 then bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 else bb_verror_msg_~return_value_strlen$4~0#1 % 18446744073709551616 % 4294967296 - 4294967296);havoc bb_verror_msg_~return_value_realloc$5~0#1.base, bb_verror_msg_~return_value_realloc$5~0#1.offset;call bb_verror_msg_#t~mem78#1.base, bb_verror_msg_#t~mem78#1.offset := read~$Pointer$(bb_verror_msg_~#msg~0#1.base, bb_verror_msg_~#msg~0#1.offset, 8); [2025-02-08 13:26:36,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2033: __main_#t~ret107#1 := mkfifo_#res#1;havoc mkfifo_#t~mem112#1, mkfifo_#t~nondet113#1, mkfifo_#t~nondet114#1, mkfifo_#t~mem115#1, mkfifo_~file#1.base, mkfifo_~file#1.offset, mkfifo_~mode#1;havoc mkfifo_#in~file#1.base, mkfifo_#in~file#1.offset, mkfifo_#in~mode#1;assume { :end_inline_mkfifo } true;assume -2147483648 <= __main_#t~ret107#1 && __main_#t~ret107#1 <= 2147483647;__main_~return_value_mkfifo$1~0#1 := __main_#t~ret107#1;havoc __main_#t~mem106#1.base, __main_#t~mem106#1.offset;havoc __main_#t~ret107#1; [2025-02-08 13:26:36,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967: assume !(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0);call bb_verror_msg_#t~mem88#1 := read~int(bb_verror_msg_~s#1.base, bb_verror_msg_~s#1.offset, 1); [2025-02-08 13:26:36,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967: assume !!(bb_verror_msg_~strerr#1.base == 0 && bb_verror_msg_~strerr#1.offset == 0); [2025-02-08 13:26:36,033 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2050: safe_write_#t~ret110#1 := write_#res#1;havoc write_#t~nondet147#1, write_~fildes#1, write_~buf#1.base, write_~buf#1.offset, write_~nbyte#1, write_~ret~1#1;havoc write_#in~fildes#1, write_#in~buf#1.base, write_#in~buf#1.offset, write_#in~nbyte#1;assume { :end_inline_write } true;assume -9223372036854775808 <= safe_write_#t~ret110#1 && safe_write_#t~ret110#1 <= 9223372036854775807;safe_write_~n~0#1 := safe_write_#t~ret110#1;havoc safe_write_#t~ret110#1; [2025-02-08 13:26:36,042 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-08 13:26:36,042 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:26:36,047 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:26:36,048 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 13:26:36,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:36 BoogieIcfgContainer [2025-02-08 13:26:36,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:26:36,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:26:36,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:26:36,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:26:36,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:26:34" (1/3) ... [2025-02-08 13:26:36,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a32ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:36, skipping insertion in model container [2025-02-08 13:26:36,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:26:35" (2/3) ... [2025-02-08 13:26:36,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a32ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:26:36, skipping insertion in model container [2025-02-08 13:26:36,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:36" (3/3) ... [2025-02-08 13:26:36,054 INFO L128 eAbstractionObserver]: Analyzing ICFG mkfifo-incomplete-2.i [2025-02-08 13:26:36,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:26:36,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mkfifo-incomplete-2.i that has 3 procedures, 51 locations, 1 initial locations, 12 loop locations, and 40 error locations. [2025-02-08 13:26:36,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:26:36,109 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;@17382c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:26:36,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-02-08 13:26:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:26:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 13:26:36,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:36,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 13:26:36,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:36,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash 235309, now seen corresponding path program 1 times [2025-02-08 13:26:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052492843] [2025-02-08 13:26:36,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:36,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 13:26:36,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 13:26:36,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:36,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,566 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:26:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052492843] [2025-02-08 13:26:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052492843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 13:26:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945501630] [2025-02-08 13:26:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:36,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:36,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:36,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:36,586 INFO L87 Difference]: Start difference. First operand has 46 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 41 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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:26:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:36,616 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-02-08 13:26:36,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:36,618 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:26:36,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:36,621 INFO L225 Difference]: With dead ends: 83 [2025-02-08 13:26:36,621 INFO L226 Difference]: Without dead ends: 32 [2025-02-08 13:26:36,624 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:26:36,626 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:36,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-08 13:26:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-08 13:26:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.6) internal successors, (32), 29 states have internal predecessors, (32), 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:26:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-02-08 13:26:36,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 3 [2025-02-08 13:26:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:36,651 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-02-08 13:26:36,651 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:26:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-02-08 13:26:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:26:36,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:36,652 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 13:26:36,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:26:36,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1579673251, now seen corresponding path program 1 times [2025-02-08 13:26:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391369443] [2025-02-08 13:26:36,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:36,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:36,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:36,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:36,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:36,868 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:26:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391369443] [2025-02-08 13:26:36,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391369443] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:36,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837578550] [2025-02-08 13:26:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:36,875 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:26:36,883 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:26:36,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:26:37,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:26:37,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:37,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:37,145 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:26:37,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837578550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-02-08 13:26:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042408291] [2025-02-08 13:26:37,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:26:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:26:37,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:37,149 INFO L87 Difference]: Start difference. First operand 32 states and 34 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:26:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:37,188 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-02-08 13:26:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:26:37,188 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:26:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:37,188 INFO L225 Difference]: With dead ends: 32 [2025-02-08 13:26:37,188 INFO L226 Difference]: Without dead ends: 31 [2025-02-08 13:26:37,189 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:26:37,189 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:37,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-08 13:26:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-08 13:26:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.55) internal successors, (31), 28 states have internal predecessors, (31), 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:26:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-02-08 13:26:37,196 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 6 [2025-02-08 13:26:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:37,196 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-02-08 13:26:37,197 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:26:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-02-08 13:26:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 13:26:37,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:37,197 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 13:26:37,209 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:26:37,397 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:26:37,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1725230353, now seen corresponding path program 1 times [2025-02-08 13:26:37,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:37,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099533846] [2025-02-08 13:26:37,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:37,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 13:26:37,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 13:26:37,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,526 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:26:37,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099533846] [2025-02-08 13:26:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099533846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560208623] [2025-02-08 13:26:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:37,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:37,527 INFO L87 Difference]: Start difference. First operand 31 states and 33 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:26:37,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:37,546 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-02-08 13:26:37,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:37,547 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:26:37,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:37,547 INFO L225 Difference]: With dead ends: 31 [2025-02-08 13:26:37,547 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 13:26:37,547 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:26:37,548 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:37,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 13:26:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-08 13:26:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 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:26:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-08 13:26:37,550 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 7 [2025-02-08 13:26:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:37,550 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-08 13:26:37,550 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:26:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-08 13:26:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 13:26:37,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:37,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:37,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:26:37,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 306618059, now seen corresponding path program 1 times [2025-02-08 13:26:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:37,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000993743] [2025-02-08 13:26:37,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:37,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:37,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:37,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,728 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:26:37,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000993743] [2025-02-08 13:26:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000993743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:37,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435858781] [2025-02-08 13:26:37,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:37,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:37,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:37,735 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:26:37,737 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:26:37,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 13:26:37,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 13:26:37,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:37,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:37,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:37,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:37,967 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:26:37,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435858781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107181322] [2025-02-08 13:26:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:37,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:37,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:37,970 INFO L87 Difference]: Start difference. First operand 28 states and 30 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:26:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:38,004 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-02-08 13:26:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:38,005 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:26:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:38,005 INFO L225 Difference]: With dead ends: 28 [2025-02-08 13:26:38,005 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 13:26:38,006 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:26:38,006 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:38,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 13:26:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 13:26:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 23 states have internal predecessors, (26), 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:26:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-02-08 13:26:38,010 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2025-02-08 13:26:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:38,010 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-02-08 13:26:38,010 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:26:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-02-08 13:26:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 13:26:38,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:38,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:38,018 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:26:38,211 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:26:38,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 915225403, now seen corresponding path program 1 times [2025-02-08 13:26:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774485394] [2025-02-08 13:26:38,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:38,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:38,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:38,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:38,334 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:26:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:38,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774485394] [2025-02-08 13:26:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774485394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:38,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113704393] [2025-02-08 13:26:38,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:38,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:38,339 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:26:38,342 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:26:38,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 13:26:38,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 13:26:38,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:38,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:38,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:38,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:38,551 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:26:38,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:38,570 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:26:38,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113704393] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:38,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:38,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-02-08 13:26:38,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352108929] [2025-02-08 13:26:38,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:38,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:38,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:38,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:38,573 INFO L87 Difference]: Start difference. First operand 26 states and 28 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:26:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:38,593 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2025-02-08 13:26:38,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:38,593 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:26:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:38,594 INFO L225 Difference]: With dead ends: 56 [2025-02-08 13:26:38,594 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 13:26:38,594 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:26:38,594 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:38,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 68 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 13:26:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 13:26:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 32 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:26:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-02-08 13:26:38,597 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 12 [2025-02-08 13:26:38,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-02-08 13:26:38,598 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:26:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-02-08 13:26:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 13:26:38,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:38,598 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:38,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:38,798 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:26:38,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1680621301, now seen corresponding path program 2 times [2025-02-08 13:26:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:38,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34636621] [2025-02-08 13:26:38,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:38,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 13:26:38,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-02-08 13:26:38,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:38,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:38,966 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:26:38,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34636621] [2025-02-08 13:26:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34636621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:38,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:38,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:26:38,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504161773] [2025-02-08 13:26:38,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 13:26:38,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:38,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 13:26:38,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:38,967 INFO L87 Difference]: Start difference. First operand 35 states and 37 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:26:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:39,004 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2025-02-08 13:26:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 13:26:39,005 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:26:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:39,005 INFO L225 Difference]: With dead ends: 35 [2025-02-08 13:26:39,005 INFO L226 Difference]: Without dead ends: 33 [2025-02-08 13:26:39,005 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:26:39,006 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:39,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:39,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-08 13:26:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-08 13:26:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 30 states have internal predecessors, (33), 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:26:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2025-02-08 13:26:39,032 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 21 [2025-02-08 13:26:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:39,033 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2025-02-08 13:26:39,033 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:26:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2025-02-08 13:26:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 13:26:39,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:39,033 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:26:39,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:26:39,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:39,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:39,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1131761750, now seen corresponding path program 1 times [2025-02-08 13:26:39,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:39,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622628157] [2025-02-08 13:26:39,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:39,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 13:26:39,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 13:26:39,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:39,232 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:26:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622628157] [2025-02-08 13:26:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622628157] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:39,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:26:39,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344938198] [2025-02-08 13:26:39,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:39,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:39,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:39,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:39,235 INFO L87 Difference]: Start difference. First operand 33 states and 35 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:26:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:39,262 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2025-02-08 13:26:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:39,262 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:26:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:39,262 INFO L225 Difference]: With dead ends: 46 [2025-02-08 13:26:39,264 INFO L226 Difference]: Without dead ends: 36 [2025-02-08 13:26:39,264 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:26:39,265 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:39,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-08 13:26:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-02-08 13:26:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 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:26:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-02-08 13:26:39,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 26 [2025-02-08 13:26:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:39,271 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-02-08 13:26:39,271 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:26:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-02-08 13:26:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:39,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:39,273 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:26:39,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:26:39,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash 825942084, now seen corresponding path program 1 times [2025-02-08 13:26:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332993451] [2025-02-08 13:26:39,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:39,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:39,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:39,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:39,462 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:26:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332993451] [2025-02-08 13:26:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332993451] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585773478] [2025-02-08 13:26:39,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:39,464 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:26:39,466 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:26:39,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:39,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:39,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 13:26:39,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:39,701 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:26:39,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:26:39,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585773478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:39,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:26:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-08 13:26:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2405399] [2025-02-08 13:26:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:39,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:39,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:39,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:39,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 13:26:39,702 INFO L87 Difference]: Start difference. First operand 36 states and 38 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:26:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:39,728 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-02-08 13:26:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:39,729 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:26:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:39,729 INFO L225 Difference]: With dead ends: 36 [2025-02-08 13:26:39,729 INFO L226 Difference]: Without dead ends: 35 [2025-02-08 13:26:39,729 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:26:39,730 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:39,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-08 13:26:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-08 13:26:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 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:26:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2025-02-08 13:26:39,735 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 29 [2025-02-08 13:26:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:39,735 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2025-02-08 13:26:39,735 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:26:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2025-02-08 13:26:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 13:26:39,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:39,737 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:26:39,744 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:26:39,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-08 13:26:39,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:39,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash 825942244, now seen corresponding path program 1 times [2025-02-08 13:26:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194028395] [2025-02-08 13:26:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:39,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:40,153 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:26:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194028395] [2025-02-08 13:26:40,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194028395] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182826673] [2025-02-08 13:26:40,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:40,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:40,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:40,156 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:26:40,158 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:26:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 13:26:40,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 13:26:40,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:40,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:40,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 13:26:40,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:40,453 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:26:40,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:40,538 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:26:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182826673] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:40,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:40,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-02-08 13:26:40,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699021246] [2025-02-08 13:26:40,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:40,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 13:26:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:40,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 13:26:40,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 13:26:40,540 INFO L87 Difference]: Start difference. First operand 35 states and 37 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:26:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:40,697 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-02-08 13:26:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 13:26:40,697 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:26:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:40,698 INFO L225 Difference]: With dead ends: 73 [2025-02-08 13:26:40,698 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 13:26:40,698 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:26:40,698 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:40,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:26:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 13:26:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 13:26:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 49 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:26:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-02-08 13:26:40,706 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 29 [2025-02-08 13:26:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:40,706 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-02-08 13:26:40,706 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:26:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-02-08 13:26:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:26:40,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:40,707 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:26:40,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:40,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:40,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:40,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash 918827731, now seen corresponding path program 1 times [2025-02-08 13:26:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130238982] [2025-02-08 13:26:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:40,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:26:40,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:26:40,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:40,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:41,042 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:26:41,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:41,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130238982] [2025-02-08 13:26:41,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130238982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:41,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:41,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:41,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887654710] [2025-02-08 13:26:41,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:41,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:41,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:41,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:41,043 INFO L87 Difference]: Start difference. First operand 52 states and 54 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:26:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:41,076 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-02-08 13:26:41,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:41,076 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:26:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:41,077 INFO L225 Difference]: With dead ends: 63 [2025-02-08 13:26:41,077 INFO L226 Difference]: Without dead ends: 62 [2025-02-08 13:26:41,077 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:26:41,078 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-08 13:26:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2025-02-08 13:26:41,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 58 states have internal predecessors, (63), 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:26:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-02-08 13:26:41,086 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 48 [2025-02-08 13:26:41,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:41,086 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-02-08 13:26:41,086 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:26:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-02-08 13:26:41,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 13:26:41,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:41,087 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:26:41,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 13:26:41,088 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:41,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 918832696, now seen corresponding path program 1 times [2025-02-08 13:26:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891085803] [2025-02-08 13:26:41,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:41,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 13:26:41,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 13:26:41,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:41,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:41,198 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:26:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:41,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891085803] [2025-02-08 13:26:41,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891085803] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:26:41,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:26:41,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:26:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394169822] [2025-02-08 13:26:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:26:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:26:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:41,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:26:41,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:26:41,201 INFO L87 Difference]: Start difference. First operand 61 states and 65 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:26:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:41,224 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-02-08 13:26:41,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:26:41,224 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:26:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:41,225 INFO L225 Difference]: With dead ends: 61 [2025-02-08 13:26:41,227 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 13:26:41,227 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:26:41,227 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:41,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 13:26:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-02-08 13:26:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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:26:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2025-02-08 13:26:41,233 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 48 [2025-02-08 13:26:41,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:41,234 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2025-02-08 13:26:41,234 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:26:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2025-02-08 13:26:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 13:26:41,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:41,239 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:26:41,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 13:26:41,240 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:41,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1558574473, now seen corresponding path program 1 times [2025-02-08 13:26:41,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090576050] [2025-02-08 13:26:41,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:41,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:41,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:41,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:41,388 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:26:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090576050] [2025-02-08 13:26:41,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090576050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:41,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711911291] [2025-02-08 13:26:41,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:26:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:41,392 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:26:41,397 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:26:41,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 13:26:41,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 13:26:41,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:26:41,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:41,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:41,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:41,658 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:26:41,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:41,674 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:26:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711911291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:41,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 13:26:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523210859] [2025-02-08 13:26:41,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 13:26:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:41,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 13:26:41,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 13:26:41,676 INFO L87 Difference]: Start difference. First operand 56 states and 59 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:26:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:41,710 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2025-02-08 13:26:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:41,711 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:26:41,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:41,711 INFO L225 Difference]: With dead ends: 84 [2025-02-08 13:26:41,711 INFO L226 Difference]: Without dead ends: 74 [2025-02-08 13:26:41,712 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:26:41,712 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 83 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:26:41,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 83 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-08 13:26:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-08 13:26:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 71 states have (on average 1.056338028169014) internal successors, (75), 71 states have internal predecessors, (75), 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:26:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2025-02-08 13:26:41,717 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 55 [2025-02-08 13:26:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2025-02-08 13:26:41,718 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:26:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2025-02-08 13:26:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 13:26:41,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:26:41,719 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:26:41,727 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:26:41,923 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,SelfDestructingSolverStorable11 [2025-02-08 13:26:41,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 37 more)] === [2025-02-08 13:26:41,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:26:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1763489849, now seen corresponding path program 2 times [2025-02-08 13:26:41,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:26:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556676649] [2025-02-08 13:26:41,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:26:41,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:26:41,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:26:41,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:41,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:42,017 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:26:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:26:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556676649] [2025-02-08 13:26:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556676649] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:26:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422350134] [2025-02-08 13:26:42,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 13:26:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:42,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:26:42,020 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:26:42,021 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:26:42,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-08 13:26:42,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-02-08 13:26:42,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 13:26:42,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:26:42,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 13:26:42,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:26:42,308 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:26:42,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 13:26:42,352 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:26:42,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422350134] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 13:26:42,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 13:26:42,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 13:26:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812279012] [2025-02-08 13:26:42,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 13:26:42,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 13:26:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:26:42,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 13:26:42,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 13:26:42,353 INFO L87 Difference]: Start difference. First operand 74 states and 77 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:26:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:26:42,394 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2025-02-08 13:26:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 13:26:42,394 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:26:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:26:42,394 INFO L225 Difference]: With dead ends: 74 [2025-02-08 13:26:42,394 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 13:26:42,395 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:26:42,395 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 13:26:42,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 13:26:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 13:26:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 13:26:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:26:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 13:26:42,396 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2025-02-08 13:26:42,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:26:42,396 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 13:26:42,396 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:26:42,396 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 13:26:42,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 13:26:42,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 40 remaining) [2025-02-08 13:26:42,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 40 remaining) [2025-02-08 13:26:42,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 40 remaining) [2025-02-08 13:26:42,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 40 remaining) [2025-02-08 13:26:42,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONUNSUPPORTED_FEATURE (35 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 40 remaining) [2025-02-08 13:26:42,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 40 remaining) [2025-02-08 13:26:42,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 40 remaining) [2025-02-08 13:26:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 40 remaining) [2025-02-08 13:26:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 40 remaining) [2025-02-08 13:26:42,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONUNSUPPORTED_FEATURE (10 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 40 remaining) [2025-02-08 13:26:42,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 40 remaining) [2025-02-08 13:26:42,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 13:26:42,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:26:42,607 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 13:26:42,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 13:26:42,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 13:26:42,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:26:42 BoogieIcfgContainer [2025-02-08 13:26:42,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 13:26:42,735 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 13:26:42,735 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 13:26:42,735 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 13:26:42,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:26:36" (3/4) ... [2025-02-08 13:26:42,740 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 13:26:42,744 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 13:26:42,745 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_strcpy [2025-02-08 13:26:42,752 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 13:26:42,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 13:26:42,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 13:26:42,755 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 13:26:42,756 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 13:26:42,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 13:26:42,857 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 13:26:42,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 13:26:42,858 INFO L158 Benchmark]: Toolchain (without parser) took 8554.63ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 126.6MB in the beginning and 152.0MB in the end (delta: -25.4MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,858 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 734.33ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 52.1MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.08ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 44.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: Boogie Preprocessor took 112.57ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 120.2MB in the end (delta: -75.4MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: IcfgBuilder took 824.14ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 123.3MB in the end (delta: -3.1MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: TraceAbstraction took 6684.66ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 122.2MB in the beginning and 160.3MB in the end (delta: -38.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,859 INFO L158 Benchmark]: Witness Printer took 123.00ms. Allocated memory is still 276.8MB. Free memory was 160.3MB in the beginning and 152.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 13:26:42,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 734.33ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 52.1MB in the end (delta: 74.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.08ms. Allocated memory is still 167.8MB. Free memory was 52.1MB in the beginning and 44.8MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.57ms. Allocated memory is still 167.8MB. Free memory was 44.8MB in the beginning and 120.2MB in the end (delta: -75.4MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * IcfgBuilder took 824.14ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 123.3MB in the end (delta: -3.1MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6684.66ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 122.2MB in the beginning and 160.3MB in the end (delta: -38.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. * Witness Printer took 123.00ms. Allocated memory is still 276.8MB. Free memory was 160.3MB in the beginning and 152.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2153]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2012]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2012]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1996]: there are no unsupported features in the program For all program executions holds that there are no unsupported features in the program at this location - PositiveResult [Line: 1955]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1955]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1982]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1982]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1979]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1979]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1975]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1975]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1972]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1972]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1966]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1966]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1965]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1965]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1963]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1963]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 382]: there are no unsupported features in the program For all program executions holds that there are no unsupported features in the program at this location - PositiveResult [Line: 2144]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2144]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2149]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2149]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2141]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 40 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 697 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 279 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=12, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 583 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 728 ConstructedInterpolants, 0 QuantifiedInterpolants, 1138 SizeOfPredicates, 2 NumberOfNonLiveVariables, 6861 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 1450/1683 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold - InvariantResult [Line: 2153]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 2144]: Location Invariant Derived location invariant: ((((0 <= (argc + 2147483648)) && (i <= 2147483646)) && (0 <= i)) && (argc <= 10000)) - InvariantResult [Line: 2134]: Location Invariant Derived location invariant: ((0 < i) || (i == 0)) - InvariantResult [Line: 2149]: Location Invariant Derived location invariant: ((((((0 <= (argc + 2147483648)) && (1 <= j)) && (0 <= i)) && (argc <= 10000)) && (i <= 2147483645)) || (((((0 <= (argc + 2147483648)) && (j == 0)) && (0 <= i)) && (argc <= 10000)) && (i <= 2147483645))) RESULT: Ultimate proved your program to be correct! [2025-02-08 13:26:42,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE