./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/du-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:51:15,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:51:15,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:51:15,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:51:15,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:51:15,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:51:15,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:51:15,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:51:15,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:51:15,949 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:51:15,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:51:15,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:51:15,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:51:15,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:51:15,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:51:15,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:15,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:51:15,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:51:15,953 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/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 -> 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f [2025-03-09 05:51:16,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:51:16,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:51:16,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:51:16,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:51:16,184 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:51:16,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-03-09 05:51:17,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c071936/b743b668a1a24cc48719775b72fe976d/FLAG09a4fc44d [2025-03-09 05:51:17,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:51:17,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-03-09 05:51:17,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c071936/b743b668a1a24cc48719775b72fe976d/FLAG09a4fc44d [2025-03-09 05:51:17,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30c071936/b743b668a1a24cc48719775b72fe976d [2025-03-09 05:51:17,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:51:17,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:51:17,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:17,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:51:17,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:51:17,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:17" (1/1) ... [2025-03-09 05:51:17,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13cafb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:17, skipping insertion in model container [2025-03-09 05:51:17,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:17" (1/1) ... [2025-03-09 05:51:17,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:51:18,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:18,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:51:19,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:19,325 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:51:19,330 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:51:19,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19 WrapperNode [2025-03-09 05:51:19,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:19,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:19,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:51:19,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:51:19,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,712 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11043 [2025-03-09 05:51:19,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:19,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:51:19,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:51:19,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:51:19,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,833 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:51:19,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:19,834 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:51:20,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:51:20,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:51:20,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:51:20,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (1/1) ... [2025-03-09 05:51:20,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:20,248 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 05:51:20,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:51:20,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:51:20,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:51:20,268 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:51:20,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:51:20,690 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:51:20,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:51:21,141 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3682: havoc lstat_#t~ret345#1; [2025-03-09 05:51:21,141 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774: call ULTIMATE.dealloc(~#statbuf~0#1.base, ~#statbuf~0#1.offset);havoc ~#statbuf~0#1.base, ~#statbuf~0#1.offset; [2025-03-09 05:51:21,141 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-09 05:51:21,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3678: havoc #t~ret344#1; [2025-03-09 05:51:40,489 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2912: havoc __main_#t~mem136#1; [2025-03-09 05:51:40,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-09 05:51:40,490 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc getopt_long_#t~ret373#1; [2025-03-09 05:51:40,682 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-09 05:51:40,682 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:51:40,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:51:40,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:51:40,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:40 BoogieIcfgContainer [2025-03-09 05:51:40,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:51:40,734 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:51:40,734 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:51:40,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:51:40,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:51:17" (1/3) ... [2025-03-09 05:51:40,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d21908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:40, skipping insertion in model container [2025-03-09 05:51:40,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:19" (2/3) ... [2025-03-09 05:51:40,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d21908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:40, skipping insertion in model container [2025-03-09 05:51:40,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:40" (3/3) ... [2025-03-09 05:51:40,743 INFO L128 eAbstractionObserver]: Analyzing ICFG du-2.i [2025-03-09 05:51:40,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:51:40,757 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-2.i that has 14 procedures, 693 locations, 1 initial locations, 39 loop locations, and 77 error locations. [2025-03-09 05:51:40,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:51:40,830 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;@27231c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:51:40,830 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-03-09 05:51:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 693 states, 561 states have (on average 1.64349376114082) internal successors, (922), 644 states have internal predecessors, (922), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-09 05:51:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:51:40,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:40,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:51:40,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:51:40,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 36170175, now seen corresponding path program 1 times [2025-03-09 05:51:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775327808] [2025-03-09 05:51:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:43,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:51:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:51:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:43,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:45,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:45,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775327808] [2025-03-09 05:51:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775327808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:45,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95646299] [2025-03-09 05:51:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:45,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:45,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:45,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:45,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:45,040 INFO L87 Difference]: Start difference. First operand has 693 states, 561 states have (on average 1.64349376114082) internal successors, (922), 644 states have internal predecessors, (922), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 05:51:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:45,246 INFO L93 Difference]: Finished difference Result 1267 states and 1893 transitions. [2025-03-09 05:51:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:45,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 05:51:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:45,256 INFO L225 Difference]: With dead ends: 1267 [2025-03-09 05:51:45,257 INFO L226 Difference]: Without dead ends: 578 [2025-03-09 05:51:45,262 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-03-09 05:51:45,264 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:45,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1574 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-09 05:51:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-09 05:51:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 483 states have (on average 1.5734989648033126) internal successors, (760), 538 states have internal predecessors, (760), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:51:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 825 transitions. [2025-03-09 05:51:45,335 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 825 transitions. Word has length 4 [2025-03-09 05:51:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:45,335 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 825 transitions. [2025-03-09 05:51:45,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-09 05:51:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 825 transitions. [2025-03-09 05:51:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:51:45,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:45,337 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:51:45,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:51:45,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:51:45,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:45,338 INFO L85 PathProgramCache]: Analyzing trace with hash -490006508, now seen corresponding path program 1 times [2025-03-09 05:51:45,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346212282] [2025-03-09 05:51:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:47,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:51:47,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:51:47,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:47,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346212282] [2025-03-09 05:51:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346212282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678752434] [2025-03-09 05:51:48,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:48,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:48,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:48,593 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:48,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 05:51:50,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:51:52,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:51:52,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:52,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:52,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 18366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:52,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:52,570 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678752434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:51:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569733350] [2025-03-09 05:51:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:52,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:52,571 INFO L87 Difference]: Start difference. First operand 578 states and 825 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-03-09 05:51:52,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:52,708 INFO L93 Difference]: Finished difference Result 578 states and 825 transitions. [2025-03-09 05:51:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:52,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-03-09 05:51:52,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:52,712 INFO L225 Difference]: With dead ends: 578 [2025-03-09 05:51:52,712 INFO L226 Difference]: Without dead ends: 577 [2025-03-09 05:51:52,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-03-09 05:51:52,713 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:52,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1569 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-09 05:51:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-03-09 05:51:52,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 483 states have (on average 1.5714285714285714) internal successors, (759), 537 states have internal predecessors, (759), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:51:52,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 824 transitions. [2025-03-09 05:51:52,747 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 824 transitions. Word has length 7 [2025-03-09 05:51:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:52,748 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 824 transitions. [2025-03-09 05:51:52,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-03-09 05:51:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 824 transitions. [2025-03-09 05:51:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:51:52,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:52,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:51:52,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:51:52,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:52,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:51:52,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1989668545, now seen corresponding path program 1 times [2025-03-09 05:51:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602530530] [2025-03-09 05:51:52,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:52,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:51:55,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:51:55,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:55,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:51:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602530530] [2025-03-09 05:51:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602530530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007800057] [2025-03-09 05:51:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:55,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:55,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:55,689 INFO L87 Difference]: Start difference. First operand 577 states and 824 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-09 05:51:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:55,790 INFO L93 Difference]: Finished difference Result 577 states and 824 transitions. [2025-03-09 05:51:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:55,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 05:51:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:55,793 INFO L225 Difference]: With dead ends: 577 [2025-03-09 05:51:55,793 INFO L226 Difference]: Without dead ends: 576 [2025-03-09 05:51:55,793 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-03-09 05:51:55,794 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 0 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:55,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1570 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-09 05:51:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2025-03-09 05:51:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 481 states have (on average 1.5717255717255718) internal successors, (756), 534 states have internal predecessors, (756), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:51:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 821 transitions. [2025-03-09 05:51:55,810 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 821 transitions. Word has length 8 [2025-03-09 05:51:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:55,811 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 821 transitions. [2025-03-09 05:51:55,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-03-09 05:51:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 821 transitions. [2025-03-09 05:51:55,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:51:55,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:55,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:55,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:51:55,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:51:55,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash -755050096, now seen corresponding path program 1 times [2025-03-09 05:51:55,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069463642] [2025-03-09 05:51:55,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:57,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:51:57,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:51:57,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:57,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069463642] [2025-03-09 05:51:58,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069463642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508572989] [2025-03-09 05:51:58,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:58,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:58,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:58,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:58,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 05:52:00,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:52:02,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:52:02,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:02,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:02,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:52:02,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:52:02,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508572989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:02,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:52:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016154731] [2025-03-09 05:52:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:02,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:02,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:02,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:02,521 INFO L87 Difference]: Start difference. First operand 574 states and 821 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-09 05:52:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:02,619 INFO L93 Difference]: Finished difference Result 574 states and 821 transitions. [2025-03-09 05:52:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:02,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-03-09 05:52:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:02,624 INFO L225 Difference]: With dead ends: 574 [2025-03-09 05:52:02,624 INFO L226 Difference]: Without dead ends: 572 [2025-03-09 05:52:02,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-03-09 05:52:02,627 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 517 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:02,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1063 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-09 05:52:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-09 05:52:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 481 states have (on average 1.5675675675675675) internal successors, (754), 532 states have internal predecessors, (754), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 819 transitions. [2025-03-09 05:52:02,645 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 819 transitions. Word has length 12 [2025-03-09 05:52:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:02,648 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 819 transitions. [2025-03-09 05:52:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-03-09 05:52:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 819 transitions. [2025-03-09 05:52:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:52:02,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:02,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:02,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:02,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 05:52:02,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:02,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1931715393, now seen corresponding path program 1 times [2025-03-09 05:52:02,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:02,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674722840] [2025-03-09 05:52:02,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:02,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:04,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:04,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:04,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:05,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:05,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674722840] [2025-03-09 05:52:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674722840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:05,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664990905] [2025-03-09 05:52:05,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:05,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:05,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:05,582 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:05,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 05:52:07,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:09,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:09,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 18384 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:09,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:09,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664990905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:09,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:52:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150682686] [2025-03-09 05:52:09,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:09,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:52:09,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:09,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:52:09,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:09,426 INFO L87 Difference]: Start difference. First operand 572 states and 819 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-09 05:52:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:09,576 INFO L93 Difference]: Finished difference Result 1147 states and 1643 transitions. [2025-03-09 05:52:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-03-09 05:52:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:09,579 INFO L225 Difference]: With dead ends: 1147 [2025-03-09 05:52:09,579 INFO L226 Difference]: Without dead ends: 581 [2025-03-09 05:52:09,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-03-09 05:52:09,583 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 4 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2348 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:09,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2348 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-09 05:52:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-03-09 05:52:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 490 states have (on average 1.5571428571428572) internal successors, (763), 541 states have internal predecessors, (763), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:09,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 828 transitions. [2025-03-09 05:52:09,601 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 828 transitions. Word has length 13 [2025-03-09 05:52:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:09,601 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 828 transitions. [2025-03-09 05:52:09,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-03-09 05:52:09,601 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 828 transitions. [2025-03-09 05:52:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:52:09,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:09,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:09,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:52:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:09,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:09,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:09,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1130926570, now seen corresponding path program 2 times [2025-03-09 05:52:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586599806] [2025-03-09 05:52:09,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:11,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:52:12,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:52:12,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:52:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:52:13,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:13,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586599806] [2025-03-09 05:52:13,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586599806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:13,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:13,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:52:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850931783] [2025-03-09 05:52:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:13,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:52:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:13,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:52:13,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:13,375 INFO L87 Difference]: Start difference. First operand 581 states and 828 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-09 05:52:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:13,581 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2025-03-09 05:52:13,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:52:13,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-09 05:52:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:13,585 INFO L225 Difference]: With dead ends: 581 [2025-03-09 05:52:13,585 INFO L226 Difference]: Without dead ends: 579 [2025-03-09 05:52:13,585 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-03-09 05:52:13,586 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 516 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:13,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2574 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:52:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-09 05:52:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2025-03-09 05:52:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 490 states have (on average 1.5530612244897959) internal successors, (761), 539 states have internal predecessors, (761), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 826 transitions. [2025-03-09 05:52:13,604 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 826 transitions. Word has length 22 [2025-03-09 05:52:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 826 transitions. [2025-03-09 05:52:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-03-09 05:52:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 826 transitions. [2025-03-09 05:52:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:52:13,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:13,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:13,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:52:13,638 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:13,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:13,641 INFO L85 PathProgramCache]: Analyzing trace with hash -633906112, now seen corresponding path program 1 times [2025-03-09 05:52:13,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:13,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451867923] [2025-03-09 05:52:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:52:15,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:52:15,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:15,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:52:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:16,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451867923] [2025-03-09 05:52:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451867923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:52:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618610913] [2025-03-09 05:52:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:16,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:16,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:16,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:16,509 INFO L87 Difference]: Start difference. First operand 579 states and 826 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:16,608 INFO L93 Difference]: Finished difference Result 1141 states and 1636 transitions. [2025-03-09 05:52:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:52:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:16,610 INFO L225 Difference]: With dead ends: 1141 [2025-03-09 05:52:16,611 INFO L226 Difference]: Without dead ends: 582 [2025-03-09 05:52:16,612 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-03-09 05:52:16,612 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:16,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1559 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-09 05:52:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-03-09 05:52:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 493 states have (on average 1.5496957403651115) internal successors, (764), 542 states have internal predecessors, (764), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 829 transitions. [2025-03-09 05:52:16,624 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 829 transitions. Word has length 27 [2025-03-09 05:52:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 829 transitions. [2025-03-09 05:52:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 829 transitions. [2025-03-09 05:52:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:52:16,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:16,625 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, 1] [2025-03-09 05:52:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:52:16,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:16,626 INFO L85 PathProgramCache]: Analyzing trace with hash 280069795, now seen corresponding path program 1 times [2025-03-09 05:52:16,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:16,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482347465] [2025-03-09 05:52:16,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:18,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:18,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:52:19,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:19,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482347465] [2025-03-09 05:52:19,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482347465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:19,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:19,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:19,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701513659] [2025-03-09 05:52:19,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:19,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:19,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:19,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:19,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:19,319 INFO L87 Difference]: Start difference. First operand 582 states and 829 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-03-09 05:52:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:19,416 INFO L93 Difference]: Finished difference Result 595 states and 844 transitions. [2025-03-09 05:52:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:19,417 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 30 [2025-03-09 05:52:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:19,419 INFO L225 Difference]: With dead ends: 595 [2025-03-09 05:52:19,419 INFO L226 Difference]: Without dead ends: 593 [2025-03-09 05:52:19,419 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-03-09 05:52:19,420 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 3 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:19,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1556 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-09 05:52:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-03-09 05:52:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 502 states have (on average 1.547808764940239) internal successors, (777), 551 states have internal predecessors, (777), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 842 transitions. [2025-03-09 05:52:19,432 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 842 transitions. Word has length 30 [2025-03-09 05:52:19,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:19,432 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 842 transitions. [2025-03-09 05:52:19,432 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-03-09 05:52:19,432 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 842 transitions. [2025-03-09 05:52:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:52:19,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:19,432 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:19,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:52:19,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:19,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:19,433 INFO L85 PathProgramCache]: Analyzing trace with hash 280069955, now seen corresponding path program 1 times [2025-03-09 05:52:19,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:19,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66503333] [2025-03-09 05:52:19,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:19,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:21,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:21,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:21,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:52:22,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66503333] [2025-03-09 05:52:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66503333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:22,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781148740] [2025-03-09 05:52:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:22,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:22,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:22,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 05:52:24,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:52:25,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:52:25,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:25,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:25,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 18569 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:25,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:52:26,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:52:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781148740] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:26,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:26,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:52:26,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169594704] [2025-03-09 05:52:26,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:26,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:52:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:26,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:52:26,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:52:26,160 INFO L87 Difference]: Start difference. First operand 591 states and 842 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-03-09 05:52:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:26,349 INFO L93 Difference]: Finished difference Result 1184 states and 1692 transitions. [2025-03-09 05:52:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:52:26,351 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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 30 [2025-03-09 05:52:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:26,353 INFO L225 Difference]: With dead ends: 1184 [2025-03-09 05:52:26,353 INFO L226 Difference]: Without dead ends: 608 [2025-03-09 05:52:26,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 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-03-09 05:52:26,357 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 5 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:26,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3098 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:52:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-09 05:52:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-09 05:52:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 520 states have (on average 1.525) internal successors, (793), 568 states have internal predecessors, (793), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 858 transitions. [2025-03-09 05:52:26,373 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 858 transitions. Word has length 30 [2025-03-09 05:52:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 858 transitions. [2025-03-09 05:52:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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-03-09 05:52:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 858 transitions. [2025-03-09 05:52:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:52:26,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:26,375 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:26,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:26,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:26,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:26,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -830624318, now seen corresponding path program 1 times [2025-03-09 05:52:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838518612] [2025-03-09 05:52:26,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:28,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:52:28,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:52:28,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:28,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:52:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838518612] [2025-03-09 05:52:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838518612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644290466] [2025-03-09 05:52:29,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:29,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:29,130 INFO L87 Difference]: Start difference. First operand 608 states and 858 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:29,193 INFO L93 Difference]: Finished difference Result 608 states and 858 transitions. [2025-03-09 05:52:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:29,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:52:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:29,197 INFO L225 Difference]: With dead ends: 608 [2025-03-09 05:52:29,197 INFO L226 Difference]: Without dead ends: 607 [2025-03-09 05:52:29,197 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-03-09 05:52:29,197 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:29,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1557 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-09 05:52:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-03-09 05:52:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 516 states have (on average 1.5251937984496124) internal successors, (787), 563 states have internal predecessors, (787), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 852 transitions. [2025-03-09 05:52:29,208 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 852 transitions. Word has length 49 [2025-03-09 05:52:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:29,209 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 852 transitions. [2025-03-09 05:52:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 852 transitions. [2025-03-09 05:52:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:52:29,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:29,210 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:29,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 05:52:29,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash -61307712, now seen corresponding path program 1 times [2025-03-09 05:52:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382272713] [2025-03-09 05:52:29,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:31,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:52:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:52:31,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:31,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:32,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382272713] [2025-03-09 05:52:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382272713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:52:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024081310] [2025-03-09 05:52:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:32,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:52:32,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:32,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:52:32,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:52:32,220 INFO L87 Difference]: Start difference. First operand 603 states and 852 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-03-09 05:52:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:32,318 INFO L93 Difference]: Finished difference Result 1151 states and 1642 transitions. [2025-03-09 05:52:32,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:52:32,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 05:52:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:32,321 INFO L225 Difference]: With dead ends: 1151 [2025-03-09 05:52:32,321 INFO L226 Difference]: Without dead ends: 605 [2025-03-09 05:52:32,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:52:32,322 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 0 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:32,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2338 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-09 05:52:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-03-09 05:52:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 518 states have (on average 1.5231660231660231) internal successors, (789), 565 states have internal predecessors, (789), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 854 transitions. [2025-03-09 05:52:32,334 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 854 transitions. Word has length 50 [2025-03-09 05:52:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:32,335 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 854 transitions. [2025-03-09 05:52:32,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-03-09 05:52:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 854 transitions. [2025-03-09 05:52:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:52:32,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:32,336 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:52:32,336 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -60384191, now seen corresponding path program 1 times [2025-03-09 05:52:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052290993] [2025-03-09 05:52:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:34,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:52:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:52:34,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:34,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:34,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:34,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052290993] [2025-03-09 05:52:34,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052290993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:34,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27038775] [2025-03-09 05:52:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:34,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:34,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:34,962 INFO L87 Difference]: Start difference. First operand 605 states and 854 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-09 05:52:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:35,074 INFO L93 Difference]: Finished difference Result 900 states and 1288 transitions. [2025-03-09 05:52:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:35,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 05:52:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:35,077 INFO L225 Difference]: With dead ends: 900 [2025-03-09 05:52:35,077 INFO L226 Difference]: Without dead ends: 898 [2025-03-09 05:52:35,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-03-09 05:52:35,078 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 410 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:35,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1545 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-09 05:52:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 609. [2025-03-09 05:52:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 522 states have (on average 1.5210727969348659) internal successors, (794), 569 states have internal predecessors, (794), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 859 transitions. [2025-03-09 05:52:35,091 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 859 transitions. Word has length 50 [2025-03-09 05:52:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 859 transitions. [2025-03-09 05:52:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-03-09 05:52:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 859 transitions. [2025-03-09 05:52:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 05:52:35,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:35,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:35,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:52:35,092 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:35,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash -180048123, now seen corresponding path program 1 times [2025-03-09 05:52:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:35,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573524844] [2025-03-09 05:52:35,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:36,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 05:52:37,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 05:52:37,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:37,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573524844] [2025-03-09 05:52:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573524844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460482910] [2025-03-09 05:52:37,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:37,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:37,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:37,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:37,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 05:52:40,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 05:52:41,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 05:52:41,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:41,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:41,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 18732 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:41,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:41,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:41,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460482910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:41,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:52:41,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178851850] [2025-03-09 05:52:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:41,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:52:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:41,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:52:41,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:41,885 INFO L87 Difference]: Start difference. First operand 609 states and 859 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:42,063 INFO L93 Difference]: Finished difference Result 902 states and 1291 transitions. [2025-03-09 05:52:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:52:42,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2025-03-09 05:52:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:42,066 INFO L225 Difference]: With dead ends: 902 [2025-03-09 05:52:42,066 INFO L226 Difference]: Without dead ends: 901 [2025-03-09 05:52:42,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-03-09 05:52:42,066 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 819 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:42,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 2333 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:52:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-09 05:52:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 608. [2025-03-09 05:52:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 522 states have (on average 1.5191570881226053) internal successors, (793), 568 states have internal predecessors, (793), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 05:52:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 858 transitions. [2025-03-09 05:52:42,080 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 858 transitions. Word has length 54 [2025-03-09 05:52:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:42,080 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 858 transitions. [2025-03-09 05:52:42,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:52:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 858 transitions. [2025-03-09 05:52:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:52:42,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:42,082 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:42,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:52:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 05:52:42,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-09 05:52:42,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:42,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2079079368, now seen corresponding path program 1 times [2025-03-09 05:52:42,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786908889] [2025-03-09 05:52:42,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:44,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:52:44,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:52:44,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:44,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:52:45,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:45,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786908889] [2025-03-09 05:52:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786908889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086590772] [2025-03-09 05:52:45,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:45,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:45,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:45,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:45,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process